Distributed Algorithms

Towards fault-tolerant and secure agentry.- Workflow management — An exercise in distributed computing.- In memory of Anya Pogosyants.- Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study.- A simple DFS-Based algorithm for linear interval routing.- ATM layouts with bounded hop count and congestion.- Scheduling in synchronous networks and the greedy algorithm.- Rapid convergence of a local load balancing algorithm for asynchronous rings.- Performing tasks on restartable message-passing processors.- Revisiting the Paxos algorithm.- Heartbeat: A timeout-free failure detector for quiescent reliable communication.- Genuine atomic multicast.- Low-overhead time-triggered group membership.- Virtual precedence in asynchronous systems: Concept and applications.- Detecting global predicates in distributed systems with clocks.- Fault tolerance bounds for memory consistency.- Precedence-based memory models.- Strong interaction fairness in a fully distributed system with unbounded speed variability.- Reliable communication over partially authenticated networks.- Self-stabilizing depth-first token passing on rooted networks.- Secure distributed storage and retrieval.- Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system.- Transparent support for wait-free transactions.- On the power of multi-objects.