Central Library

Normal view MARC view ISBD view

Concurrency Control in Distributed System Using Mutual Exclusion [electronic resource] / by Sukhendu Kanrar, Nabendu Chaki, Samiran Chattopadhyay.

By: Kanrar, Sukhendu [author.].
Contributor(s): Chaki, Nabendu [author.] | Chattopadhyay, Samiran [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Studies in Systems, Decision and Control: 116Publisher: Singapore : Springer Nature Singapore : Imprint: Springer, 2018Edition: 1st ed. 2018.Description: X, 95 p. 43 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9789811055591.Subject(s): Telecommunication | Algorithms | Control engineering | Computer networks  | Communications Engineering, Networks | Algorithms | Control and Systems Theory | Computer Communication NetworksAdditional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification: 621.382 Online resources: Click here to access online
Contents:
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. .
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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. .

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.

There are no comments for this item.

Log in to your account to post a comment.