Parallel Algorithms with Processor Failures and Delays

Journal of Algorithms

Volumn 20, Issue 1, 1996, Pages 45-86

  Buss, Jonathan F ^a   Kanellakis, Paris C ^b   Ragde, Prabhakar L ^a   Shvartsman, Alex Allister ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b BROWN UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIPROCESSING SYSTEMS;

COMPLEXITY MEASURE; DELAY; FAILURES; RESTART;

PARALLEL ALGORITHMS;

EID: 0030360110     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0003     Document Type: Article

References (48)

1. G. B. Adams III, D. P. Agrawal, and H. J. Seigel, A survey and comparison of fault-tolerant multistage interconnection networks, IEEE Comput. 20(6) (1987), 14-29.
2. Y. Afek, B. Awerbuch, S. Plotkin, and M. Saks, Local management of a global resource in a communication network, in "Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, 1987," pp. 347-357.
3. R. Anderson, Parallel algorithms for generating random permutations on a shared memory machine, in "Proceedings of the 2nd ACM Symposium on Parallel Algorithms and Architectures, 1990," pp. 95-102.
4. R. Anderson and H. Woll, Wait-free parallel algorithms for the union-find problem, in "Proceedings of the 23rd ACM Symposium on Theory of Computing, 1991," pp. 370-380.
5. J. Aspnes and M. Herlihy, Wait-free data structures in the asynchronous PRAM model, in "Proceedings of the 2nd ACM Symposium on Parallel Algorithms and Architectures, 1990," pp. 340-349.
6. S. Assaf and E. Upfal, Fault Tolerant Sorting Network, in "Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990," pp. 275-284.
7. J. Buss and P. Ragde, Certified Write-All on a strongly asynchronous PRAM, manuscript, 1990.
8. R. Cole and O. Zajicek, The APRAM: Incorporating asynchrony into the PRAM model, in "Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, 1989," pp. 170-178.
9. R. Cole and O. Zajicek, The expected advantage of asynchrony, in "Proceedings of the 2nd ACM Symposium on Parallel Algorithms and Architectures, 1990," pp. 85-94.
10. B. Chor, A. Israeli, and M. Li, On processor coordination using asynchronous hardware, in "Proceedings of the 6th ACM Symp. on Principles of Distributed Computing, 1987," pp. 86-97.
11. F. Cristian, Understanding fault-tolerant distributed systems, Commun. ACM 3(2) (1991), 56-78.
12. C. Dwork, D. Peleg, N. Pippenger, and E. Upfal, Fault tolerance in networks of bounded degree, in "Proceedings of the 18th ACM Symposium on Theory of Computing, 1986," pp. 370-379.
13. D. Eppstein and Z. Galil, Parallel techniques for combinatorial computation, Annu. Comput. Sci. Rev. 3 (1988), 233-283.
14. S. Fortune and J. Wyllie, Parallelism in random access machines, in "Proceedings of the 10th ACM Symposium on Theory of Computing, 1978," pp. 114-118.
15. P. Gibbons, A more practical PRAM model, in "Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, 1989," pp. 158-168.
16. M. P. Herlihy, Impossibility and universality results for wait-free synchronization, in "Proceedings of the 7th ACM Symposium on Principles of Distributed Computing, 1988," pp. 276-290.
17. S. W. Hornick and F. P. Preparata, Deterministic P-RAM: Simulation with constant redundancy, in "Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, 1989," pp. 103-109.
18. IEEE Comput. (Fault-tolerant computing, special issue) 17(8) (1984).
19. IEEE Comput. (Fault-tolerant systems, special issue) 23(7) (1990).
20. C. Kaklamanis, A. Karlin, F. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, and A. Tsantilas, Asymptotically tight bounds for computing with arrays of processors, in "Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990," pp. 285-296.
21. P. C Kanellakis and A. A. Shvartsman, Efficient parallel algorithms can be made robust, Distrib. Comput. 5 (1992), 201-217; prel. version in "Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, 1989," pp. 211-222.
22. P. C Kanellakis and A. A. Shvartsman, Efficient parallel algorithms can be made robust, Distrib. Comput. 5 (1992), 201-217; prel. version in "Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, 1989," pp. 211-222.
23. P. C. Kanellakis and A. A. Shvartsman, Efficient parallel algorithms on restartable fail-stop processors, in "Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, 1991,"pp. 23-36.
24. R M. Karp and V. Ramachandran, A survey of parallel algorithms for shared-memory machines, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), North-Holland, Amsterdam, 1990.
25. Z. M. Kedem, K. V. Palem, M. O. Rabin and A. Raghunathan, Efficient program transformations for resilient parallel computation via randomization, in "Proceedings of the 24th ACM Symposium on Theory of Computing, 1992," pp. 306-318.
26. Z. M. Kedem, K. V. Palem, and P. Spirakis, Efficient robust parallel computations, in "Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990," pp. 138-148.
27. Z. M. Kedem, K. V. Palem, A. Raghunathan, and P. Spirakis, Combining tentative and definite executions for dependable parallel computing, in "Proceedings of the 23d ACM Symposium on Theory of Computing, 1991," pp. 381-390.
28. C. P. Kruskal, L. Rudolph, and M. Snir, Efficient synchronization on multiprocessors with shared memory, ACM Trans. Program. Lang. Syst. 10(4) (1988), 579-601.
29. L. Lamport, On interprocess communication, Distrib. Comput. 1 (1986), 77-101.
30. 2 n/log log n) in a synchronous fail-stop (no restart) PRAM, unpublished manuscript, 1992.
31. M. Loui and H. Abu-Amara, Memory requirements for agreement among unreliable asynchronous processes, Adv. Comput. Res. 4 (1987), 163-183.
32. N. A. Lynch, N. D. Griffeth, M. J. Fischer, and L. J. Guibas, Probabilistic analysis of a network resource allocation algorithm, Inform. Control 68 (1986), 47-85.
33. C. Martel, personal communication, Mar. 1991.
34. C. Martel and R. Subramonian, On the complexity of certified Write-All algorithms, J. Algorithms 16, (1994), 361-387. (a prel. version is in "Proceedings of the 12th Conference on Foundations of Software Technology and Theortical Computer Science, New Delhi, India, Dec. 1992").
35. C. Martel and R. Subramonian, On the complexity of certified Write-All algorithms, J. Algorithms 16, (1994), 361-387. (a prel. version is in "Proceedings of the 12th Conference on Foundations of Software Technology and Theortical Computer Science, New Delhi, India, Dec. 1992").
36. C. Martel, R. Subramonian, and A. Park, Asynchronous PRAMs are (almost) as good as synchronous PRAMs, in "Proceedings of the 32d IEEE Symposium on Foundations of Computer Science, 1990," pp. 590-599. Also see Technical Report CSE-89-6, University of California - Davis, 1989.
37. N. Nishimura, Asynchronous shared memory parallel computation, in "Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architectures, 1990," pp. 76-84.
38. N. Pippenger, On networks of noisy gates, in "Proceedings of 26th IEEE Symposium on Foundations of Computer Science, 1985," pp. 30-38.
39. A. Ranade, How to emulate shared memory, in "Proceedings of 28th IEEE Symposium on Foundations of Computer Science, 1987," pp. 185-194.
40. L. Rudolph, A robust sorting network, IEEE Trans. Comput. 34(4) (1985), 326-335.
41. D. B. Sarrazin and M. Malek, Fault-tolerant semiconductor memories, IEEE Comput. 17(8) (1984), 49-56.
42. R. D. Schlichting and F. B. Schneider, Fail-stop processors: An approach to designing fault-tolerant computing systems, ACM Trans. Comput. Syst. 1(3) (1983), 222-238.
43. J. T. Schwartz, Ultracomputers, ACM Trans. Program. Lang. Syst. 2(4) (1980), 484-521.
44. A. A. Shvartsman, Achieving optimal CRCW PRAM fault-tolerance, Inform. Process. Lett. 39(2) (1991), 59-66.
45. A. A. Shvartsman, Efficient Write-All algorithm for fail-stop PRAM without initialized memory, Inform. Process. Lett. 44(6) (1992), 223-231.
46. E. Upfal, An O(log N) deterministic packet routing scheme, in "Proceedings of the 21st ACM Symposium on Theory of Computing, 1989," pp. 241-250.
47. L. Valiant, General purpose parallel architectures, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), North-Holland, Amsterdam, 1990.
48. L. Valiant, A bridging model for parallel computation, Commun. ACM 33 (1990), 103-111.