Towards practical deterministic Write-All algorithms

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 271-280

  Chlebus, B S ^a   Malewicz, G ^a   Dobrev, S ^a   Shvartsman, A ^a   Kowalski, D R ^a   Vrto, I ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Contention of permutations; Parallel algorithms; Scheduling; Work; Write All

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ITERATIVE METHODS; PARALLEL ALGORITHMS; PROGRAM COMPILERS; SET THEORY; THEOREM PROVING;

DECENTRALIZED COMPUTING;

PARALLEL PROCESSING SYSTEMS;

EID: 0034832393     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. Algorithms for the certified write-all problem
2. Clock construction in fully asynchronous parallel systems and PRAM simulation
3. Highly efficient asynchronous execution of large-grained parallel programs
4. Parallel algorithms with processor failures and delays
5. The APRAM: Incorporating asynchrony into the PRAM model
6. The expected advantage of asynchrony
7. LogP: Towards a realistic model of parallel computation
8. Parallel processing on networks of workstation: A fault-tolerant, high performance approach
9. Parallel techniques for combinatorial computation
10. Parallelism in random access machines
11. Lectures on parallel computation
12. A more practical PRAM model
13. An algorithm for the asynchronous write-all problem based on process collision
14. Deterministic P-RAM: Simulation with constant redundancy
15. Efficient parallel algorithms can be made robust
16. Survey of parallel algorithms for shared-memory machines
17. Efficient program transformations for resilient parallel computation via randomization
18. Efficient robust parallel computations
19. Dynamic-fault-prone BSP: A paradigm for robust computation in changing environments
20. Work-optimal asynchronous algorithms for shared memory parallel computers
21. Asynchronous PRAMs are (Almost) as good as synchronous PRAMs
22. Constructions of permutation arrays for certain scheduling cost measures
23. Asynchronous shared memory parallel computation
24. Towards an architecture-independent analysis of parallel algorithms
25. Achieving optimal CRCW PRAM fault-tolerance
26. General purpose parallel architectures
27. A bridging model for parallel computation
28. Analysis of the subtractive algorithm for greatest common divisors