Toggle Main Menu Toggle Search

Open Access padlockePrints

Ordered arbiters

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

Downloads

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


Abstract

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.


Publication metadata

Author(s): Bystrov A, Yakovlev A

Publication type: Article

Publication status: Published

Journal: Electronics Letters

Year: 1999

Volume: 35

Issue: 11

Pages: 877-879

Print publication date: 27/05/1999

ISSN (print): 0013-5194

ISSN (electronic):

Publisher: The Institution of Engineering and Technology

URL: http://dx.doi.org/10.1049/el:19990617

DOI: 10.1049/el:19990617


Altmetrics

Altmetrics provided by Altmetric


Share