Fault-Tolerant Parallel Computation pp 47-114 | Cite as

# The Write-All Problem: Algorithms

## Abstract

DEMONSTRATING the existence of robust algorithms for the *Write-All* problem given in Definition 1.4.1 is essential for developing the approach to algorithm simulations and transformations we present in Chapter 5. Here we describe and analyze several key algorithms for the *Write-All* problem using three different algorithmic paradigms. We begin overviewing the paradigms, and the basic algorithmic techniques and data structures used in solving the *Write-All* problem. In presenting the algorithms we normally give the complexity results in terms of *N*,the size of the *Write-All* array, and *P*,the number of initially available processors.

## Keywords

Shared Memory Algorithm Versus Progress Tree High Level View Sibling Node## Preview

Unable to display preview. Download preview PDF.

## Bibliographic Notes

- [56]P.C. Kanellakis and A.A. Shvartsman, “Efficient Parallel Algorithms Can Be Made Robust”,
*Distributed Computing*, vol. 5, no. 4, pp. 201–217, 1992; prelim. vers. in*Proc. of the 8th ACM PODC*, pp. 211–222, 1989.Google Scholar - [57]P.C. Kanellakis and A.A. Shvartsman, “Efficient Parallel Algorithms On Restartable Fail-Stop Processors”, in
*Proc. of the 10th ACM Symposium on Principles of Distributed Computing*, 1991.Google Scholar - [83]C. Martel, personal communication, March, 1991.Google Scholar
- [62]Z.M. Kedem, K.V. Palem, A. Raghunathan, and P. Spirakis, “Combining Tentative and Definite Executions for Dependable Parallel Computing,” in
*Proc 23d ACM. Symposium on Theory of Computing*, pp. 381–390, 1991.Google Scholar - [111]A. A. Shvartsman, “Efficient Write-All Algorithm for Fail-Stop PRAM Without Initialized Memory”,
*Information Processing Letters*, vol. 44, no. 6, pp. 223–231, 1992.MATHCrossRefGoogle Scholar - [62]Z.M. Kedem, K.V. Palem, A. Raghunathan, and P. Spirakis, “Combining Tentative and Definite Executions for Dependable Parallel Computing,” in
*Proc 23d ACM. Symposium on Theory of Computing*, pp. 381–390, 1991.Google Scholar - [63]Z. M. Kedem, K. V. Palem, and P. Spirakis, “Efficient Robust Parallel Computations,”
*Proc. 22nd ACM Symp. on Theory of Computing*, pp. 138–148, 1990.Google Scholar - [110]A. A. Shvartsman, “Achieving Optimal CRCW PRAM Fault-Tolerance”,
*Information Processing Letters*, vol. 39, no. 2, pp. 59–66, 1991.MathSciNetMATHCrossRefGoogle Scholar - [26]R. Cole and O. Zajicek, “The APRAM: Incorporating Asynchrony into the PRAM Model,” in
*Proc. of the 1989 ACM Symp. on Parallel Algorithms and Architectures*, pp. 170–178, 1989.Google Scholar - [87]C. Martel, R. Subramonian, and A. Park, “Asynchronous PRAMS are (Almost) as Good as Synchronous PRAMS,” in
*Proc. 32d IEEE Symposium on Foundations of Computer Science*, pp. 590–599, 1990.Google Scholar - [54]P.C. Kanellakis, D. Michailidis, A.A. Shvartsman, “Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms”,
*Nordic J. of Computing*, vol. 2, pp. 146–180, 1995 (prel. vers. in*7th Int-1 Work. on Distributed Algorithms*, pp. 99–114, 1993 ).Google Scholar - [16]P. Beame, M. Kik and M. Kutylowski, “Information broadcasting by Exclusive Read PRAMs”, manuscript 1992.Google Scholar
- [20]J. Buss, P.C. Kanellakis, P. Ragde, A.A. Shvartsman, “Parallel algorithms with processor failures and delays”,
*Journal of Algorithms*, vol. 20, pp. 45–86, 1996.MathSciNetMATHCrossRefGoogle Scholar - [108]R.D. Schlichting and F.B. Schneider, “Fail-Stop Processors: an Approach to Designing Fault-tolerant Computing Systems”,
*ACM Transactions on Computer Systems*, vol. 1, no. 3, pp. 222–238, 1983.CrossRefGoogle Scholar - [87]C. Martel, R. Subramonian, and A. Park, “Asynchronous PRAMS are (Almost) as Good as Synchronous PRAMS,” in
*Proc. 32d IEEE Symposium on Foundations of Computer Science*, pp. 590–599, 1990.Google Scholar - [9]R.J. Anderson, H. Woll, “Algorithms for the Certified Write All Problem,” to appear in
*SIAM Journal of Computing*. Prel. version: “Wait-Free Parallel Algorithms for the Union-Find Problem”,*Proc. of the 23rd ACM Symp. on Theory of Computing*, pp. 370–380, 1991.Google Scholar - [91]J. Naor, R.M. Roth, “Constructions of Permutation Arrays for Ceratin Scheduling Cost Measures”,
*Random Structures and Algorithms*, vol. 6, pp. 39–50, 1995.MathSciNetMATHCrossRefGoogle Scholar - [64]D.E. Knuth,
*The Art of Computer Programming, vol*.*3, Sorting and Searching*, Addison-Wesley Publ. Co., 1973.Google Scholar - [59]P.C. Kanellakis and A.A. Shvartsman, “Fault-Tolerance and Efficiency in Massively Parallel Algorithms”, in
*Foundations of Dependable Computing -Paradigms for Dependable Applications*, G. M. Koob and C. G. Lau, Eds., Kluwer Acad. Publ., pp. 125–154, 1994.CrossRefGoogle Scholar - [30]T.H. Cormen, C.E. Leiserson and R.L. Rivest,
*Introduction to Algorithms*, MIT Press, 1990.Google Scholar - [18]G. Birkhoff, S. MacLane,
*A Survey of Modern Algebra*, 4th ed., Macmillan, 1977.Google Scholar