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.
References
-
-
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)
-
Martin, A.J.: `Collected papers on asynchronous VLSI design', Caltech-CS-TR-90-09, Technical Report, 1990, p. 50.
-
3)
-
M. Mendler ,
T. Stroup
.
Newtonian arbiters cannot be proven correct.
Formal Methods Syst. Design
,
3 ,
233 -
257
-
4)
-
C.L. Seitz
.
Ideas about arbiters.
Lambda
,
1 ,
10 -
14
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19990617
Related content
content/journals/10.1049/el_19990617
pub_keyword,iet_inspecKeyword,pub_concept
6
6