The false path problem is often referred to as the problem of detecting the longest sensitizable path (A path which is not a false path is a sensitizable path). The term “false path” is not clearly defined. In this paper, we first give a clear and precise definition of a false path. Then the general false path problem is formulated. The general false path problem is to detect whether a given path (not necessarily the longest one) is a false path. We present an efficient algorithm for solving the general false path problem. We also propose another algorithm which generates all the possible sensitizable paths with the delays greater than a given threshold T. The efficiency and effectiveness of the proposed algorithm are demonstrated by the experimental results.

Path extracting algorithms are a very important part of timing analysis approach. In this paper we designed and developed several algorithms which can generate the K most critical paths in a non-increasing order of their delays. The effectiveness of these algorithms is shown by some experimental results.

A file system tailored to the general needs of the office environment is proposed. This system supports large numbers of a wide variety of documents and inexact fuzzy queries on the documents. The file system is based on a multilevel file structure that combines and extends multikey extendible hashing and signature files to create a document-retrieval system that is more time efficient than other previously proposed systems and is also space efficient.>

The authors propose basic access protocols for a twin-bus unidirectional bus system (UBS) implementation. The proposed protocols are fairly similar to that of Fasnet. However, the gaps between cycles have been considerably reduced. The savings will particularly increase with cable bandwidth. In fact, except for a few cases of light load traffic the proposed protocol achieves close to 100% channel utilization.>

A technique is presented whereby queueing network models and generalized stochastic Petri nets are combined in such a way as to exploit the best features of both modeling techniques. The resulting hierarchical modeling approach is useful in the solution of complex models of system behavior. The authors have chosen two examples from the recent literature to illustrate the power and scope of this technique. They also demonstrate how folding of the generalized stochastic Petri net models for these two examples is useful in obtaining efficiently solvable, approximate models (bounding models).>

CAD databases have been used to store design data and to integrate design tools in IC/VLSI design systems. However, the requirements for a “good” CAD database are much more complex than those for a conventional database. Due to both the complexity of various design processes and the enormous amount of data involved in a practical CAD database, we believe that a two-level hierarchical database including a global database and a set of local databases is necessary. In this paper, we propose a framework for such CAD databases. We concentrate on the overall system architecture.

A file system tailored to the general needs of the office environment is proposed. This system supports large numbers of a wide variety of documents and inexact ‘fuzzy’ queries on the documents. The file system is based on a multilevel file structure; the structure combines and extends multikey extendible hashing and signature files to create a document retrieval system that is more time efficient than other previously proposed systems, and also space efficient.

A new, fully-distributed protocol for integrated voice/data traffic in a local-area, random-access broadcast network is described. The protocol introduces a movable voice-data boundary to framed TDMA/CSMA and eliminates the requirement of system-wide synchronized clocks. The movable boundary is a major advantage in any system where fluctuations in voice and data loads are expected because assignment of idle capacity from one traffic class to the other increases the utilization of the channel. The protocol provides collision-free virtual circuits for voice and periods of non-persistent CSMA/CD for data traffic and call establishment, and can support multi-party calls as well as two-way conversations. The protocol allows variable-size voice packets that have very low overhead and variable-size data packets that may be much longer than voice packets. This is of significant practical advantage over previous work, which has required fixed-size voice and/or data packets, or voice packets with high overhead. A method of dynamically controlling the movable boundary to balance the voice and data traffic is also proposed.

Much work has been done on the modeling of hardware resources; far fewer studies have been conducted on the impact of software systems on the underlying hardware. The authors address one such case in which blocking is present because of critical sections of code; this cannot be treated within the framework of product-form queuing network models. They show how a combination of generalized stochastic petri nets and queuing networks can easily model the situation under consideration. In addition, they show how a simple extension of this model can be applied to studying realistic systems with several domains.

We develop Generalized Stochastic Petri Net models for several priority queueing disciplines. The building blocks of these models are explained and many variants are easily derivable from them. We then combine these building blocks with product-form queueing network models. Numerical results are provided that illustrate the effectiveness of the method.