DocumentCode
2261300
Title
A lookahead arbiter for n-user b-server with non-favorite priority
Author
Chaudhry, G.M. ; Zhai, H.
Author_Institution
Dept. of Electr. & Comput. Eng., Missouri Univ., Columbia, MO, USA
fYear
1993
fDate
16-18 Aug 1993
Firstpage
629
Abstract
The paper presents the arbiter design using one level and two level lookahead technique with two step arbitration for N-user B-server case with favorite and non-favorite priorities. The implementation of the proposed arbiter can work more efficiently and faster than the iterative method and is fairer and more complete than pure lookahead technique in the realistic multiprocessor system
Keywords
asynchronous circuits; asynchronous sequential logic; multiprocessing systems; protocols; sequential circuits; N-user B-server case; arbiter design; lookahead arbiter; lookahead technique; multiprocessor system; non-favorite priority; two step arbitration; Buildings; Flip-flops; Integrated circuit interconnections; Iterative methods; Modems; Multiprocessing systems; Multiprocessor interconnection networks; Protocols; Registers; Strontium;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1993., Proceedings of the 36th Midwest Symposium on
Conference_Location
Detroit, MI
Print_ISBN
0-7803-1760-2
Type
conf
DOI
10.1109/MWSCAS.1993.342968
Filename
342968
Link To Document