Please use this identifier to cite or link to this item:
Title: A generalized mutual exclusion problem and its algorithm
Authors: Luo, A
Wu, W
Cao, J 
Raynal, M
Keywords: Coterie
Distributed algorithm
Mutual exclusion
Resource allocation
Issue Date: 2013
Publisher: Institute of Electrical and Electronics Engineers Inc.
Source: Proceedings of the International Conference on Parallel Processing, 2013, 6687363, p. 300-309 How to cite?
Abstract: Mutual exclusion (ME) is a fundamental problem for resource allocation in distributed systems, It is concerned with how the various processes access shared resources in a mutually exclusive way. Besides the classic ME problem, several variant problems have been proposed and studied. In this paper, drawing inspiration from the scenario of controlling autonomous vehicles at intersections, we have defined a new ME problem, called Local Group Mutual Exclusion (LGME), w here mutual exclusion is necessary only among the processes requesting overlap but not the same set of resources. In comparison with other variant problems of ME, LGME is more general but also more challenging. To solve the LGME problem, we propose a novel notion called strong coterie, which can handle the complex process relationship in LGME. Based on strong coterie, we have designed an ME algorithm, which can handle concurrent CS execution and message asynchrony. The correctness of our algorithm is rigorously proved.
Description: 42nd Annual International Conference on Parallel Processing, ICPP 2013, Lyon, 1-4 October 2013
ISBN: 9780769551173
ISSN: 0190-3918
DOI: 10.1109/ICPP.2013.39
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Feb 20, 2019

Page view(s)

Last Week
Last month
Citations as of Feb 18, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.