This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Failure Dependent Bandwidth in Shuffle-Exchange Networks
July 1988 (vol. 37 no. 7)
pp. 853-858
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 wi

[1] D.H. Lawrie, "Access and alignment of data on an array processor,"IEEE Trans. Comput., vol. C-25, Dec. 1976.
[2] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C-20, Feb. 1971.
[3] D. S. Parker, Jr., "Notes on shuffle/exchange type switching networks,"IEEE Trans. Comput., vol. C-29, Mar. 1980.
[4] K. Y. Wen and D. H. Lawrie, "Effectiveness of some processor/ memory interconnections," presented at Int. Conf. Parallel Processing, 1976.
[5] C. I. Wu and T. Y. Feng, "The reverse exchange interconnection network,"IEEE Trans. Comput., vol. C-29, Sept. 1980.
[6] M. C. Pease, "The indirect binaryN-cube microprocessor array,"IEEE Trans. Comput., vol. C-26, May 1977.
[7] J. Lenfant, "Parallel permutations of data: A Benes network control algorithm for frequently used permutations,"IEEE Trans. Comput., vol. C-27, 1978.
[8] J. P. Shen and J. P. Hayes, "Fault tolerance of a class of connecting networks," inProc. 7th Annu. Symp. Comput. Architecture, 1980, pp. 61-71.
[9] Adams and Siegel, "Extra stage cube: A fault tolerant network for supercomputers,"IEEE Trans. Comput., vol. C-31, May 1982.
[10] S. Thanawastien, "The SE-plus network," submitted toACM Southeastern Regional Conf., 1982.
[11] J. H. Patel, "Performance of processor-memory interconnections for multiprocessors,"IEEE Trans. Comput., vol. C-30, Oct. 1981.
[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] F. S. Baskett and A. J. Smith, "Interference in multiprocessor computer systems with interleaved memory,"Commun. ACM, vol. 19, pp. 327-334, Jun. 1976.
[14] D. P. Bhandarkar, "Analysis of memory interference in multiprocessors,"IEEE Trans. Comput., vol. C-24, Sept. 1975.
[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] K. Padmanabhan and D. H. Lawrie, "Performance analysis of redundantpath networks for multiprocessor systems,"ACM Trans. Comput. Syst., vol. 3, no. 2, pp. 117-144, May 1985.

Index Terms:
failure dependent bandwidth; shuffle-exchange networks; augmented shuffle-exchange; interconnection networks; address model; binary switches; probability of failures; network design parameter; reliability enhancement; fault tolerant computing; parallel processing.
Citation:
C.R. Bisbee, V.P. Nelson, "Failure Dependent Bandwidth in Shuffle-Exchange Networks," IEEE Transactions on Computers, vol. 37, no. 7, pp. 853-858, July 1988, doi:10.1109/12.2231
Usage of this product signifies your acceptance of the Terms of Use.