ePrints

Flat Arbiters

Lookup NU author(s): Dr Andrey Mokhov, Dr Victor Khomenko, Professor Alex Yakovlev

Downloads

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

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.

Publication metadata

Author(s): Mokhov A, Khomenko V, Yakovlev A

Publication type: Article

Publication status: Published

Journal: Fundamenta Informaticae

Year: 2011

Volume: 108

Issue: 1-2

Pages: 63-90

ISSN (print): 0169-2968

ISSN (electronic): 1875-8681

Publisher: IOS Press

Notes: Special Issue on Best Papers from ACSD'09

Funding

Share