Asynchronous group mutual exclusion in ring networks
Resource
Computers and Digital Techniques, IEE Proceedings-
Journal
Computers and Digital Techniques, IEE Proceedings-
Pages
-
Date Issued
2000-01
Date
2000-01
Author(s)
Wu, K.P.
Joung, Y.J.
DOI
1350-2387
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.
SDGs
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00842723.pdf
Size
168.58 KB
Format
Adobe PDF
Checksum
(MD5):533129d8ccbaa7baa8bc31aa7ecdbaa2
