NDLI: A Generalized Mutual Exclusion Problem and Its Algorithm

Content Provider	IEEE Xplore Digital Library
Author	Aoxue Luo Weigang Wu Jiannong Cao Raynal, M.
Copyright Year	2013
Description	Author affiliation: Dept. of Comput. Sci., Sun Yat-sen Univ., Guangzhou, China (Aoxue Luo; Weigang Wu) \|\| IRISA, Rennes, France (Raynal, M.) \|\| Dept. of Comput., Hong Kong Polytech. Univ., Kowloon, China (Jiannong Cao)
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.
Starting Page	300
Ending Page	309
File Size	546764
Page Count	10
File Format	PDF
ISBN	9780769551173
ISSN	01903918
DOI	10.1109/ICPP.2013.39
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-10-01
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Concurrent computing Vehicles Algorithm design and analysis Resource management Ad hoc networks Educational institutions Mobile robots distributed algorithm Mutual exclusion quorum coterie resource allocation
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A quorum based (m,h, k)-resource allocation algorithm.

Maximizing resource sharing by minimizing response time in ad-hoc network

Quorum-based mutual exclusion algorithm for mobile ad-hoc network (MANET)

A scalable mutual exclusion algorithm for mobile ad hoc networks

A novel permission-based reliable distributed mutual exclusion algorithm for MANETs

Arbitration based distributed group mutual exclusion algorithm for mobile ad hoc networks

Cluster-based K mutual exclusion for mobile ad hoc networks

A Token-Based Solution to Group Local Mutual Exclusion Problem In Mobile Ad Hoc Networks

1 prioritized h-out of-k resource allocation for mobile ad hoc networks and distributed systems.

A Generalized Mutual Exclusion Problem and Its Algorithm

Similar Documents

A quorum based (m,h, k)-resource allocation algorithm.

Maximizing resource sharing by minimizing response time in ad-hoc network

Quorum-based mutual exclusion algorithm for mobile ad-hoc network (MANET)

A scalable mutual exclusion algorithm for mobile ad hoc networks

A novel permission-based reliable distributed mutual exclusion algorithm for MANETs

Arbitration based distributed group mutual exclusion algorithm for mobile ad hoc networks

Cluster-based K mutual exclusion for mobile ad hoc networks

A Token-Based Solution to Group Local Mutual Exclusion Problem In Mobile Ad Hoc Networks

1 prioritized h-out of-k resource allocation for mobile ad hoc networks and distributed systems.

A Generalized Mutual Exclusion Problem and Its Algorithm