DocumentCode :
1954730
Title :
Flat Arbiters
Author :
Mokhov, Andrey ; Khomenko, Victor ; Yakovlev, Alex
Author_Institution :
Sch. of Electr., Electron. & Comput. Eng., Newcastle Univ., Newcastle upon Tyne, UK
fYear :
2009
fDate :
1-3 July 2009
Firstpage :
99
Lastpage :
108
Abstract :
A new way of constructing N-way arbiters is proposed. The main idea is to perform arbitrations between all pairs of requests, and then make decision on what grant to issue based on their outcomes. Crucially, all the mutual exclusion elements in such an arbiter work in parallel.This `flat´ arbitration is prone to new threats such as formation of cycles (leading to deadlocks), but at the same time opens up new opportunities for designing arbitration structures with different decision policies due to the availability of the global order relation between requests. To facilitate resolution of such cycles and further developments in the context of flat arbitration, the paper presents new theoretical results, including a proof of correctness of a generic structure for the N-way arbiter decision logic. In particular, in some situations a request that lost some pairwise arbitrations has to be granted to avoid a deadlock.
Keywords :
asynchronous circuits; N-way arbiter decision logic; arbitration structures; flat arbiters; flat arbitration; mutual exclusion elements; Application software; Asynchronous circuits; Circuit synthesis; Concurrent computing; Delay; Design engineering; Logic gates; Protocols; System recovery; Wire; Arbiters; Asynchronous circuits; Signal Transition Graph (STG).; Speed-independent circuits;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Application of Concurrency to System Design, 2009. ACSD '09. Ninth International Conference on
Conference_Location :
Augsburg
ISSN :
1550-4808
Print_ISBN :
978-0-7695-3697-2
Type :
conf
DOI :
10.1109/ACSD.2009.7
Filename :
5291058
Link To Document :
بازگشت