Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Concurrency Control in Distributed System Using Mutual Exclusion

Name: Concurrency Control in Distributed System Using Mutual Exclusion
Brand: Springer Verlag, Singapore
SKU: 21081053
Price: 39520 HUF
Availability: InStock
Author: Sukhendu Kanrar
ISBN: 9789811354267

Sukhendu Kanrar

Nabendu Chaki

Samiran Chattopadhyay

Language

English

Book Paperback

Libristo code: 21081053

Publishers Springer Verlag, Singapore, January 2019

The book presents various state-of-the-art approaches for process synchronization in a distributed e... Full description

Libristo code: 21081053

271 b

39 520 Ft

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Nowe kino Korei Poludniowej i krytyka spoleczna Petour Nicolas Petour

Paperback

18 915 Ft

Tout pour le Bac • toutes matières • Première S Clément

Paperback

7 502 Ft

L'été - Je trace, j'efface Kirsteen Robson

Paperback

3 226 Ft

Familias De Animales ACTIVITY CRUSADES

Paperback

5 283 Ft

I Un jardin sur l' Oronte - II Colette Baudoche M Maurice Barres

Paperback

6 857 Ft

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.