In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] ...
James E. Smith, Shlomo Weiss, Nicholas Y. Pang
Decoupled architectures achieve high scalar performance by cleanly splitting instruction processing into memory access and execution tasks. Several decoupled architectures have been proposed, and they all have two characteristics in common: 1) they ...
The "hit ratio" of a high-speed buffer (cache) depends on the "locality" of memory references. However, locality of reference is disturbed and the hit ratio decreases whenever a task switch occurs. This performance degradation can ...
Israel Koren, Zahava Koren, Stephen Y. H. Su
Recovery procedures involving time redundancy in the form of instruction retries and program rollbacks have proved to be very effective against transient failures in computer systems. A class of such recovery procedures is presented and analyzed ...
Algorithms for the parallel multiplication of two n- bit binary numbers by an iterative array of logic cells are discussed. The regular interconnection structures of the multiplier array cell elements, which are ideal for VLSI implementation, are ...
Sudhakar M. Reddy, Madhukar K. Reddy
In this paper, potential invalidation of stuck-open fault-detecting tests, derived by neglecting circuit delays and charge distribution in CMOS logic circuits, is studied. Several classes of circuits derived from sum of products and product of sums ...
Miron Abramovici, P.R. Menon, David T. Miller
Stuck-at faults on primary inputs and fan-out branches are commonly used as target faults in test generation algorithms for combinational circuits. This correspondence shows that these faults may not constitute an adequate set of target faults. A ...
A set of characterizing parameters, called ratio parameters, has been used to formulate an efficient algorithm for realizing any given Boolean funetion with a single multiplexer of minimum size. The algorithm is applicable to fuctions of a large ...
We show that any Boolean function f which can be expressed in a sum-of-products form using m product terms can contain as many as 2m- 1 implicants but no more.