Advertisement

Lower Bounds, Snapshots and Approximation

  • Paris Christos Kanellakis
  • Alex Allister Shvartsman
Chapter
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 401)

Abstract

IN SEARCH of efficient fault-tolerant algorithms, it is important to also consider the lower bounds for relevant problems. The efficiency achieved by a fault-tolerant Write-All algorithm in a particular parallel model needs to be contrasted with the lower bound results for the model. If there is a gap between the upper and lower bounds results, then there is a possibility of developing better algorithms.

Keywords

Shared Memory Memory Location Array Element Shared Memory Model Pram Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographic Notes

  1. [29]
    S.A. Cook, C. Dwork and R. Reischuk, “Upper and Lower Time Bounds for Parallel Random Access Machine without Simultaneous Writes, SIAM Journal on Computing, vol. 15, pp. 87–89, 1986.MathSciNetMATHCrossRefGoogle Scholar
  2. [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
  3. [60]
    R.M. Karp and V. Ramachandran, “A Survey of Parallel Algorithms for Shared-Memory Machines”, in Handbook of Theoretical Computer Science (ed. J. van Leeuwen), vol. 1, North-Holland, 1990.Google Scholar
  4. [86]
    C. Martel and R. Subramonian, “On the Complexity of Certified Write-All Algorithms”, Journal of Algorithms, vol. 16, no. 3., pp. 361–387, 1994 (a prel. version in the Proc. of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science, New Delhi, India, December 1992 ).Google Scholar
  5. [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

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Paris Christos Kanellakis
    • 1
  • Alex Allister Shvartsman
    • 2
  1. 1.Brown UniversityProvidenceUSA
  2. 2.Massachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations