國立高雄大學圖資館 |

Language: English

Back

Concurrency control in distributed s...

Chaki, Nabendu.

Concurrency control in distributed system using mutual exclusion

Record Type:	Electronic resources : Monograph/item
Title/Author:	Concurrency control in distributed system using mutual exclusionby Sukhendu Kanrar, Nabendu Chaki, Samiran Chattopadhyay.
Author:	Kanrar, Sukhendu.
other author:	Chaki, Nabendu.
Published:	Singapore :Springer Singapore :2018.
Description:	x, 95 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Distributed operating systems (Computers)
Online resource:	http://dx.doi.org/10.1007/978-981-10-5559-1
ISBN:	9789811055591$q(electronic bk.)

Concurrency control in distributed system using mutual exclusion
Kanrar, Sukhendu.

Concurrency control in distributed system using mutual exclusion[electronic resource] /by Sukhendu Kanrar, Nabendu Chaki, Samiran Chattopadhyay. - Singapore :Springer Singapore :2018. - x, 95 p. :ill., digital ;24 cm. - Studies in systems, decision and control,v.1162198-4182 ;. - Studies in systems, decision and control ;v.3..

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.

ISBN: 9789811055591$q(electronic bk.)

Standard No.: 10.1007/978-981-10-5559-1doiSubjects--Topical Terms:

208309
Distributed operating systems (Computers)

LC Class. No.: QA76.76.O63

Dewey Class. No.: 620

Concurrency control in distributed system using mutual exclusion
LDR:02068nmm a2200325 a 4500 001 527931
003 DE-He213
005 20170804083910.0
006 m d
007 cr nn 008maaau
008 181022s2018 si s 0 eng d
020 $a 9789811055591$q(electronic bk.)
020 $a 9789811055584$q(paper)
024 7 $a 10.1007/978-981-10-5559-1 $2 doi
035 $a 978-981-10-5559-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.76.O63
072 7 $a TJK $2 bicssc
072 7 $a TEC041000 $2 bisacsh
082 0 4 $a 620 $2 23
090 $a QA76.76.O63 $b K16 2018
100 1 $a Kanrar, Sukhendu. $3 799987
245 1 0 $a Concurrency control in distributed system using mutual exclusion $h [electronic resource] / $c by Sukhendu Kanrar, Nabendu Chaki, Samiran Chattopadhyay.
260 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2018.
300 $a x, 95 p. : $b ill., digital ; $c 24 cm.
490 1 $a Studies in systems, decision and control, $x 2198-4182 ; $v v.116
505 0 $a 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.
520 $a 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.
650 0 $a Distributed operating systems (Computers) $3 208309
650 0 $a Computer multitasking. $3 679230
650 1 4 $a Engineering. $3 210888
650 2 4 $a Communications Engineering, Networks. $3 273745
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Control. $3 349080
650 2 4 $a Computer Communication Networks. $3 218087
700 1 $a Chaki, Nabendu. $3 470402
700 1 $a Chattopadhyay, Samiran. $3 799988
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Studies in systems, decision and control ; $v v.3. $3 678532
856 4 0 $u http://dx.doi.org/10.1007/978-981-10-5559-1
950 $a Engineering (Springer-11647)