OPODIS
2003
13 years 6 months ago
2003
In this paper, we give an efficient algorithm to determine whether a locally stable predicate has become true in an underlying computation. Examples of locally stable predicates in...
OPODIS
2003
13 years 6 months ago
2003
Dependable properties such as self-stabilization are crucial requirements in sensor networks. One way to achieve these properties is to utilize the vast literature on distributed ...
OPODIS
2003
13 years 6 months ago
2003
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
OPODIS
2001
13 years 6 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
OPODIS
2001
13 years 6 months ago
2001
This paper aims to investigate the use of mobile agents for service provision in mobile computing environments. A quantitative model and experimental measurements are performed to ...
OPODIS
2004
13 years 6 months ago
2004
Secure location verification is a recently stated problem that has a number of practical applications. The problem requires a wireless sensor network to confirm that a potentially...
OPODIS
2004
13 years 6 months ago
2004
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
OPODIS
2004
13 years 6 months ago
2004
Embedded Systems are components integrating software and hardware jointly and specifically designed to provide given functionalities. These components may be used in many different...
OPODIS
2004
13 years 6 months ago
2004
Abstract. We present a formalism for modeling replication in a distributed system with concurrent users sharing information. It is based on actions, which represent operations requ...
OPODIS
2004
13 years 6 months ago
2004
