Explicit Combinatorial Structures for Cooperative Distributed Algorithms

Kowalski, Dariusz R.; Musial, Peter M.; Shvartsman, Alexander A.

doi:10.1109/icdcs.2005.34

Cited by 9 publications

(7 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We are continuing to explore ways of constructing required permutations based on multiplicative groups [Chlebus et al 2001]. Our initial findings in this direction are reported in Kowalski et al [2005].…”

Section: Discussionmentioning

confidence: 95%

See 1 more Smart Citation

Writing-all deterministically and optimally using a nontrivial number of asynchronous processors

Kowalski

Shvartsman

2008

ACM Trans. Algorithms

View full text Add to dashboard Cite

The problem of performing n tasks on p asynchronous or undependable processors is a basic problem in distributed computing. This article considers an abstraction of this problem called WriteAll: using p processors write 1's into all locations of an array of size n. In this problem writing 1 abstracts the notion of performing a simple task. Despite substantial research, there is a dearth of efficient deterministic asynchronous algorithms for Write-All. Efficiency of algorithms is measured in terms of work that accounts for all local steps performed by the processors in solving the problem. Thus, an optimal algorithm would have work (n), however it is known that optimality cannot be achieved when p = (n). The quest then is to obtain work-optimal solutions for this problem using a nontrivial, compared to n, number of processors p. The algorithm presented in this article has work complexity of O(n + p 2+ ), and it achieves work optimality for p = O(n 1/(2+ε) ) for any ε > 0, while the previous best result achieved optimality for p ≤ 4 √ n/ log n. Additionally, the new result uses only the atomic read/write memory, without resorting to using the test-and-set primitive that was necessary in the previous solution.

show abstract

Section: Discussionmentioning

confidence: 95%

“…Additionally, Chlebus et al [2001] presented analytical and experimental evidence that suitable permutations can be constructed efficiently and directly. An efficient polynomial time construction of permutations with contention O(q polylog q) has also been recently developed by Kowalski et al [2005].…”

Section: Introductionmentioning

confidence: 99%

Writing-all deterministically and optimally using a nontrivial number of asynchronous processors

Kowalski

Shvartsman

2008

ACM Trans. Algorithms

View full text Add to dashboard Cite

show abstract

“…These performance bounds were shown to be achievable by a constructive algorithm, whose code can be obtained in time that is polynomial in n, by Kowalski, Musial and Shvartsman [28].…”

Section: Our Resultsmentioning

confidence: 96%

“…This was next shown to be achievable by a constructive algorithm by Kowalski, Musial and Shvartsman [28].…”

mentioning

confidence: 93%

Robust gossiping with an application to consensus

Chlebus

Kowalski

2006

Journal of Computer and System Sciences

View full text Add to dashboard Cite

We study deterministic gossiping in synchronous systems with dynamic crash failures. Each processor is initialized with an input value called rumor. In the standard gossip problem, the goal of every processor is to learn all the rumors. When processors may crash, then this goal needs to be revised, since it is possible, at a point in an execution, that certain rumors are known only to processors that have already crashed. We define gossiping to be completed, for a system with crashes, when every processor knows either the rumor of processor v or that v has already crashed, for any processor v. We design gossiping algorithms that are efficient with respect to both time and communication. Let t < n be the number of failures, where n is the number of processors. If n − t = Ω(n/polylog n), then one of our algorithms completes gossiping in O(log 2 t) time and with O(n polylog n) messages. We develop an algorithm that performs gossiping with O(n 1.77 ) messages and in O(log 2 n) time, in any execution in which at least one processor remains non-faulty. We show a trade-off between time and communication in gossiping algorithms: if the number of messages is at most O(n polylog n), then the time has to be at least Ω( log n log(n log n)−log t ). By way of application, we show that if n − t = Ω(n), then consensus can be solved in O(t) time and with O(n log 2 t) messages.

show abstract

“…The results in [21] show how to construct the needed permutations efficiently, yet the algorithm in [20] remains complex and hard to implement.…”

Section: Introductionmentioning

confidence: 98%

Coordinated Cooperative Work Using Undependable Processors with Unreliable Broadcast

Davtyan

Prisco

Georgiou

et al. 2014

2014 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing

View full text Add to dashboard Cite

With the end of Moore's Law in sight, parallelism became the main means for speeding up computationallyintensive applications, especially in the cases where large collections of tasks need to be performed. Network supercomputing-taking advantage of very large numbers of computers in a distributed environment-is an effective approach to massive parallelism that harnesses the processing power inherent in large networked settings. In such settings, processor failures are no longer an exception, but the norm. Any algorithm designed for realistic settings must be able to deal with failures. This paper presents a new message-passing algorithm for distributed cooperative work in synchronous settings where processors may crash, and where any broadcasts performed by crashing processors are unreliable. We specify the algorithm, prove that it is correct, and perform extensive simulations that show that its performance is close to similar algorithms that use reliable broadcast, and that its work compares favorably to the relevant lower bounds.

show abstract

Explicit Combinatorial Structures for Cooperative Distributed Algorithms

Abstract: Abstract

Cited by 9 publications

References 15 publications

Writing-all deterministically and optimally using a nontrivial number of asynchronous processors

Writing-all deterministically and optimally using a nontrivial number of asynchronous processors

Robust gossiping with an application to consensus

Coordinated Cooperative Work Using Undependable Processors with Unreliable Broadcast

Contact Info

Product

Resources

About