Skip to main content

On the complexity of Certified Write All Algorithms

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 652))

  • 185 Accesses

Abstract

An Asynchronous PRAM allows processors to run at different and unpredictable speeds. Thus a fundamental problem in designing asynchronous PRAM algorithms is constructing a synchronization primitive which determines that a set of tasks has been completed. The Certified Write All Problem (CWA) is: given an array A[1..n] and a flag f which are both initialized to zero, set all elements of A to one, and then set f to one. A solution to the Certified Write All problem can be used as a synchronization primitive in a wide variety of settings. This paper investigates the complexity of CWA algorithms by presenting several new algorithms and lower bound proofs.

We present a new randomized CWA algorithm which uses expected O(n) work using up to n/log n processors. We show that this algorithm is optimal in both work and processor utilization by proving an Ω(n + p log n) lower bound on the expected work done by a p processor randomized CWA algorithm. Our CWA algorithm uses concurrent reads and concurrent writes. We show that this is necessary by proving that no concurrent read exclusive write (CREW) asynchronous PRAM can solve the CWA problem. However, for a fail-stop PRAM, where processors operate synchronously until they fail, we present a randomized CREW CWA algorithm. This algorithm also uses O(n) expected work using up to n/log n CREW fail-stop processors.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. Aggarwal, A. Chandra and M. Snir, “On Communication Latency in PRAM Computations” Proc. of 1st ACM SPAA, 1989, pp. 11–21.

    Google Scholar 

  2. R. Anderson, H. Woll, “Wait-free Parallel Algorithms for the Union-Find Problem”, Proc. of the 23nd Annual STOC, pp. 370–380, 1991.

    Google Scholar 

  3. J. Becker, C. Martel, and A. Park, “General Asynchrony is not Expensive for PRAMs” Proc. of IPPS, pp. 70–75, 1991.

    Google Scholar 

  4. Y. Birk, P. Gibbons, J. Sanz, and D. Soroker, “A Simple Mechanism for Efficient Barrier Synchronization in MIMD Machines”, Proc. of ICPP, vol. 2, pp. 195–198, 1990.

    Google Scholar 

  5. J. Buss and P. Ragde, “Certified write-all on a strongly asynchronous PRAM”, Preliminary report, 1990.

    Google Scholar 

  6. R. Cole, O. Zajicek, “The APRAM: Incorporating Asynchrony into the PRAM Model”, Proc. of 1st SPAA, pp. 169–178, 1989.

    Google Scholar 

  7. R. Cole. O. Zajicek, “The Expected Advantage of Asynchrony” Proc. of 2nd SPAA, pp. 85–94, 1990.

    Google Scholar 

  8. P. B. Gibbons, “A More Practical PRAM Model”, Proc. of 1st SPAA, 1989, pp.158–168.

    Google Scholar 

  9. R. M. Karp, V. L. Ramachandran, “A Survey of Parallel Algorithms for Shared Memory Machines”, Theoretical Computer Science, 1990.

    Google Scholar 

  10. P.C. Kancllakis and A.A. Shvartsman, “Efficient parallel algorithms can be made robust” Proc. of PODC, 1989, pp. 211–221.

    Google Scholar 

  11. P.C. Kanellakis and A.A. Shvartsman, “Efficient parallel algorithms on restartable fail-slop processors” Proc. of PODC, 1991.

    Google Scholar 

  12. Z.M. Kedem, K.V. Palem, A. Raghunathan, and P.G. Spirakis, “Combining Tentative and Definite Executions for Very Fast Dependable Computing” Proc. of 23nd STOC, pp. 381–390, 1991.

    Google Scholar 

  13. Z.M. Kedem, K.V. Palem, P.G. Spirakis, “Efficient Robust Parallel Computations” Proc. of 22nd STOC, pp. 138–148, 1990.

    Google Scholar 

  14. C. Kruskal and L. Rudolph and M. Snir, “A Complexity Theory of Efficient Parallel Algorithms”, Theoretical Computer Science, 1990, Vol. 71, pp. 95–132.

    Article  Google Scholar 

  15. M. Luby, On the Parallel Complexity of Symmetric Connection Networks, Technical Report Number 214/88, Department of Computer Science, University of Toronto. ][16] C.U. Martel and A. Raghunathan, Asynchronous PRAMs with Memory Latency, Technical Report Number CSE 91-14, CS Division, UC, Davis.

    Google Scholar 

  16. C.U. Martel, A. Park, R. Subramonian, “Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers”, SIAM Journal of Computing, Dec. 1992.

    Google Scholar 

  17. C.U. Martel and R.Subramonian, “Optimal Asynchronous Algorithms for List Ranking and Transitive Closure”, Proc. of ICPP Conference on Parallel Processing, vol. 2, pp. 60–63.

    Google Scholar 

  18. R.Subramonian and C.U. Martel, “How to Emulate Synchrony”, Tech. Report CSE-90-26, Division of Computer Science, UC, Davis.

    Google Scholar 

  19. C.U. Martel, R.Subramonian, and A. Park, “Asynchronous PRAMs are (almost) as Good as Synchronous PRAMs”, Proc. of FOCS conference, pp. 590–599, 1990.

    Google Scholar 

  20. N. Nishimura, “Asynchronous Shared Memory Parallel Computation” Proc. of 2nd SPAA, pp. 76–84, 1990.

    Google Scholar 

  21. P. Raghavan, “Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs” JCSS vol. 37, pp.130–143, 1988.

    Google Scholar 

  22. A. Shvartsman, “Achieving Optimal CRCW Fault-tolerance”, Tech. Rep. CS-89-49, Brown University, Dec. 1989.

    Google Scholar 

  23. L. Valiant, “A Bridging Model for Parallel Computation”, CACM, vol. 33 no. 8, pp. 103–111, 1990.

    Google Scholar 

  24. U. Vishkin, “A Parallel-Design Distributed Implementation (PDDI) General Purpose Parallel Computer”, Theoretical Computer Science, vol. 32, pp. 157–172, 1984.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Rudrapatna Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martel, C., Subramonian, R. (1992). On the complexity of Certified Write All Algorithms. In: Shyamasundar, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1992. Lecture Notes in Computer Science, vol 652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56287-7_119

Download citation

  • DOI: https://doi.org/10.1007/3-540-56287-7_119

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56287-0

  • Online ISBN: 978-3-540-47507-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics