Abstract
When implementing multi-processing systems consisting of a large number of processors, memory modules and interconnection switches, we must expect some of the system elements to become faulty. These faults may be the result of manufacturing defects or failures that occur while the system is already in operation. If the system is allowed to continue its operation in the presence of a few faulty elements, we need to predict the performance of the degraded system.
In this paper, we analyze the performance of multi-processor systems with a multistage interconnection network in the presence of faulty elements. We propose the use of two measures for performance, namely, bandwidth and connectivity. We then derive expressions for these measures for a non-redundant system and for a system with redundancy in its interconnection network. Finally, we compare the two systems through some numerical examples.
This work was supported in part by NSF under contract DCR-85-09423.
On leave from the Technion, Haifa Israel
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
G. B. Adams and H. J. Siegel, “The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems,” IEEE Trans. on Computers, Vol. C-31, May 1982, pp. 443–454.
G. B. Adams, D. P. Agrawal and H. J. Siegel, “A Survey and Comparison of Fault-Tolerant Multistage Interconnection Networks,” Computer, Vol. 20, June 1987, pp. 14–27.
M. Jeng and H. J. Siegel, “A Fault-Tolerant Multistage Interconnection Network for Multiprocessor Systems using Dynamic Redundancy,” Proc. of the 1986 Symp. on Distributed Computing Systems,pp. 70–77.
I. Koren and D.K. Pradhan, “Modeling the Effect of Redundancy on Yield and Performance of VLSI Systems,” IEEE Trans. on Computers, Vol. C-36, March 1987, pp. 344–355.
V. P. Kumar and S. M. Reddy, “Augmented Shuffle-Exchange Multistage Interconnection Networks,” Computer, Vol. 20, June 1987, pp. 30–40.
K. Padmanabhan and D. H. Lawrie, “A Class of Redundant Path Multistage Interconnection Networks,” IEEE Trans. on Computers, Vol. C-32, Dec. 1983, pp. 1099–1108.
J. H. Patel, “Performance of Processor-Memory Interconnection for Multiprocessors,” IEEE Trans. on Computers, Vol. C-30, Oct. 1981, pp. 771–780.
N. Tzeng, P. Yew and C. Zhu, “A Fault-Tolerant Scheme for Multistage Interconnection Networks,” Proc. of the 12-th Annual Symp. on Comp. Arch., June 1985, pp. 368–375.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Plenum Press, New York
About this chapter
Cite this chapter
Koren, I., Koren, Z. (1988). Analyzing the Connectivity and Bandwidth of Multiprocessors with Multi-stage Interconnection Networks. In: Tewksbury, S.K., Dickinson, B.W., Schwartz, S.C. (eds) Concurrent Computations. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-5511-3_26
Download citation
DOI: https://doi.org/10.1007/978-1-4684-5511-3_26
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-5513-7
Online ISBN: 978-1-4684-5511-3
eBook Packages: Springer Book Archive