Asynchronous Modular Arbiter

Calvo, M. L.; Acha,

doi:10.1109/tc.1986.1676660

Cited by 8 publications

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

A method of shortening metastable operation duration time by the use of feedback

Sato

Okamoto

Sugiyama

et al. 1996

Systems & Computers in Japan

View full text Add to dashboard Cite

If metastable operation (MS operation) m u r s in conflict-resolving circuits, propagation delay time of flip-flop (FF) increases by the amount of its duration time and a malfunction may occur. This paper proposes a method of shortening duration time of MS operation that occurs when two inputs of RSFF consisting of CMOS NAND gates are switched from logic 0 to 1 approximately at the same instant. The MS operation is detected and fed back to inputs so that it is forced to terminate. A configuration of RSFF that has feedback based on this idea is first presented, and then a principle of shortening MS operation duration time follows. Then, considering implementation of RSFF by n-well process, feedback connection and MOSFET parameters are optimized. Although hardware increases slightly by addition of feedback, the result shows the MS operation duration time increase rate against input phase difference (switching time difference of two inputs of RSFF), and the range of input phase difference for MS operation incidence are reduced by ap-proximately 114 and 113, respectively, compared with conventional methods.

show abstract

A method of shortening metastable operation duration time by the use of feedback

Sato

Okamoto

Sugiyama

et al. 1996

Systems & Computers in Japan

View full text Add to dashboard Cite

show abstract

Analysis of Metastable Operation in a CMOS Dynamic D-Latch

Juan-Chico¹,

Bellido²,

Acosta³

et al. 1997

Analog Design Issues in Digital VLSI Circuits and Systems

View full text Add to dashboard Cite

Newtonian arbiters cannot be proven correct

Mendler

Stroup

1993

Form Method Syst Des

View full text Add to dashboard Cite

Abstract. Computing hardware is designed by refining an abstract specification through various lower levels of abstraction to arrive at a transistor layout implemented in a physical medium. Formalizing the refinements-one task of the mathematical semantics of computation-involves proving that the device described at each level of abstraction does indeed behave as prescribed by the description at the next higher level. One obstacle to this goal that has long been recognized is that certain classes of behaviors can be physically realized only approximately. The notorious problem of metastable operation precludes, for example, the realization on classical principles of flipflops that react in bounded time to arbitrary input signals.The literature suggests that the difficulty lies ultimately in the specification's requiring that the realizing device react properly in bounded time. We show, however, that a simple-time-unbounded synchronization problem, namely, mutual exclusion by means of an arbiter, cannot be solved with perfect reliability using continuous, i.e., Newtonian, physical phenomena. In particular, for any physical device operating on Newtonian principles that satisfies specific assumptions concerning an arbiter's input-output behavior, there always exist competing requests to which it reacts by granting them all.

show abstract

Asynchronous Modular Arbiter

Cited by 8 publications

References 15 publications

A method of shortening metastable operation duration time by the use of feedback

A method of shortening metastable operation duration time by the use of feedback

Analysis of Metastable Operation in a CMOS Dynamic D-Latch

Newtonian arbiters cannot be proven correct

Contact Info

Product

Resources

About