Asynchronous group mutual exclusion in ring networks
Resource
IEE Proceedings—Computers and Digital Techniques 147 (1): 1-8
Journal
IEE Proceedings—Computers and Digital Techniques
Journal Volume
147
Journal Issue
1
Pages
1-8
Date Issued
2000
Date
2000
Author(s)
Wu, Kuen-Ping
Abstract
In group mutual exclusion solutions for shared-memory models and complete message-passing networks have been proposed. These solutions, however, cannot be straightforwardly and efficiently converted to ring networks where each process can only communicate directly with its two neighbouring processes. As rings are also a popular network topology, the paper is focused on ring networks. An efficient and highly concurrent distributed algorithm for the problem is presented.
Other Subjects
Algorithms; Computer simulation; Concurrency control; Distributed computer systems; Mathematical models; Problem solving; Asynchronous group mutual exclusion; Ring networks; Shared memory models; Computer networks
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
7.pdf
Size
168.58 KB
Format
Adobe PDF
Checksum
(MD5):533129d8ccbaa7baa8bc31aa7ecdbaa2