- Abstract:
-
Auto-parallelizing compilers for embedded applications have been unsuccessful due to the widespread use of pointer arithmetic and the complex memory model of multiple-address space digital signal processors (DSPs). This work develops, for the first time, a complete auto-parallelization approach, which overcomes these issues. It first combines a pointer conversion technique with a new modulo elimination transformation for program recovery enabling later parallelization stages. Next, it integrates a novel data transformation technique that exposes the processor location of partitioned data. When this is combined with a new address resolution mechanism, it generates efficient programs that run on multiple address spaces without using message passing. Furthermore, as DSPs do not possess any data cache structure, an optimization is presented which transforms the program to both exploit remote data locality and local memory bandwidth. This parallelization approach is applied to the DSPstone and UTDSP benchmark suites, giving an average speedup of 3.78 on four analog devices TigerSHARC TS-101 processors.
- Links To Paper
- 1st Link
- Bibtex format
- @Article{EDI-INF-RR-0545,
- author = {
Bjoern Franke
and Michael O'Boyle
},
- title = {A Complete Compiler Approach to Auto-Parallelizing C Programs for Multi-DSP Systems},
- journal = {IEEE Transactions on Parallel and Distributed Systems (TPDS)},
- year = 2005,
- month = {Mar},
- volume = {16(3)},
- pages = {234-245},
- doi = {10.1109/TPDS.2005.26},
- url = {http://ieeexplore.ieee.org/iel5/71/30206/01388213.pdf?tp=&arnumber=1388213&isnumber=30206},
- }
|
