|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Jong Won Park, "An Efficient Buffer Memory System for Subarray Access," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 3, pp. 316-335, March, 2001. | |||
| BibTex | x | ||
| @article{ 10.1109/71.914779, author = {Jong Won Park}, title = {An Efficient Buffer Memory System for Subarray Access}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {3}, issn = {1045-9219}, year = {2001}, pages = {316-335}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.914779}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Parallel and Distributed Systems TI - An Efficient Buffer Memory System for Subarray Access IS - 3 SN - 1045-9219 SP316 EP335 EPD - 316-335 A1 - Jong Won Park, PY - 2001 KW - High-resolution graphical display KW - image processing KW - buffer memory system KW - block access KW - address calculation KW - address routing KW - memory module selection. VL - 12 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
Abstract—Many current graphical display systems utilize a buffer memory system to contain a two-dimensional image array to be modified and displayed. In order to speed up the update of the buffer memory system, it is required that the buffer memory system accesses many image points within an image subarray in parallel. This paper proposes an efficient buffer memory system for a fast and high-resolution graphical display system. The memory system provides parallel accesses to
[1] R.F. Sproull, I.E. Sutherland, A. Thompson, S. Gupta, and C. Minter, “The 8 by 8 Display,” ACM Trans. Graphics, vol. 2, pp. 32-56, Jan. 1983.
[2] R.F. Sproull, “Frame-Buffer Display Architectures,” Ann. Rev., Computer Science, vol. 1, pp. 19-46, 1986.
[3] P. Budnik and D.J. Kuck, “The Organization and Use of Parallel Memories,” IEEE Trans. Computer, vol. 20, no. 12, pp. 1566-1569, Dec. 1971.
[4] D.H. Lawrie, “Access and Alignment of Data in an Array Processor,” IEEE Trans. Computer, vol. 24, no. 12, pp. 1145-1155, Dec. 1975.
[5] D.C. van Voorhis and T.H. Morrin, “Memory System for Image Processing,” IEEE Trans. Computer, vol. 27, no. 2, pp. 113-125, Feb. 1978.
[6] D.H. Lawrie and C.R. Vora, “The Prime Memory System for Array Access,“ IEEE Trans. Computer, vol. 31, no. 5, pp. 435-442, May 1982.
[7] J.W. Park, "An Efficient Memory System for Image Processing," IEEE Trans. Computers, vol. 35, pp. 669-674, July 1986.
[8] D.T. HarperIII, ”A Multiaccess Frame Buffer Architecture,” IEEE Trans. Computer, vol. 43, no. 5, pp. 618-622, May 1994.
[9] 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.
[10] D.S. Whelan, “A Rectangular Area Filling Display System Architecture,” Computer Graphics, vol. 16, pp. 147-153, July 1982.
[11] 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.
[12] 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.

