01110nam0 22002773i 450 VAN010097020220401121534.48907-8034-713-720150218d2000 |0itac50 baengUS|||| |||||Understanding power quality problemsvoltage sags and interruptionsMath H. J. BollenNew YorkIEEE2000XVII, 543 p.26 cm001VAN01008672001 IEEE press series on power engineering210 New YorkIEEE press.VAN0244200Understanding power quality problems1411048USNew YorkVANL000011BollenMath H. J.VANV078928555027IEEEVANV111634650ITSOL20230616RICABIBLIOTECA DEL DIPARTIMENTO DI INGEGNERIAIT-CE0100VAN05VAN0100970BIBLIOTECA DEL DIPARTIMENTO DI INGEGNERIA05PREST K 015 05BC 305 20150218 Understanding power quality problems1411048UNICAMPANIA03631nam 22006495 450 991029957300332120200629161919.0981-10-5559-910.1007/978-981-10-5559-1(CKB)3710000001631036(MiAaPQ)EBC4939361(DE-He213)978-981-10-5559-1(PPN)20385232X(EXLCZ)99371000000163103620170804d2018 u| 0engurcnu||||||||rdacontentrdamediardacarrierConcurrency Control in Distributed System Using Mutual Exclusion /by Sukhendu Kanrar, Nabendu Chaki, Samiran Chattopadhyay1st ed. 2018.Singapore :Springer Singapore :Imprint: Springer,2018.1 online resource (95 pages)Studies in Systems, Decision and Control,2198-4182 ;116981-10-5558-0 Includes bibliographical references at the end of each chapters.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.Studies in Systems, Decision and Control,2198-4182 ;116Electrical engineeringAlgorithmsAutomatic controlComputer networksCommunications Engineering, Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/T24035Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Control and Systems Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/T19010Computer Communication Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/I13022Electrical engineering.Algorithms.Automatic control.Computer networks.Communications Engineering, Networks.Algorithm Analysis and Problem Complexity.Control and Systems Theory.Computer Communication Networks.005.44Kanrar Sukhenduauthttp://id.loc.gov/vocabulary/relators/aut1062278Chaki Nabenduauthttp://id.loc.gov/vocabulary/relators/autChattopadhyay Samiranauthttp://id.loc.gov/vocabulary/relators/autMiAaPQMiAaPQMiAaPQBOOK9910299573003321Concurrency Control in Distributed System Using Mutual Exclusion2524125UNINA