國立虎尾科技大學 |

Concurrency Control in Distributed System Using Mutual Exclusion

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Concurrency Control in Distributed System Using Mutual Exclusion/ by Sukhendu Kanrar, Nabendu Chaki, Samiran Chattopadhyay.
作者:	Kanrar, Sukhendu.
其他作者:	Chaki, Nabendu.
面頁冊數:	X, 95 p. 43 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Electrical engineering. -
電子資源:	https://doi.org/10.1007/978-981-10-5559-1
ISBN:	9789811055591

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. - 1st ed. 2018. - X, 95 p. 43 illus.online resource. - Studies in Systems, Decision and Control,1162198-4182 ;. - Studies in Systems, Decision and Control,27.

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

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

596380
Electrical engineering.

LC Class. No.: TK1-9971

Dewey Class. No.: 621.382

Concurrency Control in Distributed System Using Mutual Exclusion
LDR:02439nam a22004095i 4500 001 999146
003 DE-He213
005 20200629161919.0
007 cr nn 008mamaa
008 201225s2018 si | s |||| 0|eng d
020 $a 9789811055591 $9 978-981-10-5559-1
024 7 $a 10.1007/978-981-10-5559-1 $2 doi
035 $a 978-981-10-5559-1
050 4 $a TK1-9971
072 7 $a TJK $2 bicssc
072 7 $a TEC041000 $2 bisacsh
072 7 $a TJK $2 thema
082 0 4 $a 621.382 $2 23
100 1 $a Kanrar, Sukhendu. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1290723
245 1 0 $a Concurrency Control in Distributed System Using Mutual Exclusion $h [electronic resource] / $c by Sukhendu Kanrar, Nabendu Chaki, Samiran Chattopadhyay.
250 $a 1st ed. 2018.
264 1 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2018.
300 $a X, 95 p. 43 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Studies in Systems, Decision and Control, $x 2198-4182 ; $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 Electrical engineering. $3 596380
650 0 $a Algorithms. $3 527865
650 0 $a Control engineering. $3 1249728
650 0 $a Computer communication systems. $3 1115394
650 1 4 $a Communications Engineering, Networks. $3 669809
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Control and Systems Theory. $3 1211358
650 2 4 $a Computer Communication Networks. $3 669310
700 1 $a Chaki, Nabendu. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 815159
700 1 $a Chattopadhyay, Samiran. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1290724
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9789811055584
776 0 8 $i Printed edition: $z 9789811055607
776 0 8 $i Printed edition: $z 9789811354267
830 0 $a Studies in Systems, Decision and Control, $x 2198-4182 ; $v 27 $3 1254124
856 4 0 $u https://doi.org/10.1007/978-981-10-5559-1
912 $a ZDB-2-ENG
912 $a ZDB-2-SXE
950 $a Engineering (SpringerNature-11647)
950 $a Engineering (R0) (SpringerNature-43712)