Brief Announcement: How to Overcome the Limits of Bounds

Authors:
Olivier Peres
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105
Venue:
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Year:
2009

Citing 3
Cited 0

Introduction to distributed algorithms

Introduction to distributed algorithms
Self-stabilizing unidirectional network algorithms by power-supply

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Self-stabilization

Self-stabilization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A distributed system consists of processes linked to one another by communication links. A classical problem is how to realistically model these links so that it is possible to write correct algorithms. This paper presents a new solution that results in more natural executions and removes the need for artificial workarounds.