Results 1 
4 of
4
A WorkOptimal Deterministic Algorithm for the Asynchronous Certified WriteAll Problem (Extended Abstract)
 22nd ACM Symposium on Principles of Distributed Computing PODC’03
, 2003
"... In their SIAM J. on Computing paper [27] from 1992, Martel et al. posed a question for developing a workoptimal deterministic asynchronous algorithm for the fundamental loadbalancing and synchronization problem called Certified WriteAll. In this problem, introduced in a slightly different form by ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In their SIAM J. on Computing paper [27] from 1992, Martel et al. posed a question for developing a workoptimal deterministic asynchronous algorithm for the fundamental loadbalancing and synchronization problem called Certified WriteAll. In this problem, introduced in a slightly different form by Kanellakis and Shvartsman in a PODC'89 paper [17], $p$ processors must update $n$ memory cells and then signal the completion of the updates. It is known that solutions to this problem can be used to simulate synchronous parallel programs on asynchronous systems with worstcase guarantees for the overhead of a simulation. Such simulations are interesting because they may increase productivity in parallel computing since synchronous parallel programs are easier to reason about than asynchronous ones are. This paper presents a solution to the question of Martel et al. Specifically, we show a deterministic asynchronous algorithm for the Certified WriteAll problem. Our algorithm has $O(n p^4\log n)$ work, which is optimal for a nontrivial number of processors $p\leq \bra{n/\log n}^{1/4}$. In contrast, all known deterministic algorithms require superlinear in $n$ work when $p= n^{1/r}$, for any fixed $r\geq 1$. Our algorithm generalizes the collision principle used by the algorithm T that was introduced by Buss et al. [7].
Challenges in evaluating distributed algorithms
 of Lecture Notes in Computer Science
, 2003
"... ..."
A Method for Creating NearOptimal Instances of a Certified WriteAll Algorithm
 11th Annual European Symposium on Algorithms (ESA’03
, 2003
"... This paper shows how to create nearoptimal instances of the Certified WriteAll algorithm called AWT that was introduced by Anderson and Woll [2]. This algorithm is the best known deterministic algorithm that can be used to simulate n synchronous parallel processors on n asynchronous processors. In ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper shows how to create nearoptimal instances of the Certified WriteAll algorithm called AWT that was introduced by Anderson and Woll [2]. This algorithm is the best known deterministic algorithm that can be used to simulate n synchronous parallel processors on n asynchronous processors. In this algorithm n processors update n memory cells and then signal the completion of the updates. The algorithm is instantiated with q permutations, where q can be chosen from a wide range of values. When implementing a simulation on a specific parallel system with n processors, one would like to use an instance of the algorithm with the best possible value of q, in order to maximize the efficiency of the simulation. This paper shows that the choice of q is critical for obtaining an instance of the AWT algorithm with nearoptimal work. For any > 0, and any large enough n, work of any instance of the algorithm must be at least n . Under certain conditions, however, that q is about e and for infinitely many large enough n, this lower bound can be nearly attained by instances of the algorithm with work at most n . The paper also shows a penalty for not selecting q well. When q is significantly away from e , then work of any instance of the algorithm with this displaced q must be considerably higher than otherwise.
Group membership and widearea masterworker computations
 In Proc. 23rd ICDCS
, 2003
"... Abstract Group communications systems have been designed to provide an infrastructure for faulttolerance in distributed systems, including widearea systems. In our work on masterworker computation for GriPhyN, which is a large project in the area of the computational grid, we asked the question ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract Group communications systems have been designed to provide an infrastructure for faulttolerance in distributed systems, including widearea systems. In our work on masterworker computation for GriPhyN, which is a large project in the area of the computational grid, we asked the question should we build our widearea masterworker computation using widearea group communications? This paperexplains why we decided doing so was not a good idea. 1