An algorithm is proposed that creates mutual exclusion in a computer network whose nodes communicate only by messages and do not share memory. The algorithm sends only 2*(A^ -1) messages, where N is the number of nodes in the network per critical section invocation. This number of messages is at a minimum if parallel, distributed, symmetric control is used; hence, the algorithm is optimal in this respect. The time needed to achieve mutual exclusion is also minimal under some general assumptions.As in Lamport's ^^bakery algorithm/* unbounded sequence numbers are used to provide first-come firstserved priority into the critical section. It is shown that the number can be contained in a fixed amount of memory by storing it as the residue of a modulus. The number of messages required to implement the exclusion can he reduced by using sequential node-by-node processing, by using broadcast message techniques, or by sending information through timing channels. The ^'readers and writers" problem is solved by a simple modification of the algorithm and the modifications necessary to make the algorithm rohust are described.
SICURITY.CLASSIVICATION OF THIS PAGE(Whw Doate Enrered)20. Abstract cont.• ,J kthat the number can be contained in a fixed amount of memory by storing it as the residue of a modulus. The number of messages required to implemetit the exclusion can be reduced by using sequential node-by-node processing, by using broadcast message techniques or by sending information through timing channels. The 4eaders and writers"'-problem is solved by a simple modification of the' algorithm.The modifications necessary to make the algorithm robust are described. UNCLASSIFIED WWI AbmtractAn algorithm is proposed which creates mutual exclusion in a computer network whose nodes can communicate only by messages and do not share memory.The algorithm sends only 20(N-1) messages, where N is the number of nodes in the network, per critical section invocation. This number of messages is a minimum if parallel, distributed, symmetric control is used; hence, the algorithm is optimal in this respect. The time needed to achieve mutual exclusion is also minimal under some general assumptions. Like Lamport's "bakery algorithm," unbounded sequence numbers are used to provide first-come first-served priority into the critical section. It is shown that the number can be contained in a fixed amount of memory by storing it as the residue of a modulus.The number of messages required to implement the exclusion can be reduced by using sequential node-by-node processing, by using broadcast message techniques, or by sending information through timing channels.The "readers and writers" problem is solved by a simple modification of the algorithm.The modifications necessary to make the algorithm robust are described. Acce5jCio : I,'-TIS (--
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.