Concurrency Control in Distributed System Using Mutual Exclusion

By: Sukhendu Kanrar, Nabendu Chaki, Samiran Chattopadhyay

Write A Review

Hardcover | 11 August 2017

At a Glance

Hardcover
108 Pages

Dimensions(cm)
23.39 x 15.6 x 0.79

Hardcover

$187.31

or 4 interest-free payments of $46.83 with

Aims to ship in 7 to 10 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.