Memory Organization with Multi-Pattern Parallel Accesses

We propose an interleaved memory organization supporting multi-pattern parallel accesses in twodimensional (2D) addressing space. Our proposal targets computing systems with high memory bandwidth demands such as vector processors, multimedia accelerators, etc. We substantially extend prior research on interleaved memory organizations introducing 2D-strided accesses along with additional parameters, which define a large variety of 2D data patterns. The proposed scheme guarantees minimum memory latency and efficient bandwidth utilization for arbitrary configuration parameters of the data pattern. We provide mathematical descriptions and proofs of correctness for the proposed addressing schemes. The design complexity and the critical paths are evaluated using technology independent resource counts and confirm the scalability of the proposal. Hardware synthesis results for 90nm CMOS technology suggest that throughputs in the range between 44 and 1182 Gbit/s can be obtained at the cost of ...

• Type: Conference
• Year: 2008
• Where: DATE
• Authors: Arseni Vitkovski, Georgi Kuzmanov, Georgi Gaydadjiev
• Keywords: DATE 2008, Guarantees Minimum Memory, Hardware, Interleaved Memory Organizations, Memory Bandwidth Demands