LEADER 03631nam 22006495 450 001 9910299573003321 005 20200629161919.0 010 $a981-10-5559-9 024 7 $a10.1007/978-981-10-5559-1 035 $a(CKB)3710000001631036 035 $a(MiAaPQ)EBC4939361 035 $a(DE-He213)978-981-10-5559-1 035 $a(PPN)20385232X 035 $a(EXLCZ)993710000001631036 100 $a20170804d2018 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aConcurrency Control in Distributed System Using Mutual Exclusion /$fby Sukhendu Kanrar, Nabendu Chaki, Samiran Chattopadhyay 205 $a1st ed. 2018. 210 1$aSingapore :$cSpringer Singapore :$cImprint: Springer,$d2018. 215 $a1 online resource (95 pages) 225 1 $aStudies in Systems, Decision and Control,$x2198-4182 ;$v116 311 $a981-10-5558-0 320 $aIncludes bibliographical references at the end of each chapters. 327 $aPreface -- 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. . 330 $aThe 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. 410 0$aStudies in Systems, Decision and Control,$x2198-4182 ;$v116 606 $aElectrical engineering 606 $aAlgorithms 606 $aAutomatic control 606 $aComputer networks 606 $aCommunications Engineering, Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/T24035 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aControl and Systems Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/T19010 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 615 0$aElectrical engineering. 615 0$aAlgorithms. 615 0$aAutomatic control. 615 0$aComputer networks. 615 14$aCommunications Engineering, Networks. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aControl and Systems Theory. 615 24$aComputer Communication Networks. 676 $a005.44 700 $aKanrar$b Sukhendu$4aut$4http://id.loc.gov/vocabulary/relators/aut$01062278 702 $aChaki$b Nabendu$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aChattopadhyay$b Samiran$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910299573003321 996 $aConcurrency Control in Distributed System Using Mutual Exclusion$92524125 997 $aUNINA