40 Years of Computing at Newcastle

Department Technical Report Series No. 537

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

K.S. Low
A. Yakovlev

University of Newcastle upon Tyne. 1995.

Abstract

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.


Department Technical Report Series - 1995
Department Technical Report Series Index
Contents Page - 40 Years of Computing at Newcastle
Technical Report Abstract No. 537, 30 June 1997