Opens in BICMOS structures are analyzed here. It is shown that some opens cannot be detected by stuck-fault or other functional tests, since some transistors in BiCMOS gates do not affect the logical function of the g...
详细信息
Opens in BICMOS structures are analyzed here. It is shown that some opens cannot be detected by stuck-fault or other functional tests, since some transistors in BiCMOS gates do not affect the logical function of the gate. A switch-level model for CMOS circuits is extended to include bipolar devices. With this switch-level model, opens that cannot be detected by stuck-faults or other functional tests are easily identified. It is also shown that, in BICMOS circuits, an open defect in one transistor can accelerate the wearout of another nondefective transistor.
This paper describes version three of UltraSAN, a software environment for the performance, dependability, and performability evaluation of computer networks and systems. The package makes use of both analytic-and sim...
详细信息
Group-oriented multicast protocols that provide message ordering and delivery guarantees are becoming increasingly important in distributed system design. However, despite the large number of such protocols, little an...
详细信息
Group-oriented multicast protocols that provide message ordering and delivery guarantees are becoming increasingly important in distributed system design. However, despite the large number of such protocols, little analytical work has been done concerning their performance, especially in the presence of message loss. This paper illustrates a method for determining the performability of group-oriented multicast protocols using stochastic activity networks, a stochastic extension to Petri nets, and reduced base model construction. In particular, we study the performability of one such protocol, called Psync, under a wide variety of workload and message loss probabilities. The specific focus is on measuring two quantities, the stabilization time-that is, the time required for messages to arrive at all hosts-and channel utilization. The analysis shows that Psync works well when message transmissions are frequent, but exhibits extremely long message stabilization times when transmissions are infrequent and message losses occur. The results provide useful insight on the behavior of Psync, as well as serve as a guide for evaluating the performability of other group-oriented multicast protocols.
UltraSAN is a software package for model-based evaluation of systems represented as stochastic activity networks. The software has been implemented in a modular fashion, with clearly delineated interfaces between mode...
详细信息
UltraSAN is a software package for model-based evaluation of systems represented as stochastic activity networks. The software has been implemented in a modular fashion, with clearly delineated interfaces between model specification, construction, and solution. UltraSAN offers an X Windows-based user interface and both analytical and simulation solution modules for transient and steady-state performance, dependability, and performability measures. Furthermore, the tool facilitates graphical representation of the obtained results by its report generator. This paper gives a very brief overview and pointers to more detailed descriptions of the software.
Large-scale data storage systems rely on magnetic tape cartridges to store millions of data objects. As these tapes age, the resident data objects become invalid; consequently, less and less of the tape potential capa...
详细信息
Large-scale data storage systems rely on magnetic tape cartridges to store millions of data objects. As these tapes age, the resident data objects become invalid; consequently, less and less of the tape potential capacity is effectively utilized. To address this problem, data storage systems have a facility, called "recycle" in this paper, that transfers valid data objects from sparsely populated tapes onto new tapes, thus creating empty tapes for reuse. A high performance recycle process is needed to keep the number of tape cartridges to a minimum, and to maintain a continuous supply of empty tapes for storing newly created data objects. The performance of such processes is not easy to determine, and depends strongly on the data stored on the tapes, the speed and characteristics of the computer on which recycle is executed, and the nature of the algorithms themselves. This paper documents an extensive effort to evaluate a proposed recycle algorithm, using held workload data, laboratory measurements, and modeling. The results of the study were used to improve the recycle process, and were later verified through field trials. In addition yielding the results themselves, the effort illustrated that modeling and measurement, in an industrial setting, can indeed be used successfully in the design process.< >
This paper deals with the communication in task-sharing between two autonomous six-legged robots equipped with object and goal sensing, and a repertoire of contact and light-following behaviors. The performance of pus...
详细信息
This paper deals with the communication in task-sharing between two autonomous six-legged robots equipped with object and goal sensing, and a repertoire of contact and light-following behaviors. The performance of pushing an elongated box towards a goal region is difficult for a single robot and improves significantly when performed cooperatively, but requires careful coordination between the robots. We present and experimentally demonstrate an approach that utilizes cooperation at three levels: sensing, action, and control, and takes the advantage of a simple communication protocol to compensate for the robots' noisy and uncertain sensing.
We use standard linear-time temporal logic to specify cryptographic protocols, model the system penetrator, and specify correctness requirements. The requirements are specified as standard safety properties, for which...
详细信息
We use standard linear-time temporal logic to specify cryptographic protocols, model the system penetrator, and specify correctness requirements. The requirements are specified as standard safety properties, for which standard proof techniques apply. In particular, we are able to prove that the system penetrator cannot obtain a session key by any logical or algebraic techniques. We compare our work to Meadows' method. We argue that using standard temporal logic provides greater flexibility and generality, firmer foundations, easier integration with other formal methods, and greater confidence in the verification results.
We set out a logic for reasoning about multilevel security of probabilistic systems. This logic includes modalities for time, knowledge, and probability. In earlier work we gave syntactic definitions of multilevel sec...
详细信息
We set out a logic for reasoning about multilevel security of probabilistic systems. This logic includes modalities for time, knowledge, and probability. In earlier work we gave syntactic definitions of multilevel security and showed that their semantic interpretations are equivalent to independently motivated information-theoretic definitions. This paper builds on that earlier work in two ways. First, it substantially recasts the language and model of computation into the more standard Halpern-Tuttle framework for reasoning about knowledge and probability. Second, it brings together two distinct characterizations of security from that work. One was equivalent to the information-theoretic security criterion for a system to be free of covert channels but was difficult to prove. The other was a verification condition that implied the first; it was more easily provable but was too strong. This paper presents a characterization that is syntactically very similar to our previous verification condition but is proven to be semantically equivalent to the security criterion. The new characterization also means that our security criterion is expressible in a simpler logic and model.
暂无评论