Toggle Main Menu Toggle Search

Open Access padlockePrints

Priority arbiters

Lookup NU author(s): Dr Alex Bystrov, Professor David Kinniment, Professor Alex Yakovlev


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


The paper presents asynchronous design solutions to the problem of Priority Arbitration which is defined in the following form. A system consists of multiple, physically concurrent, processes with a shared resource. The discipline of resource allocation is a function of parameters of the active requests, which are assigned to the requests either statically or dynamically. This function can be defined in an (arbitrary) combinatorial way (contrary to conventional, 'topological', mappings, such as that used in a daisy-chain arbiter). The proposed designs are quasi-speed-independent. Furthermore, the priority logic, in the dynamic case, has the following architectural feature: it is a tree structure in which the control flow is maximally decoupled from the data-path by means of an early propagation of the 'valid' 'invalid' signals, concurrently with processing the priority data. This leads to significant reduction in the overall arbitration delay when the number of active requests is low. © 2000 IEEE.

Publication metadata

Author(s): Bystrov A, Kinniment D, Yakovlev A

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 6th International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC 2000)

Year of Conference: 2000

Pages: 128-137

Publisher: IEEE Computer Society


DOI: 10.1109/ASYNC.2000.836990

Library holdings: Search Newcastle University Library for this item

ISBN: 0769505864