Normal view MARC view ISBD view

Concurrency Control in Distributed System Using Mutual Exclusion.

By: Kanrar, Sukhendu.
Contributor(s): Chaki, Nabendu | Chattopadhyay, Samiran.
Material type: TextTextSeries: eBooks on Demand.Studies in Systems, Decision and Control: Publisher: Singapore : Springer Singapore, 2017Copyright date: ©2018Description: 1 online resource (104 pages).Content type: text Media type: computer Carrier type: online resourceISBN: 9789811055591.Subject(s): Distributed operating systems (Computers)Genre/Form: Electronic books.Additional physical formats: Print version:: Concurrency Control in Distributed System Using Mutual ExclusionDDC classification: 620 Online resources: Click here to view this ebook.
Contents:
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-P -- 3.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-P -- 4.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 Book -- 6.2 Impact of New Algorithms on Future Research for Process Synchronization in Distributed Systems -- References.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number URL Status Date due Barcode
Electronic Book UT Tyler Online
Online
TA1-2040 (Browse shelf) http://ebookcentral.proquest.com/lib/uttyler/detail.action?docID=4939361 Available EBC4939361

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-P -- 3.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-P -- 4.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 Book -- 6.2 Impact of New Algorithms on Future Research for Process Synchronization in Distributed Systems -- References.

Description based on publisher supplied metadata and other sources.

There are no comments for this item.

Log in to your account to post a comment.