Principles of distributed systems

Mehr zum Buch

This collection explores various advanced topics in computer systems and distributed algorithms. It begins with discussions on lazy and speculative execution, and the quest for the most efficient failure detector for wait-free set agreement. The text delves into topological approaches to early-deciding set-agreement and presents an optimal algorithm for renaming using k-set-consensus. It examines the intersection of consensus and self-stabilization, alongside the costs associated with uniform protocols that adapt memory consumption based on interval contention. Further, the work addresses optimistic algorithms for partial database replication and revisits optimal clock synchronization, establishing upper and lower bounds in real-time systems. It highlights distributed priority inheritance for real-time and embedded systems and safe termination detection in asynchronous distributed environments, even when processes may crash and recover. The text also discusses lock-free dynamically resizable arrays and the construction of distributed spanners in doubling metric spaces. It compares mobile agent algorithms with message-passing algorithms and investigates incremental construction of k-dominating sets in wireless sensor networks. The efficiency of malicious interference in wireless networks is scrutinized, alongside self-stabilizing and self-organizing distributed algorithms. Additional topics include lightweight querying ser