Kanrar sukhendu (21 risultati)

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New. pp. 105.

Paperback. Condizione: Brand New. reprint edition. 108 pages. 9.25x6.10x0.25 inches. In Stock.

Hardcover. Condizione: Brand New. 95 pages. 9.25x6.25x0.50 inches. In Stock.

Taschenbuch. Condizione: Neu. Concurrency Control in Distributed System Using Mutual Exclusion | Sukhendu Kanrar (u. a.) | Taschenbuch | x | Englisch | 2019 | Springer | EAN 9789811354267 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Paperback. Condizione: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: new. Questo è un articolo print on demand.

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 108 pp. Englisch.…

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 95 pp. Englisch.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents four state-of-the-art algorithms using tokens and two voting-based algorithms in distributed systemDefines the important terms&nbspof control algorithm in distributed system&nbsplike liveness, safety, correctness, priority-based fairnes.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents four state-of-the-art algorithms using tokens and two voting-based algorithms in distributed systemDefines the important terms&nbspof control algorithm in distributed system&nbsplike liveness, safety, correctness, priority-based fairnes.…

Condizione: New. Print on Demand pp. 105.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 108 pp. Englisch.…

Condizione: New. PRINT ON DEMAND pp. 105.