Data Reorganization and Prefetching of Pointer-Based Data Structures

摘要

Editor's note:The significant acceleration of code containing pointer-based data structures is beyond the reach of most high-level synthesis tools, yet a large amount of legacy scientific computing code contains these structures. This article presents a method to cope with such code within a reconfigurable computing context.—George A. Constantinides (Imperial College London) and Nicola Nicolici (McMaster University)