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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliographic Notes
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.
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.
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.
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 ).
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kanellakis, P.C., Shvartsman, A.A. (1997). Lower Bounds, Snapshots and Approximation. In: Fault-Tolerant Parallel Computation. The Springer International Series in Engineering and Computer Science, vol 401. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5210-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5210-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5177-9
Online ISBN: 978-1-4757-5210-6
eBook Packages: Springer Book Archive