OPODIS
2010
13 years 10 months ago
2010
Failure detectors are commonly viewed as abstractions for the synchronism present in distributed system models. However, investigations into the exact amount of synchronism encapsu...
OPODIS
2010
13 years 10 months ago
2010
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
OPODIS
2010
13 years 10 months ago
2010
OPODIS
2010
13 years 10 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
OPODIS
2010
13 years 10 months ago
2010
OPODIS
2010
13 years 10 months ago
2010
Distributed Hash Tables (DHTs) enable fully distributed Peer-to-Peer network construction and maintenance with name-driven routing. There exist very few DHT approaches that conside...
OPODIS
2010
13 years 10 months ago
2010
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
OPODIS
2010
13 years 10 months ago
2010
OPODIS
2010
13 years 10 months ago
2010
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...
OPODIS
2010
13 years 10 months ago
2010
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...