Recoverable Mutual Exclusion: Synthesis Lectures on Distributed Computing Theory
Autor Sahil Dhoked, Wojciech Golab, Neeraj Mittalen Limba Engleză Hardback – 18 apr 2023
Din seria Synthesis Lectures on Distributed Computing Theory
- 20% Preț: 355.13 lei
- 20% Preț: 228.61 lei
- 20% Preț: 226.64 lei
- 20% Preț: 362.65 lei
- 20% Preț: 382.39 lei
- 20% Preț: 386.68 lei
- 20% Preț: 384.03 lei
- 20% Preț: 223.34 lei
- 20% Preț: 334.71 lei
- 20% Preț: 225.48 lei
- 20% Preț: 299.81 lei
- 20% Preț: 272.33 lei
- 20% Preț: 228.80 lei
- 20% Preț: 225.99 lei
- 20% Preț: 227.12 lei
- 20% Preț: 272.00 lei
- 20% Preț: 271.34 lei
- 20% Preț: 383.37 lei
- Preț: 400.91 lei
Preț: 240.22 lei
Preț vechi: 300.28 lei
-20% Nou
Puncte Express: 360
Preț estimativ în valută:
45.97€ • 47.70$ • 38.42£
45.97€ • 47.70$ • 38.42£
Carte tipărită la comandă
Livrare economică 11-17 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031200014
ISBN-10: 3031200012
Pagini: 126
Ilustrații: XV, 126 p. 60 illus., 16 illus. in color.
Dimensiuni: 168 x 240 mm
Ediția:2023
Editura: Springer International Publishing
Colecția Springer
Seria Synthesis Lectures on Distributed Computing Theory
Locul publicării:Cham, Switzerland
ISBN-10: 3031200012
Pagini: 126
Ilustrații: XV, 126 p. 60 illus., 16 illus. in color.
Dimensiuni: 168 x 240 mm
Ediția:2023
Editura: Springer International Publishing
Colecția Springer
Seria Synthesis Lectures on Distributed Computing Theory
Locul publicării:Cham, Switzerland
Cuprins
Introduction.- Persistent Memory.- Prior Work.- Problem Formulation.- Load and Store based Algorithms.- Sublogarithmic Algorithms.- Adaptive Algorithms.- Constant Amortized Complexity Algorithm.- Abortable Recoverable Mutual Exclusion.- Tight Lower Bound.- System Wide Failures.-
Discussion and Open Problems.
Notă biografică
Sahil Dhoked, Ph.D., is a Research Scientist at Meta Platforms. He received his Ph.D. in computer science from the University of Texas at Dallas in 2022 under the supervision of Dr. Neeraj Mittal. He received his B.Tech. degree in computer science and engineering from the Indian Institute of Technology, Indore in 2013. He previously worked as a software development engineer at Microsoft.
Wojciech Golab, Ph.D., is an Associate Professor in the Department of Electrical and Computer Engineering at the University of Waterloo. He received his Ph.D. in computer science from the University of Toronto in 2010. In the same year, he completed a post-doctoral fellowship at the University of Calgary and later joined Hewlett-Packard Labs in Palo Alto as a Research Scientist. He is broadly interested in concurrency and fault tolerance in distributed systems, with a special focus on bridging the gap between theory and practice.
Neeraj Mittal, Ph.D., is a Pofessor in theDepartment of Computer Science at the University of Texas at Dallas and Co-director of the Advanced Networking and Dependable System Laboratory (ANDES). He received his B.Tech. degree in computer science and engineering from the Indian Institute of Technology, Delhi in 1995 and the M.S. and Ph.D. degrees in computer science from the University of Texas at Austin in 1997 and 2002, respectively. His research interests include multi-core computing, distributed computing, fault tolerant computing, and distributed algorithms for wireless networking.
Wojciech Golab, Ph.D., is an Associate Professor in the Department of Electrical and Computer Engineering at the University of Waterloo. He received his Ph.D. in computer science from the University of Toronto in 2010. In the same year, he completed a post-doctoral fellowship at the University of Calgary and later joined Hewlett-Packard Labs in Palo Alto as a Research Scientist. He is broadly interested in concurrency and fault tolerance in distributed systems, with a special focus on bridging the gap between theory and practice.
Neeraj Mittal, Ph.D., is a Pofessor in theDepartment of Computer Science at the University of Texas at Dallas and Co-director of the Advanced Networking and Dependable System Laboratory (ANDES). He received his B.Tech. degree in computer science and engineering from the Indian Institute of Technology, Delhi in 1995 and the M.S. and Ph.D. degrees in computer science from the University of Texas at Austin in 1997 and 2002, respectively. His research interests include multi-core computing, distributed computing, fault tolerant computing, and distributed algorithms for wireless networking.
Caracteristici
Describes the current research on solving the RME problem and conveys perspective on how the problem is evolving Explains algorithms that have been proposed so far for the solving the RME problem and its variants Categorizes the various solutions based on the unique properties of the variant of the problem they address