OPODIS
2008
13 years 6 months ago
2008
Most peer-to-peer (P2P) networks proposed until now have either logarithmic degree and logarithmic dilation or constant degree and logarithmic dilation. In the latter case (which i...
OPODIS
2008
13 years 6 months ago
2008
sters : an abstraction for spatial-based distributed computing Matthieu Roy1 , Fran
OPODIS
2008
13 years 6 months ago
2008
We focus on automated revision techniques for adding Unity properties to distributed programs. We show that unlike centralized programs, where multiple safety properties along with...
OPODIS
2008
13 years 6 months ago
2008
OPODIS
2008
13 years 6 months ago
2008
We consider asynchronous deterministic broadcasting in radio networks. An execution of a broadcasting protocol is a series of events, each of which consists of simultaneous transm...
OPODIS
2008
13 years 6 months ago
2008
Abstract Nowadays, most of the energy-aware real-time scheduling algorithms belong to the DVFS (Dynamic Voltage and Frequency Scaling) framework. These DVFS algorithms are usually ...
OPODIS
2008
13 years 6 months ago
2008
This paper presents an asynchronous implementation of a failure detector for unknown and mobile networks. Our approach does not rely on timers. Neither the composition nor the numb...
OPODIS
2008
13 years 6 months ago
2008
Abstract. Consensus is a fundamental building block used to solve many practical problems that appear on reliable distributed systems. In spite of the fact that consensus is being ...
OPODIS
2008
13 years 6 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
OPODIS
2008
13 years 6 months ago
2008
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...