Abstract
The crcw pram with dynamic fail-stop errors is a faultprone multiprocessor model for which it is possible to control memory access redundancy while guaranteeing the reliability of efficient algorithms. Concurrent common reads and writes are necessary to handle dynamic faults and in this paper we show how to significantly decrease this concurrency and how to bound it in terms of the number of processor faults. We describe a low concurrency, efficient, and fault-tolerant algorithm for the Write- All primitive: “using ≤ N processors, write 1's into N locations”. This primitive serves as the basis for efficient faulttolerant simulations of algorithms written for fault-free prams on faultprone prams. For any dynamic failure pattern F, our algorithm has total write concurrency ≤¦F¦ and total read concurrency ≤7 ¦F¦log N, where ¦F¦ is the number of processor faults (e.g. no concurrency in a run without failures). Previous algorithms used Ω(N log N) concurrency even in the absence of faults. We also present an optimal fault-tolerant erew pram algorithm for Write-All when all processor faults are initial.
Research supported by ONR grant N00014-91-J-1613.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson, R., Woll, H.: Wait-Free Parallel Algorithms for the Union-Find Problem. Proc. 23rd ACM STOC (1991) 370–380
Aumann, Y., Rabin, M. O.: Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. Proc. 34th IEEE FOCS (1992) 147–156
Beame, P., Kik, M., Kutylowski, M.: Information Broadcast by Exclusive Read PRAMs. Manuscript (1992)
Buss, J., Kanellakis, P. C., Ragde, P., Shvaitsman, A. A.: Parallel Algorithms with Processor Failures and Delays. Brown Univ. TR CS-91-54 (1991) (prel. version Kanellakis, P. C., Shvartsman, A. A.: Efficient Parallel Algorithms On Restartable Fail-Stop Processors. Proc. 10th ACM PODC (1991) 23–36)
Cole, R., Zajicek, O.: The APRAM: Incorporating Asynchrony into the PRAM Model. Proc. 1st ACM SPAA (1989) 170–178
Cole, R., Zajicek, O.: The Expected Advantage of Asynchrony. Proc. 2nd ACM SPAA (1990) 85–94
Eppstein, D., Galil, Z.: Parallel Techniques for Combinatorial Computation. Annual Computer Science Review 3 (1988) 233–283
Fortune, S., Wyllie, J.: Parallelism in Random Access Machines. Proc. 10th ACM STOC (1978) 114–118
Gibbons, P.: A More Practical PRAM Model. Proc. 1st SPAA (1989) 158–168
Kanellakis, P. C., Shvartsman, A. A.: Efficient Parallel Algorithms Can Be Made Robust. Distributed Computing 5 (1992) 201–217 (prel. version in Proc. 8th ACM PODC (1989) 138–148)
Karp, R. M., Ramachandran, V.: A Survey of Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science, (ed. J. van Leeuwen) 1 (1990) North-Holland
Kedem, Z. M., Palem, K. V., Spirakis, P.: Efficient Robust Parallel Computations. Proc. 22nd ACM STOC (1990) 138–148
Kedem, Z. M., Palem, K. V., Rabin, M. O., Raghunathan, A.: Program Transformations for Resilient Parallel Computation via Randomization. Proc. 24th ACM STOC (1992) 306–318
Kedem, Z. M., Palem, K. V., Raghunathan, A., Spirakis, P.: Combining Tentative and Definite Executions for Dependable Parallel Computing. Proc. 23d ACM STOC (1991) 381–390
Martel, C.: Personal communication (1991)
Martel, C., Park, A., Subramonian, R.: Work-optimal Asynchronous Algorithms for Shared Memory Parallel Computers. SIAM Journal on Computing 21 (1992) 1070–1099
Martel, C., Subramonian, R., Park, A.: Asynchronous PRAMs are (Almost) as Good as Synchronous PRAMs. Proc. 32d IEEE FOCS (1990) 590–599
Nishimura, N.: Asynchronous Shared Memory Parallel Computation. Proc. 2nd ACM SPAA (1990) 76–84
Shvartsman, A. A.: Optimal CRCW PRAM Fault-Tolerance. Information Processing Letters 39 (1991) 59–66
Shvartsman, A. A.: Efficient Write-All Algorithm for Fail-Stop PRAM without Initialized Memory. Information Processing Letters 44 (1992) 223–231
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kanellakis, P.C., Michailidis, D., Shvartsman, A.A. (1993). Controlling memory access concurrency in efficient fault-tolerant parallel algorithms (extended abstract). In: Schiper, A. (eds) Distributed Algorithms. WDAG 1993. Lecture Notes in Computer Science, vol 725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57271-6_30
Download citation
DOI: https://doi.org/10.1007/3-540-57271-6_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57271-8
Online ISBN: 978-3-540-48029-7
eBook Packages: Springer Book Archive