|
Published Articles >> Table of Contents >> Abstract
April 2004 (Vol. 53, No. 4)
pp. 439-452
Multiaccess Memory System for Attached SIMD Computer
Jong Won Park, IEEE
Full Article Text:
   
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2004.1268401
Send link to a friend
| Abstract |
|
In order to reduce the memory access time for a Single-Instruction Multiple-Data stream (SIMD) computer with pq processing elements attached to a host computer, a multiaccess memory system is proposed in this paper. The proposed memory system supports simultaneous access to pq data elements within a 4-directional block (p × q), a row (1 × pq), a column (pq × 1), a forward-diagonal, and a backward-diagonal subarray with a constant interval in an arbitrary position in an M×N array of data elements, where the number of memory modules, m, is a prime number greater than pq. For the simple and fast address calculation and routing circuit, the address differences between the pq addresses and the base address are arranged in ascending order according to the index numbers of m memory modules from the index number of memory module of the first element. The proposed multiaccess memory system provides more subarray types and more constant intervals than the previous memory systems.
|
 References
|
[1] D.T. Harper III,“Block, multistride vector and FFT accesses in parallel memorysystems,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 43-51, 1991.
[2] D.T. Harper III, Increased Memory Performance during Vector Accesses through the Use of Linear Address Transformations IEEE Trans. Computers, vol. 41, no. 2, pp. 227-230, Feb. 1992.
[3] N.B. MacDonald, An Overview of SIMD Parallel System: AMT DAP, Thinking Machines CM-200, and MasPar MP-1 Proc. Workshop Parallel Computing, Apr. 1992.
[4] G. Ramanathan and J. Oren, Survey of Commercial Parallel Machines Technical Report TR-CS-93-70-4, Dept. of Computer Science, Oregon State Univ., Mar. 1993.
[5] W. Oed and O. Lange, On the Effective Bandwidth of Interleaved Memories in Vector Processing Systems IEEE Trans. Computers, vol. 34, no. 10, pp. 949-957, Oct. 1985.
[6] D. Baily, Vector Computer Memory Bank Contention IEEE Trans. Computers, vol. 36, no. 3, pp. 293-298, Mar. 1987.
[7] D.T. Harper III and J.R. Jump, Vector Access Performance in Parallel Memories Using a Skewed Storage Scheme IEEE Trans. Computers, vol. 36, no. 12, pp. 1440-1449, Dec. 1987.
[8] R. Raghavan and J.P. Hayes, "On Randomly Interleaved Memories," Proc. Supercomputing '90, pp. 49-58, Nov. 1990.
[9] K. Batcher, The Multidimensional Access Memory in STARAN IEEE Trans. Computers, vol. 26, no. 1, pp. 174-177, Jan. 1977.
[10] J. Frailong, W. Jalby, and J. Lenfant, XOR-Schemes: A Flexible Data Organization in Parallel Memories Proc. Int'l Conf. Parallel Processing, pp. 276-283, 1985.
[11] A. Norton and E. Melton, A Class of Boolean Linear Transformations for Conflict-Free Power-of-Two Stride Access Proc. Int'l Conf. Parallel Processing, pp. 247-254, 1987.
[12] D. Lee,“Scrambled storage for parallel memory systems,” Proc. 15th Int’l Conf. Computer Architecture, pp. 232-239, 1988.
[13] K. Kim and V.K.P. Kumar, Perfect Latin Squares and Parallel Array Access Proc. Int'l Symp. Computer Architecture, pp. 372-379, 1989.
[14] C.S. Raghavendra and R. Boppana, On Methods for Fast and Efficient Parallel Memory Access Proc. Int'l Conf. Parallel Processing, pp. 76-83, 1990.
[15] D.T. HarperIII, ”A Multiaccess Frame Buffer Architecture,” IEEE Trans. Computer, vol. 43, no. 5, pp. 618-622, May 1994.
[16] P. Budnik and D.J. Kuck, The Organization and Use of Parallel Memories IEEE Trans. Computers, vol. 20, no. 12, pp. 1566-1569, Dec. 1971.
[17] H. Shapiro, Theoretical Limitations on the Efficient Use of Parallel Memories IEEE Trans. Computers, vol. 27, no. 5, pp. 421-428, May 1978.
[18] H. Wijshoff and J. Van Leeuwen, The Structure of Periodic Storage Schemes for Parallel Memories IEEE Trans. Computers, vol. 34, no. 6, pp. 501-505, June 1985.
[19] H. Wijshoff and J. Van Leeuwen, On Linear Skewing Schemes and d-Ordered Vectors IEEE Trans. Computers, vol. 36, no. 2, pp. 233-239, Feb. 1987.
[20] D.H. Lawrie, Access and Alignment of Data in an Array Processor IEEE Trans. Computers, vol. 24, no. 12, pp. 1145-1155, Dec. 1975.
[21] D.C. Van Voorhis and T.H. Morrin, Memory Systems for Image Processing IEEE Trans. Computers, vol. 27, no. 2, pp. 113-125, Feb. 1978.
[22] D.H. Lawrie and C.R. Vora, The Prime Memory System for Array Access IEEE Trans. Computers, vol. 31, no. 5, pp. 435-442, May 1982.
[23] D.T. Harper III and D.A. Linebarger,“Conflict-free vector access using adynamic storage scheme,” IEEE Trans. Computers, vol. 40, no. 3, pp. 276-283, 1991.
[24] A. Deb, Multiskewing A Novel Technique for Optimal Parallel Memory Access IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 6, pp. 595-604, June 1996.
[25] J.W. Park, An Efficient Memory System for Image Processing IEEE Trans. Computers, vol. 35, no. 7, pp. 669-674, July 1986.
[26] J.W. Park and D.T. HarperIII, “Memory Architecture Support for the SIMD Construction of a Gaussian Pyramid,” IEEE Proc. Symp. Parallel and Distributed Processing, pp. 444-451, Dec. 1992.
[27] J.W. Park and D.T. HarperIII, “An Efficient Memory System for the SIMD Construction of a Gaussian Pyramid,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 8, pp. 855-860, Aug. 1996.
[28] J.W. Park, An Efficient Buffer Memory System for Subarray Access IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 3, pp. 316-335, Mar. 2001.
[29] H.E. Burdick, Digital Imaging. McGraw-Hill, 1997.
[30] K.A. Moon, H. Lee, H.J. Yoon, and J.W. Park, A Parallel Processing System for a High-Speed Printed Document Recognition MVA '96 IAPR Workshop Machine Vision Applications, pp. 518-521, Nov. 1996.
[31] H. Lee, K.A. Moon, and J.W. Park, Design of Parallel Processing System for Facial Image Retrieval Proc. Fourth Int'l Conf. Austrian Center for Parallel Computation (ACPC '99), pp. 592-593, Feb. 1999.
[32] H. Lee and J.W. Park, Parallel Processing System for Multi-Access Memory System Proc. World Multiconf. Systematics, Cybernetics, and Information, pp. 561-565, 2000.
|
 Additional Information
|
Index Terms- SIMD computer, prime memory system, multiaccess memory system, conflict-free memory system, address calculation, routing circuit.
Citation:
Jong Won Park,
"Multiaccess Memory System for Attached SIMD Computer,"
IEEE Transactions on Computers,
vol. 53,
no. 4,
pp. 439-452,
Apr.,
2004
|
|
RSS Feed