Sciweavers

Share
OPODIS
2003
9 years 8 months ago
Detecting Locally Stable Predicates Without Modifying Application Messages
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...
Ranganath Atreya, Neeraj Mittal, Vijay K. Garg
OPODIS
2003
9 years 8 months ago
Transformations for Write-All-with-Collision Model
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 ...
Sandeep S. Kulkarni, Umamaheswaran Arumugam
OPODIS
2003
9 years 8 months ago
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
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...
Dariusz R. Kowalski, Mariam Momenzadeh, Alexander ...
OPODIS
2001
9 years 8 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
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...
Lélia Blin, Franck Butelle
OPODIS
2001
9 years 8 months ago
Mobile agents: a suitable support for service provision in mobile computing environments
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 ...
Ouahiba Fouial, Nadia Boukhatem, Isabelle M. Demeu...
OPODIS
2004
9 years 8 months ago
Secure Location Verification Using Radio Broadcast
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...
Adnan Vora, Mikhail Nesterenko
OPODIS
2004
9 years 8 months ago
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap
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 ...
Håkan Sundell, Philippas Tsigas
OPODIS
2004
9 years 8 months ago
Embedded Systems - Challenges and Work Directions
Embedded Systems are components integrating software and hardware jointly and specifically designed to provide given functionalities. These components may be used in many different...
Joseph Sifakis
OPODIS
2004
9 years 8 months ago
A Constraint-Based Formalism for Consistency in Replicated Systems
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...
Marc Shapiro, Karthikeyan Bhargavan, Nishith Krish...
OPODIS
2004
9 years 8 months ago
A UNITY-Based Framework Towards Component Based Systems
I. S. W. B. Prasetya, Tanja E. J. Vos, A. Azurat, ...
books