SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A complexity theory of efficient parallel algorithms
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
A bridging model for parallel computation
Communications of the ACM
Asynchronous shared memory parallel computation
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
The expected advantage of asynchrony
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Wait-free data structures in the asynchronous PRAM model
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient robust parallel computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Combining tentative and definite executions for very fast dependable parallel computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Achieving optimal CRCW PRAM fault-tolerance
Information Processing Letters
Optimal time randomized consensus—making resilient algorithms fast in practice
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Designing synchronous algorithms for asynchronous processors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Work-optimal asynchronous algorithms for shared memory parallel computers
SIAM Journal on Computing
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Tentative and definite distributed computations: an optimistic approach to network synchronization
Theoretical Computer Science - Special issue on dependable parallel computing
Clock construction in fully asynchronous parallel systems and PRAM simulation
Theoretical Computer Science - Special issue on dependable parallel computing
On the complexity of certified write-all algorithms
Journal of Algorithms
Parallel algorithms with processor failures and delays
Journal of Algorithms
Constructions of permutation arrays for certain scheduling cost measures
Random Structures & Algorithms
Algorithms for the Certified Write-All Problem
SIAM Journal on Computing
Efficient execution of nondeterministic parallel programs on asynchronous systems
Information and Computation
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Towards practical deteministic write-all algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Fault-Tolerant Parallel Computation
Fault-Tolerant Parallel Computation
PRAM Computations Resilient to Memory Faults
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
CALYPSO: a novel software system for fault-tolerant parallel processing on distributed platforms
HPDC '95 Proceedings of the 4th IEEE International Symposium on High Performance Distributed Computing
Performing work with asynchronous processors: message-delay-sensitive bounds
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Parallel processing on networks of workstations: a fault-tolerant, high performance approach
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Distributed scheduling for disconnected cooperation
Distributed scheduling for disconnected cooperation
Writing-all deterministically and optimally using a non-trivial number of asynchronous processors
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
An algorithm for the asynchronous Write-All problem based on process collision
Distributed Computing
| Hi-index | 5.23 |
This paper shows an asymptotically tight analysis of the Certified Write-All algorithm called AWT that was introduced by Anderson and Woll, SIAM J. Comput. 26 (1997) 1277, and a method for creating near-optimal instances of the algorithm. This algorithm is the best known deterministic algorithm that can be used to simulate n synchronous parallel processors on n asynchronous processors. The algorithm is instantiated with q permutations on {1,...,q}, 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 select the best possible value of q and the best possible q permutations, in order to maximize the efficiency of the simulation.This paper shows that work complexity of any instance of AWT is Θ (q2/C ċ n1+logq(C/q)), where q is the number of permutations selected, and C is a value related to their combinatorial properties. The choice of q turns out to be critical for obtaining an instance of the AWT algorithm with near-optimal work. For any ε 0, and any large enough n, work of any instance of the algorithm must be at least n1+(1+n)√2 ln ln n/ln n. Under certain conditions, however, that q is about e√1/2 ln n ln ln n and for infinitely many large enough n, this lower bound can be nearly attained by instances of the algorithm that use certain q permutations and have work at most n1+(1+n)√2 ln ln n/ln n. The paper also shows a penalty for not selecting q well. When q is significantly away from e√1/2 ln n ln ln n, then work of any instance of the algorithm with this displaced q must be considerably higher than otherwise.