Concurrency Control in Distributed System Using Mutual Exclusion

• Κύριοι συγγραφείς: Kanrar, Sukhendu (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut), Chaki, Nabendu (http://id.loc.gov/vocabulary/relators/aut), Chattopadhyay, Samiran (http://id.loc.gov/vocabulary/relators/aut)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Singapore : Springer Singapore : Imprint: Springer, 2018.
• Έκδοση: 1st ed. 2018.
• Σειρά: Studies in Systems, Decision and Control, 116
• Θέματα: Electrical engineering.; Algorithms.; Control engineering.; Computer communication systems.; Communications Engineering, Networks.; Algorithm Analysis and Problem Complexity.; Control and Systems Theory.; Computer Communication Networks.

 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. 

 Preface -- Introduction -- State of the Art Review -- Tree Based Mutual Exclusion.-A Graph-based Mutual Exclusion Algorithms using Tokens -- Voting-based Mutual Exclusion Algorithms -- Conclusions -- References. .