Failure Dependent Bandwidth in Shuffle-Exchange Networks
Abstract
A failure-dependent bandwidth model for shuffle-exchange (S/E) and augmented shuffle-exchange (S/E+) interconnection networks is presented. The models are based on probabilities of either data or address model failures for the individual binary switches that comprise the network and give the expected bandwidth as a function of the probability of failures in these switches. A model consistent with those previously published for a zero probability of failure is first developed for the S/E network. It is extended to the S/E+ network by developing a special model for the input stage of the S/E+ network and then proving that, to within a close approximation, the conditions necessary for the S/E model hold at the outputs of first stage of the S/E+. The primary uses of the bandwidth models presented are as a network design parameter and as a measure to evaluate the cost effectiveness of proposed, switch-level, reliability enhancement.
References
[1]
{1} D.H. Lawrie, "Access and alignment of data on an array processor," IEEE Trans. Comput., vol. C-25, Dec. 1976.
[2]
{2} H. S. Stone, "Parallel processing with the perfect shuffle," IEEE Trans. Comput., vol. C-20, Feb. 1971.
[3]
{3} D. S. Parker, Jr., "Notes on shuffle/exchange type switching networks," IEEE Trans. Comput., vol. C-29, Mar. 1980.
[4]
{4} K. Y. Wen and D. H. Lawrie, "Effectiveness of some processor/ memory interconnections," presented at Int. Conf. Parallel Processing, 1976.
[5]
{5} C. I. Wu and T. Y. Feng, "The reverse exchange interconnection network," IEEE Trans. Comput., vol. C-29, Sept. 1980.
[6]
{6} M. C. Pease, "The indirect binary N-cube microprocessor array," IEEE Trans. Comput., vol. C-26, May 1977.
[7]
{7} J. Lenfant, "Parallel permutations of data: A Benes network control algorithm for frequently used permutations," IEEE Trans. Comput., vol. C-27, 1978.
[8]
{8} J. P. Shen and J. P. Hayes, "Fault tolerance of a class of connecting networks," in Proc. 7th Annu. Symp. Comput. Architecture, May 1980.
[9]
{9} Adams and Siegel, "Extra stage cube: A fault tolerant network for supercomputers," IEEE Trans. Comput., vol. C-31, May 1982.
[10]
{10} S. Thanawastien, "The SE-plus network," submitted to ACM Southeastern Regional Conf., 1982.
[11]
{11} J. H. Patel, "Performance of processor-memory interconnections for multiprocessors," IEEE Trans. Comput., vol. C-30, Oct. 1981.
[12]
{12} D. Y. Chang, D. J. Kuck, and D. H. Lawrie, "On the effective bandwidth of parallel memories," IEEE Trans. Comput., vol. C-26, May 1977.
[13]
{13} F. Baskett and A. J. Smith, "Interference in multiprocessor computer systems with interleaved memory," Commun. ACM, vol. 19, June 1976.
[14]
{14} D. P. Bhandarkar, "Analysis of memory interference in multiprocessors," IEEE Trans. Comput., vol. C-24, Sept. 1975.
[15]
{15} C. R. Bisbee, "A communications bandwidth model for shuffle-exchange and augmented shuffle-exchange interprocessor communication networks," Ph.D. dissertation, Auburn Univ., June 1986.
[16]
{16} K. Padmanabhan and D. H. Lawrie, "Performance analysis of redundant path networks for multiprocessor systems," ACM Trans. Comput. Syst., vol. 3, May 1985.
Index Terms
- Failure Dependent Bandwidth in Shuffle-Exchange Networks
Recommendations
On Self-Routing in Benes and Shuffle-Exchange Networks
The authors present self-routing algorithms for realizing the class of linear permutations in various multistage networks such as Benes and 2n-stage shuffle-exchange. Linear permutations are useful in providing fast access of data arrays. In the first ...
All-to-all personalized exchange in generalized shuffle-exchange networks
An all-to-all communication algorithm is said to be optimal if it has the smallest communication delay. Previous all-to-all personalized exchange algorithms are mainly for hypercube, mesh, and torus. In Yang and Wang (2000) [13], Yang and Wang proved ...
Dynamic dependability analysis of shuffle-exchange networks
AbstractDesigning dependable multiprocessor systems requires reliable interconnection networks. Multistage interconnection networks (MINs), including shuffle-exchange networks (SENs), are widely used to establish the desired connection. The failure of ...
Comments
Information & Contributors
Information
Published In
Copyright © Copyright © 1988 IEEE. All Rights Reserved.
Publisher
IEEE Computer Society
United States
Publication History
Published: 01 July 1988
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 29 Jul 2024