Concurrency Control in Distributed System Using Mutual Exclusion.
Kanrar, Sukhendu.; Chaki, Nabendu.; Chattopadhyay, Samiran.
2017
QA76.76.O63
Available Online

Linked e-resources

Linked Resource Online Access
Concurrent users Unlimited
Authorized users Authorized users
Document Delivery Supplied Can lend chapters, not whole ebooks

Details

Title Concurrency Control in Distributed System Using Mutual Exclusion.
Author Kanrar, Sukhendu.
ISBN 9789811055591
9811055599
9789811055584
9811055580
DOI https://doi.org/10.1007/978-981-10-5559-1
Publication Details Singapore : Springer Singapore, 2017.
Language English
Description 1 online resource (104 pages).
Item Number 10.1007/978-981-10-5559-1 doi
Call Number QA76.76.O63
Dewey Decimal Classification 620
Summary 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.
Bibliography, etc. Note Includes bibliographical references.
Access Note Access limited to authorized users.
Digital File Characteristics text file PDF
Source of Description Description based on print version record.
Added Author Chaki, Nabendu.
Chattopadhyay, Samiran.
Series Studies in systems, decision and control.
Available in Other Form Concurrency Control in Distributed System Using Mutual Exclusion.
Linked Resources Online Access
Record Appears in Online Resources > Ebooks
All Resources
Preface; Contents; About the Authors; 1 Introduction; 1.1 Organization of Book; References; 2 State-of-the-Art Review; 2.1 Definitions of Terminologies; 2.2 Token-Based ME Algorithms; 2.3 Hierarchical Topology Based ME Algorithms; 2.4 Graph Topology Based ME Algorithms; 2.5 Permission-Based ME Algorithms; 2.6 Voting-Based ME Algorithms; 2.7 Conclusions; References; 3 Tree-Based Mutual Exclusions; 3.1 Modified Raymond's Algorithm (MRA); 3.1.1 Data Structure and Algorithm for MRA Algorithm; 3.1.2 Limitation of Algorithm MRA; 3.2 Modified Raymond's Algorithm for Priority (MRA-P).

3.2.1 Data Structure and Algorithm for MRA-P3.2.2 Performance Analysis for MRA and MRA-P; 3.3 Fairness Algorithm for Priority Processes (FAPP); 3.3.1 Data Structure and Algorithm for FAPP; 3.3.2 Performance Analysis for FAPP; 3.4 Concluding Remarks on Tree-Based ME Algorithms; References; 4 A Graph-Based Mutual Exclusion Algorithm Using Tokens; 4.1 Link Failure Resilient Token-Based ME Algorithm for Directed Graph (LFRT); 4.1.1 Data Structure and Algorithm for LFRT; 4.1.2 Limitations of LFRT; 4.2 Link Failure Resilient Priority Based Fair ME Algorithm for Distributed Systems (LFRT-P).

4.2.1 Data Structure and Algorithm for LFRT-P4.2.2 Performance Analysis for LFRT and LFRT-P; 4.3 Concluding Remarks on Graph-Based ME Algorithms; References; 5 Voting-Based Mutual Exclusion Algorithms; 5.1 Below-Majority Voting for ME in Distributed Systems (BMaV); 5.1.1 Description for BMaV; 5.1.2 Comments on the BMaV Algorithm; 5.2 A New Hybrid Mutual Exclusion Algorithm in Absence of Majority Consensus (NHME-AMC); 5.2.1 A Description for NHME-AMC; 5.3 Performance Analysis for BMaV and NHME-AMC; 5.4 Concluding Remarks on Voting-Based ME Algorithms; References; 6 Conclusions.

6.1 Summary of the Works Described in the Book6.2 Impact of New Algorithms on Future Research for Process Synchronization in Distributed Systems; References.

Browse Subjects

Show more subjects...

Statistics

from
to
Export