Using reconfigurable logic to optimise GPU memory accesses

Authors:
Ben Cope;Peter Y. K. Cheung;Wayne Luk
Affiliations:
Imperial College London;Imperial College London;Imperial College London
Venue:
Proceedings of the conference on Design, automation and test in Europe
Year:
2008

Citing 4
Cited 1

Understanding the efficiency of GPU algorithms for matrix-matrix multiplication

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Shader Performance Analysis on a Modern GPU Architecture

Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture
The design space of data-parallel memory systems

Proceedings of the 2006 ACM/IEEE conference on Supercomputing
A memory model for scientific algorithms on graphics processors

Proceedings of the 2006 ACM/IEEE conference on Supercomputing

A systematic design space exploration approach to customising multi-processor architectures: exemplified using graphics processors

Transactions on High-Performance Embedded Architectures and Compilers IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

Memory access patterns common in video processing algorithms, which are unsuited to the GPU (Graphics Processing Unit) memory system, are identified. We develop REDA (Reconfigurable Engine for Data Access) to improve GPU performance for such access patterns, by employing reconfigurable logic for address mapping. It is shown that a sixty times reduction in number of video memory accesses can be achieved for previously unsuited access patterns, with no detriment to well suited patterns. Surprisingly, memory access locality is also improved.