Toggle Main Menu Toggle Search

Open Access padlockePrints

Token Ring Arbiters: An Exercise in Asynchronous Logic Design with Petri-Nets

Lookup NU author(s): Professor Alex Yakovlev



Designing an asynchronous communication architecture in a VLSI system, we have the choice of either using a token ring or a bus. The token ring structure is often more reliable then the bus structure because of its point-to-point interconnection. In this paper, we study two alternative token ring arbitration protocols which we call Busy Ring Protocol (BRP) and Lazy Ring Protocol (LRP). Their performance evaluation shows that BRP allows better response time under higher request rates, while its major disadvantage is waste of activity, and hence power, if the request traffic is relatively low. We describe the design of speed-independent control circuits for these two ring protocols. The initial specification of the protocol made in a Petri net is refined to a Signal Transition Graph, which is further implemented into a logical circuit by recently developed methods. The logical circuit involves, as a standard component, a two-way mutual exclusion (ME) element. The arbiter designs have been verified at all levels, using different Petri net interpretations. The final check has been performed using Cadence HSPICE simulation tool. We conclude with the idea of a ""hybrid"" approach, combining the advantages of both BRP and LRP.

Publication metadata

Author(s): Low KS, Yakovlev A

Publication type: Report

Publication status: Published

Series Title: Department of Computing Science Technical Report Series

Year: 1995

Pages: 38

Print publication date: 01/01/1995

Source Publication Date: 1995

Report Number: 537

Institution: Department of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne