| | |
Summary: Adapting to Point Contention
with Long-Lived Safe Agreement
(Extended Abstract)
Hagit Attiya
Department of Computer Science
Technion
hagit@cs.technion.ac.il
Abstract. Algorithms with step complexity that depends only on the
point contention--the number of simultaneously active processes--are
very attractive for distributed systems with varying degree of concur-
rency. Designing shared-memory algorithms that adapt to point con-
tention, using only read and write operations, is however, a challenging
task.
The paper specifies the long-lived safe agreement object, extending an
object of Borowsky et al. [1], and describes an implementation whose step
complexity is adaptive to point contention. Then, we illustrate how this
object is used to solve other problems, like renaming and information
collection, in an adaptive manner.
1 Introduction
In order to coordinate the actions of a distributed application, processes must
|
