View in EDS PDF Full Text

Using SDRAM Memories for High-Performance Accesses to Two-Dimensional Matrices Without Transpose.

Saved in:
Bibliographic Details
Title: Using SDRAM Memories for High-Performance Accesses to Two-Dimensional Matrices Without Transpose.
Authors: Langemeyer, Stefan1 stefan.langemeyer@ims.uni-hannover.de, Pirsch, Peter1 pirsch@ims.uni-hannover.de, Blume, Holger1 blume@ims.uni-hannover.de
Source: International Journal of Parallel Programming. Apr2013, Vol. 41 Issue 2, p331-354. 24p. 16 Diagrams, 6 Charts, 8 Graphs.
Subjects: Digital filters (Mathematics), Matrices software, Dynamic random access memory, Data mapping, Fourier transforms, Synthetic aperture radar
Abstract: The data throughput of SDRAMs is significantly reduced by the control overhead required for access or transposition of large two-dimensional data matrices stored in SDRAM memories. In this paper, a new address mapping scheme is introduced, taking advantage of multiple banks and burst capabilities of modern SDRAMs. In this way, the data throughput is maximized when reading or writing rows or columns of a two-dimensional data matrix. Other address mapping strategies minimize the total number of SDRAM page-opens while traversing the two-dimensional index-space in row or column direction. In order to achieve a higher data throughput, the new approach uses an alternative bank interleaving method to hide additional wait cycles. In this way, the number of data bus wait cycles do not depend on the overall number of page-opens directly any more. It is shown, that the data bus utilization can be increased significantly. In particular, the new mapping strategy is optimized for access of parallel samples, distributed among a number of SDRAM chips. Therefore, double buffering can be omitted. As a special operation, 2D-FFT processing for radar applications is considered. Depending on SDRAM parameters and dimensions, a continuous bandwidth utilization of 96-98 % is achieved for accesses in both matrix dimensions, including all page-opens and refresh operations. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Parallel Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:The data throughput of SDRAMs is significantly reduced by the control overhead required for access or transposition of large two-dimensional data matrices stored in SDRAM memories. In this paper, a new address mapping scheme is introduced, taking advantage of multiple banks and burst capabilities of modern SDRAMs. In this way, the data throughput is maximized when reading or writing rows or columns of a two-dimensional data matrix. Other address mapping strategies minimize the total number of SDRAM page-opens while traversing the two-dimensional index-space in row or column direction. In order to achieve a higher data throughput, the new approach uses an alternative bank interleaving method to hide additional wait cycles. In this way, the number of data bus wait cycles do not depend on the overall number of page-opens directly any more. It is shown, that the data bus utilization can be increased significantly. In particular, the new mapping strategy is optimized for access of parallel samples, distributed among a number of SDRAM chips. Therefore, double buffering can be omitted. As a special operation, 2D-FFT processing for radar applications is considered. Depending on SDRAM parameters and dimensions, a continuous bandwidth utilization of 96-98 % is achieved for accesses in both matrix dimensions, including all page-opens and refresh operations. [ABSTRACT FROM AUTHOR]
ISSN:08857458
DOI:10.1007/s10766-012-0225-6