Towards automatic program partitioning

There is a trend towards using accelerators to increase performance and energy efficiency of general-purpose processors. Adoption of accelerators, however, depends on the availability of tools to facilitate programming these devices. In this paper, we present techniques for automatically partitioning programs for execution on accelerators. We call the off-loaded code regions sub-algorithms, which are parts of the program that are loosely connected to the remainder of the program. We present three heuristics for automatically identifying sub-algorithms based on control flow and data flow properties. Analysis of SPECint and MiBench benchmarks shows that on average 12 sub-algorithms are identified (up to 54), covering the full execution time for 27 out of 30 benchmarks. We show that these sub-algorithms are suitable for off-loading them to accelerators by manually implementing sub-algorithms for 2 SPECint benchmarks on the Cell processor. Categories and Subject Descriptors D.3.3 [Pr...

• Type: Conference
• Year: 2009
• Where: CF
• Authors: Sean Rul, Hans Vandierendonck, Koen De Bosschere
• Keywords: Applied Computing, Average 12 Sub-algorithms, CF 2009, Code Regions Sub-algorithms, General-purpose Processors