Your browser does not support JavaScript!

Ordered arbiters

Ordered arbiters

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The granting of requests in the order of their arrival is not satisfied in existing 1/n arbiters, such as token rings, tree arbiters and networks of two-way arbiters. The proposed solution stores pending grants in a FIFO, thus maximally preserving the request order, improves fairness and offers lower metastability rate.


    1. 1)
      • Yakovlev, A.: `Designing arbiters using Petri nets', 1995 Israel Workshop on Asynchronous VLSI, 1995, VLSI Systems Research Center, Israel Institute of TechnologyHaifa, Israel, p. 179–201.
    2. 2)
      • Martin, A.J.: `Collected papers on asynchronous VLSI design', Caltech-CS-TR-90-09, Technical Report, 1990, p. 50.
    3. 3)
      • M. Mendler , T. Stroup . Newtonian arbiters cannot be proven correct. Formal Methods Syst. Design , 3 , 233 - 257
    4. 4)
      • C.L. Seitz . Ideas about arbiters. Lambda , 1 , 10 - 14

Related content

This is a required field
Please enter a valid email address