OPODIS
2003
14 years 3 months ago
2003
Abstract. We present and motivate the definition and use of the language and environment dSL, an imperative and event driven language designed to program distributed industrial co...
OPODIS
2003
14 years 3 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
OPODIS
2003
14 years 3 months ago
2003
Jackson networks have been very successful in so many areas in modeling parallel and distributed systems. However, the ability of Jackson networks to predict performance with syste...
OPODIS
2003
14 years 3 months ago
2003
One of the problems of middleware for shared state is that they are designed, explicitly or implicitly, for symmetric networks. However, since the Internet is not symmetric, end-to...
OPODIS
2003
14 years 3 months ago
2003
Awareness of the need for robustness in distributed systems increases as distributed systems become an integral part of day-to-day systems. Tolerating Byzantine faults and possessi...
OPODIS
2003
14 years 3 months ago
2003
In this paper we present a framework to formally describe and study the interconnection of distributed shared memory systems. In our models we minimize the dependencies between the...
OPODIS
2003
14 years 3 months ago
2003
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
OPODIS
2003
14 years 3 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
14 years 3 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
14 years 3 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...