Concurrency Control in Distributed System Using Mutual Exclusion
Nonfiction, Science & Nature, Technology, Telecommunications, Computers, Programming
| Author: | Sukhendu Kanrar, Nabendu Chaki, Samiran Chattopadhyay | ISBN: | 9789811055591 |
| Publisher: | Springer Singapore | Publication: | August 4, 2017 |
| Imprint: | Springer | Language: | English |
| Author: | Sukhendu Kanrar, Nabendu Chaki, Samiran Chattopadhyay |
| ISBN: | 9789811055591 |
| Publisher: | Springer Singapore |
| Publication: | August 4, 2017 |
| Imprint: | Springer |
| Language: | English |
The book presents various state-of-the-art approaches for process synchronization in a distributed environment. The range of algorithms discussed in the book starts from token based mutual exclusion algorithms that work on tree based topology. Then there are interesting solutions for more flexible logical topology like a directed graph, with or without cycle. In a completely different approach, one of the chapters presents two recent voting-based DME algorithms. All DME algorithms presented in the book aim to ensure fairness in terms of first come first serve (FCFS) order among equal priority processes. At the same time, the solutions consider the priority of the requesting processes and allocate resource for the earliest request when no such request from a higher priority process is pending.
The book presents various state-of-the-art approaches for process synchronization in a distributed environment. The range of algorithms discussed in the book starts from token based mutual exclusion algorithms that work on tree based topology. Then there are interesting solutions for more flexible logical topology like a directed graph, with or without cycle. In a completely different approach, one of the chapters presents two recent voting-based DME algorithms. All DME algorithms presented in the book aim to ensure fairness in terms of first come first serve (FCFS) order among equal priority processes. At the same time, the solutions consider the priority of the requesting processes and allocate resource for the earliest request when no such request from a higher priority process is pending.
