This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Concurrent Multiresource Arbiter: Design and Applications
Jan. 2013 (vol. 62 no. 1)
pp. 31-44
Stanislavs Golubcovs, Newcastle University, Newcastle upon Tyne
Delong Shang, Newcastle University, Newcastle upon Tyne
Fei Xia, Newcastle University, Newcastle upon Tyne
Andrey Mokhov, Newcastle University, Newcastle upon Tyne
Alex Yakovlev, Newcastle University, Newcastle upon Tyne
This paper presents a novel type of asynchronous arbiter that allocates M interchangeable resources among N clients. This arbiter enables the concurrent utilization of multiple resources and is a useful device in various load-balancing circuits. Dedicated request signals from the resources and the clients are used in pairs to form each new grant. The 2\times 2 arbiter is examined as an accessible special case of the N\times M arbiter. A concurrent implementation is compared to fully sequential design. It is shown that the sequential design can be more practical when the time between a grant and the withdrawal of the initial request is small. The concurrent design provides higher performance in a system with a longer resource utilization time. A scalable tiled structure is developed to extend the arbiter structure beyond 2\times 2 to support N clients and M resources. Models and subsequent implementations of the tiles are presented. The tiles can be repeated without the use of additional connecting logic, enabling the construction of arbiters of larger sizes. Several examples demonstrate the usage of the arbiter.
Index Terms:
Signal resolution,Logic gates,Integrated circuit modeling,Mathematical model,Concurrent computing,Equations,Availability,multiresource arbitration,Self-timed circuits,speed independent,asynchronous arbiters
Citation:
Stanislavs Golubcovs, Delong Shang, Fei Xia, Andrey Mokhov, Alex Yakovlev, "Concurrent Multiresource Arbiter: Design and Applications," IEEE Transactions on Computers, vol. 62, no. 1, pp. 31-44, Jan. 2013, doi:10.1109/TC.2011.218
Usage of this product signifies your acceptance of the Terms of Use.