This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Latin Squares for Parallel Array Access
April 1993 (vol. 4 no. 4)
pp. 361-370

A parallel memory system for efficient parallel array access using perfect latin squares asskewing functions is discussed. Simple construction methods for building perfect latinsquares are presented. The resulting skewing scheme provides conflict free access toseveral important subsets of an array. The address generation can be performed inconstant time with simple circuitry. The skewing scheme can provide constant timeaccess to rows, columns, diagonals, and N/sup 1/2/*N/sup 1/2/ subarrays of an N*Narray with maximum memory utilization. Self-routing Benes networks can be used torealize the permutations needed between the processing elements and the memorymodules. Two skewing schemes that provide conflict free access to three-dimensionalarrays are also discussed. Combined with self-routing Benes networks, these schemesprovide efficient access to frequently used subsets of three-dimensional arrays.

[1] M. Balakrishnan, R. Jain, and C. S. Raghavendra, "On array storage for conflict-free memory access for parallel processors," inProc. Int. Conf. Parallel Processing, vol. 1, 1988, pp. 103-107.
[2] K. E. Batcher, "The multidimensional access memory in STRAN,"IEEE Trans. Comput., vol. C-26, pp. 174-177, 1977.
[3] V. E. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic, 1965.
[4] R. Boppana and C. S. Raghavendra, "On self routine in Benes and shuffle exchange networks," inProc. Int. Conf. Parallel Processing, vol. 1, 1988, pp. 196-200.
[5] R. Boppana and C. S. Raghavendra, "Self-routing schemes in parallel memory access," manuscript, Dep. EE-Systems, Univ. Southern California, Nov. 1989.
[6] P. Budnik and D. J. Kuck, "The organization and use of parallel memories,"IEEE Trans. Comput., vol. C-20, pp. 1566-1569, 1971.
[7] A. Deb, "Conflict-free access of arrays--A counter example,"Inform. Processing Lett., vol. 10, no. 1, pp. 20, 1980.
[8] A. Deb, "Multiskewing--A novel technique for optimal parallel memory access," Tech. Rep. 9004, Dep. Comput. Sci., Memorial Univ. of Newfoundland, 1990.
[9] T. A. Defanti, M. D. Brown, and B. H. McCormick, "Visualization: Expanding scientific and engineering research opportunities,"IEEE Comput. Mag., pp. 12-25, Aug. 1989.
[10] J. Denes and A. D. Keedwell,Latin Squares and Their Applications. New York: Academic, 1974.
[11] J. M. Frailong, W. Jalby, and J. Lenfant, "XOR-schemes: A flexible data organization in parallel memories," inProc. Int. Conf. Parallel Processing, 1985, pp. 276-283.
[12] E. Gergely, "A simple method for constructing doubly diagonalized latin squares,"J. Combinatorial Theory, A 16, pp. 266-272, 1974.
[13] D. T. Harper III and D. Linebarger, "A dynamic storage scheme for conflict-free vector access," inProc. Int. Symp. Comput. Architecture, 1989.
[14] F. K. Hwang, "Crisscross latin squares,"J. Combinatorial Theory, A 27, pp. 371-375, 1979.
[15] K. Heinrich, K. Kim, and V. K. Prasanna Kumar, "Perfect latin squares,"Discrete Appl. Math., 37/38, pp. 281-286, 1992.
[16] K. Kim and V. K. Kumar, "Perfect Latin square and parallel array access," inProc. 16th Annu. Int. Symp. Comput. Architecture, May 1989, pp. 372-379.
[17] D. J. Kuck, "ILLIAC IV software and application programming,"IEEE Trans. Comput., vol. C-17, pp. 758-770, 1968.
[18] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, 1975.
[19] D. H. Lawrie and C. R. Vora, "The prime memory system for array access,"IEEE Trans. Comput., vol. C-31, pp. 435-442, 1982.
[20] D. Lee, "Scrambled storage for parallel memory systems," inProc. 15th Ann. Int. Symp. Computer Arch., May 1988.
[21] J. Lenfant, "Parallel permutations of data: A Benes network control algorithm for frequently used permutations,"IEEE Trans. Comput., vol. C-27, pp. 637-647, 1978.
[22] M. B. Long, K. Lyons, and J. K. Lam, "Acquisition and representation of 2D and 3D data from turbulent flows and flames,"IEEE Comput. Mag., pp. 39-45, Aug. 1989.
[23] O. Monga and R. Deriche, "3-D edge detection using recursive filtering. Application to scanner images," inIEEE Comput. Soc. Conf. Vision and Pattern Recognit., San Diego, CA, June 1989.
[24] D. Nassimi and S. Sahni, "A self-routing Benes network and parallel permutation algorithms,"IEEE Trans. Comput., vol. C-30, pp. 332-340, 1981.
[25] C. S. Raghavendra and R. Boppana, "On methods for fast and efficient parallel memory access," inProc. Int. Conf. Parallel Processing, vol. 1, 1990, pp. 76-83.
[26] S. J. Riederer, "Recent advances in magnetic resonance imaging,"Proc. IEEE, pp. 1095-1105, Sept. 1988.
[27] H. D. Shapiro, "Theoretical limitations on the efficient use of parallel memories,"IEEE Trans. Comput., vol. C-27, pp. 421-428, 1978.
[28] H. Shirakawa and T. Kumagai, "An organization of a three-dimensional access memory," inProc. Int. Conf. Parallel Processing, 1980, pp. 137-138.
[29] D. C. V. Voorhis and T. H. Morrin, "Memory systems for image processing,"IEEE Trans. Comput., vol. C-27, pp. 113-125, 1978.
[30] H. Wijshoff and J. van Leeuwen, "On linear skewing schemes andd-ordered vectors,"IEEE Trans. Comput., vol. C-36, no. 2, pp. 233-239, Feb. 1987.

Index Terms:
Index Termsparallel array access; parallel memory system; perfect latin squares; skewing functions;conflict free access; skewing scheme; self-routing Benes networks; multiprocessorinterconnection networks; shared memory systems; storage management
Citation:
K. Kim, V.K. Prasanna, "Latin Squares for Parallel Array Access," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 4, pp. 361-370, April 1993, doi:10.1109/71.219753
Usage of this product signifies your acceptance of the Terms of Use.