Toggle Main Menu Toggle Search

Open Access padlockePrints

Flat Arbiters

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

Downloads


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: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 9th International Conference on Application of Concurrency to System Design (ACSD)

Year of Conference: 2009

Pages: 99-108

Date deposited: 31/03/2010

ISSN: 1550-4808

Publisher: IEEE Computer Society

URL: http://dx.doi.org/10.1109/ACSD.2009.7

DOI: 10.1109/ACSD.2009.7

Library holdings: Search Newcastle University Library for this item

ISBN: 9780769536972


Actions

Find at Newcastle University icon    Link to this publication


Share