Notes on Shuffle/Exchange-Type Switching Networks

IEEE Transactions on Computers

Volumn C-29, Issue 3, 1980, Pages 213-222

  Parker, D Stott ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

3 stage rearrangeable switching network; Fast Fourier transform (FFT) algorithm; indirect binary n cube; interconnection switches; network universality; Omega network; Shuffle Exchange

Indexed keywords

COMPUTER ARCHITECTURE;

EID: 0018995782     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1980.1675553     Document Type: Article

References (18)

1. K. E. Batcher, “Sorting networks and their applications,” in Proc. AFIPS SJCC, vol. 32, pp. 307-314, 1968.
2. V. E. Beneš, Mathematical Theory of Connecting Networks and Tele-phone Traffic. New York: Academic Press, 1965.
3. W. T. Cochran et al., “What is the fast Fourier transform?” Proc. IEEE, vol. 55, pp. 1664–1674, Oct. 1967.
4. D. D. Gajski, “Processor arrays for computing linear recurrence systems,” presented at Int. Conf. on Parallel Processing, Aug. 23–25, 1978.
5. T. Lang, “Interconnections between processors and memory modules using the shuffle-exchange network,” IEEE Trans. Comput., vol. C-25, pp. 496–503, May 1976.
6. T. Lang and H. S. Stone, “A shuffle-exchange network with simplified control,” IEEE Trans. Comput., vol. C-25, pp. 55–65, Jan. 1976.
7. D. H. Lawrie, “Access and alignment of data in an array processor,” IEEE Trans. Comput., vol. C-25, pp. 1145–1155, Dec. 1976.
8. D. C. Opferman and N. T. Tsao-Wu, “On a class of rearrangeable switching networks—Parts I and II,” Bell Syst. Tech. J., vol. 50, pp. 1579–1618, May-June 1971.
9. M. C. Pease, “An adaptation of the fast Fourier transform for parallel processing,” J. Assoc. Comput. Mach., vol. 15, pp. 252–264, Apr. 1968.
10. “Organization of large scale Fourier processors.” J. Assoc. Comput. Mach., vol. 16, pp. 474–482, July 1969.
11. “The indirect binary n-cube microprocessor array,” IEEE Trans. Comput., vol. C-26, pp. 458–473, May 1977.
12. R. J. Polge et al., “Fast computational algorithms for bit reversal,” IEEE Trans. Comput., vol. C-23, pp. 1–9, Jan. 1974.
13. H. J. Siegel, “Analysis techniques for SIMD machine interconnection networks and the effects of processor address masks,” IEEE Trans. Comput., vol. C-26, pp. 153–161, Feb. 1977.
14. “The universality of various types of SIMD machine interconnection networks,” in Proc. 4th Ann. Symp. Computer Architecture, Mar. 23-25, 1977.
15. H. S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. Comput., vol. C-20, 153–161, Feb. 1971.
16. C. D. Thompson, “Generalized connection networks for parallel processor intercommunication,” IEEE Trans. Comput., vol. C-27, pp. 1119–1125, Dec. 1978.
17. K.-Y. Wen, “Interprocessor connections—Capabilities exploitation and effectiveness,” Rep. UIUCDCS-R-76-830, Univ. of Illinois at Urbana/Champaign, Oct. 1976.
18. C. K. Wong and D. Coppersmith, “The generation of permutations in magnetic bubble memories,” IEEE Trans. Comput., vol. C-25, pp. 254–262, Mar. 1976.