Access and Alignment of Data in an Array Processor

IEEE Transactions on Computers

Volumn C-24, Issue 12, 1975, Pages 1145-1155

  Lawrie, Duncan H ^a  

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

Author keywords

Alignment network; array processor; array storage; conflict free acess; data alignment; indexing network; omega network; parallel processing; permutation network; shuffle exchange network; storage mapping; switching network

Indexed keywords

COMPUTER OPERATING SYSTEMS;

EID: 0016624050     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1975.224157     Document Type: Article

References (25)

1. H. S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. Comput., vol. C-20, pp. 153-161, Feb. 1971.
2. K. E. Batcher, “STARAN parallel processor system hardware,” in 1974 Fall Joint Comput. Conf., AFIPS Conf. Proc., vol. 43.Montvale, N. J.: AFIPS Press, 1974, p. 405.
3. L. C. Higbie, “The OMEN computers: Associative array processors,” in Dig. Papers, Compcon, p. 287, 1972.
4. D. J. Kuck, “ILLIAC IV software and application programming,” IEEE Trans. Comput., vol. C-17, pp. 758-770, Aug. 1968.
5. P. W. Kraska, “Array storage allocation,” Dep. Comput. Sci.,Univ. Illinois, Urbana-Champaign, Rep. 344, 1969.
6. R. E. Millstein, “Control structures in Illiac IV Fortran,” Commun. Ass. Comput. Mach., vol. 16, pp. 621-627, Oct. 1973.
7. P. Budnik and D. J. Kuck, “The organization and use ofparallel memories,” IEEE Trans. Comput. (Short Notes), vol.C-20, pp. 1566-1569, Dec. 1971.
8. Y. Muraoka, “Parallelism exposure and exploitation In programs,” Ph.D. dissertation, Univ. Illinois, Urbana-Champaign, Dep. Comput. Sci., Rep. 424, Feb. 1971.
9. S.-C. Chen and D. J. Kuck, “Time and parallel processor bounds for linear recurrence systems,” IEEE Trans. Comput.,vol. C-24, pp. 701-717, July 1975.
10. V. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic, 1965.
11. D. C. Opferman and N. T. Tsao-Wu, “On a class of rearrangeable switching networks,” Bell Syst. Tech. J., vol. 50, pp. 1579-1618, May-June 1971.
12. K. E. Batcher, “Sorting networks and their applications,” in 1968 Spring Joint Comput. Conf., AFIPS Conf. Proc., vol. 32.Washington, D. C.: Thompson, 1968, pp. 307-314.
13. A. Waksman, “A permutation network,” J. Ass. Comput.Mach., vol. 15 pp. 159-163, Jan. 1968.
14. K. J. Thurber, “Programmable indexing networks,” in 1970 Spring Joint Comput. Conf., AFIPS Conf. Proc., vol. 36.Montvale, N. J.: AFIPS Press, 1970, pp. 51-58.
15. W. H. Kauntz, K. N. Levitt, and A. Waksman, “Cellular interconnection arrays,” IEEE Trans. Comput., vol. C-17, pp. 443-451, May 1968.
16. D. L. Rohrbacher, “Advanced computer organization study:Volume I-Basic report; Volume II-Appendices,” Air Force Contract AF 30(602)-3550, Apr. 1966, Papers AD 631870 andAD 631871.
17. D. H. Lawrie, “Memory-processor connection networks,” Univ.Illinois, Urbana-Champaign, Dep. Comput. Sci., Rep. 557,Feb. 1973.
18. S. W. Golomb, “Permutation by cutting and shuffling,” SIAMRev., vol. 3, p. 293, Oct. 1961.
19. M. C. Pease, “An adaption of the fast Fourier transform forparallel processing,” J. Ass. Comput. Mach., vol. 15, pp. 252-264,Apr. 1968
20. T. Lang, “Interconnection between processors and memoriesusing the shuffle-exchange network,” Stanford Univ., Stanford, Calif., Rep. R-74-19.
21. D. H. Lawrie, “More patterns for square blocks,” Dep. Comput.Sci., Univ. Illinois, Urbana-Champaign, unpublished memo65, July 1973.
22. D. H. Lawrie, “Omega networks,” Dep. Comput. Sci., Univ. Illinois, Urbana-Champaign, unpublished memo 64 Apr. 1973.
23. U. Schumann, “Ein Verfahren zum Transponieren grosser,sequentiell gespeicherter Matrizen,” Angew. Inform., pp. 213-216, May 1972.
24. J. O. Eklundh, “A fast computer method for matrix transposing,” IEEE Trans. Comput. (Corresp.), vol. C-21, pp. 801-803,July 1972.
25. D. E. Gold and D. J. Kuck, “A model for masking rotationallatency by dynamic disk allocation,” Commun. Ass. Comput.Mach., vol. 17, pp. 278-288, May 1974.