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.
References and Suggested Reading
Adams, G. B., III, D. P. Agrawal, and H. J. Siegel, “Fault-Tolerant Multistage Interconnection Networks,” IEEE Computer, Vol. 20, No. 6, pp. 14–27, June 1987.
Bruck, J., R. Cypher, and C.-T. Ho, “Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares,” IEEE Trans. Computers, Vol. 42, No. 9, pp. 1089–1104, September 1993.
Chiu, G.-M., and K.-S. Chen, “Use of Routing Capbility for Fault-Tolerant Routing in Hypercube Multicomputers,” IEEE Trans. Computers, Vol. 46, No. 8, pp. 953–958, August 1997.
Ciciani, B., Manufacturing Yield Evaluation of VLSI/WSI Systems, IEEE Computer Society Press, 1995.
Dutt, S., and F. T. Assaad, “Mantissa-Preserving Operations and Robust Algorithm-Based Fault Tolerance for Matrix Computations,” IEEE Trans. Computers, Vol. 45, No. 4, pp. 408–424, April 1996.
Huang, K. H., and J. A. Abraham, “Algorithm-Based Fault Tolerance for Matrix Operations,” IEEE Trans. Computers, Vol. 33, No. 6, pp. 518–528, June 1984.
Kung, S. Y., VLSI Array Processors, Prentice-Hall, 1988.
Parhami, B., “A Multi-Level View of Dependable Computing,” Computers & Electrical Engineering, Vol. 20, No. 4, pp. 347–368, 1994.
Parhami, B., and C. Y. Hung, “Robust Shearsort on Incomplete Bypass Meshes,” Proc. 9th Int. Parallel Processing Symp., April 1995, pp. 304–311.
Parhami, B., and C.-H. Yeh, “The Robust-Algorithm Approach to Fault Tolerancc on Processor Arrays: Fault Models, Fault Diameter, and Basic Algorithms,” Proc. Joint 12th Int. Parallel Processing Symp. and 9th Symp. Parallel and Distributed Processing, 1998, pp. 742–746.
Parhami, B., Computer Arithmetic: Algorithms and Architectures, to be published by Oxford University Press.
Pradhan, D. K., and P. Banerjee, “Fault-Tolerant Multiprocessor and Distributed Systems: Principles,” Chapter 3 in Fault-Tolerant Computer System Design, Prentice-Hall, 1996, pp. 135–235.
Yeh, C.-H., and B. Parhami, “Optimal Sorting Algorithms on Incomplete Meshes with Arbitrary Fault Patterns,” Proc. Int. Conf. Parallel Processing, August 1997, pp. 4–11.
Ziv, A., and J. Bruck, “Checkpointing in Parallel and Distributed Systems,” Chapter 10 in Parallel and Distributed Computing Handbook, edited by A. Y. Zomaya, McGraw-Hill, 1996, pp. 274–302.
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
(2002). Reliable Parallel Processing. In: Introduction to Parallel Processing. Series in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/0-306-46964-2_19
Download citation
DOI: https://doi.org/10.1007/0-306-46964-2_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-306-45970-2
Online ISBN: 978-0-306-46964-0
eBook Packages: Springer Book Archive