000823340 000__ 04774cam\a2200565Mu\4500
000823340 001__ 823340
000823340 005__ 20230306143919.0
000823340 006__ m\\\\\o\\d\\\\\\\\
000823340 007__ cr\cn\nnnunnun
000823340 008__ 170812s2017\\\\si\\\\\\ob\\\\000\0\eng\d
000823340 019__ $$a1000121577$$a1000318602$$a1005128595$$a1006452262
000823340 020__ $$a9789811055591
000823340 020__ $$a9811055599
000823340 020__ $$z9789811055584
000823340 020__ $$z9811055580
000823340 0247_ $$a10.1007/978-981-10-5559-1$$2doi
000823340 035__ $$aSP(OCoLC)on1000454059
000823340 035__ $$aSP(OCoLC)1000454059$$z(OCoLC)1000121577$$z(OCoLC)1000318602$$z(OCoLC)1005128595$$z(OCoLC)1006452262
000823340 040__ $$aEBLCP$$beng$$epn$$cEBLCP$$dOCLCO$$dYDX$$dGW5XE$$dN$T$$dOCLCF$$dOCLCQ$$dUAB$$dCOO$$dNJR$$dU3W$$dCAUOI
000823340 049__ $$aISEA
000823340 050_4 $$aQA76.76.O63
000823340 050_4 $$aTA1-2040
000823340 08204 $$a620$$223
000823340 1001_ $$aKanrar, Sukhendu.
000823340 24510 $$aConcurrency Control in Distributed System Using Mutual Exclusion.
000823340 260__ $$aSingapore :$$bSpringer Singapore,$$c2017.
000823340 300__ $$a1 online resource (104 pages).
000823340 336__ $$atext$$btxt$$2rdacontent
000823340 337__ $$acomputer$$bc$$2rdamedia
000823340 338__ $$aonline resource$$bcr$$2rdacarrier
000823340 347__ $$atext file$$bPDF$$2rda
000823340 4901_ $$aStudies in Systems, Decision and Control ;$$vv. 116
000823340 504__ $$aIncludes bibliographical references.
000823340 5050_ $$aPreface; Contents; About the Authors; 1 Introduction; 1.1 Organization of Book; References; 2 State-of-the-Art Review; 2.1 Definitions of Terminologies; 2.2 Token-Based ME Algorithms; 2.3 Hierarchical Topology Based ME Algorithms; 2.4 Graph Topology Based ME Algorithms; 2.5 Permission-Based ME Algorithms; 2.6 Voting-Based ME Algorithms; 2.7 Conclusions; References; 3 Tree-Based Mutual Exclusions; 3.1 Modified Raymond's Algorithm (MRA); 3.1.1 Data Structure and Algorithm for MRA Algorithm; 3.1.2 Limitation of Algorithm MRA; 3.2 Modified Raymond's Algorithm for Priority (MRA-P).
000823340 5058_ $$a3.2.1 Data Structure and Algorithm for MRA-P3.2.2 Performance Analysis for MRA and MRA-P; 3.3 Fairness Algorithm for Priority Processes (FAPP); 3.3.1 Data Structure and Algorithm for FAPP; 3.3.2 Performance Analysis for FAPP; 3.4 Concluding Remarks on Tree-Based ME Algorithms; References; 4 A Graph-Based Mutual Exclusion Algorithm Using Tokens; 4.1 Link Failure Resilient Token-Based ME Algorithm for Directed Graph (LFRT); 4.1.1 Data Structure and Algorithm for LFRT; 4.1.2 Limitations of LFRT; 4.2 Link Failure Resilient Priority Based Fair ME Algorithm for Distributed Systems (LFRT-P).
000823340 5058_ $$a4.2.1 Data Structure and Algorithm for LFRT-P4.2.2 Performance Analysis for LFRT and LFRT-P; 4.3 Concluding Remarks on Graph-Based ME Algorithms; References; 5 Voting-Based Mutual Exclusion Algorithms; 5.1 Below-Majority Voting for ME in Distributed Systems (BMaV); 5.1.1 Description for BMaV; 5.1.2 Comments on the BMaV Algorithm; 5.2 A New Hybrid Mutual Exclusion Algorithm in Absence of Majority Consensus (NHME-AMC); 5.2.1 A Description for NHME-AMC; 5.3 Performance Analysis for BMaV and NHME-AMC; 5.4 Concluding Remarks on Voting-Based ME Algorithms; References; 6 Conclusions.
000823340 5058_ $$a6.1 Summary of the Works Described in the Book6.2 Impact of New Algorithms on Future Research for Process Synchronization in Distributed Systems; References.
000823340 506__ $$aAccess limited to authorized users.
000823340 520__ $$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.
000823340 588__ $$aDescription based on print version record.
000823340 650_0 $$aDistributed operating systems (Computers)
000823340 650_0 $$aComputer multitasking.
000823340 7001_ $$aChaki, Nabendu.
000823340 7001_ $$aChattopadhyay, Samiran.
000823340 77608 $$iPrint version:$$aKanrar, Sukhendu.$$tConcurrency Control in Distributed System Using Mutual Exclusion.$$dSingapore : Springer Singapore, ©2017$$z9789811055584
000823340 830_0 $$aStudies in systems, decision and control.
000823340 852__ $$bebk
000823340 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-981-10-5559-1$$zOnline Access$$91397441.1
000823340 909CO $$ooai:library.usi.edu:823340$$pGLOBAL_SET
000823340 980__ $$aEBOOK
000823340 980__ $$aBIB
000823340 982__ $$aEbook
000823340 983__ $$aOnline
000823340 994__ $$a92$$bISE