The Community for Technology Leaders
Green Image
Issue No. 01 - January (2011 vol. 22)
ISSN: 1045-9219
pp: 7-21
Bernhard Scholz , The University of Sydney, Sydney
Bernd Burgstaller , Yonsei University, Seoul
Raymes Khoury , The University of Sydney, Sydney
Matrix languages, including MATLAB and Octave, are established standards for applications in science and engineering. They provide interactive programming environments that are easy to use due to their script languages with matrix data types. Current implementations of matrix languages do not fully utilize high-performance, special-purpose chip architectures, such as the IBM PowerXCell processor (Cell). We present a new framework that extends Octave to harvest the computational power of the Cell. With this framework, the programmer is alleviated of the burden of introducing explicit notions of parallelism. Instead, the programmer uses a new matrix data type to execute matrix operations in parallel on the synergistic processing elements (SPEs) of the Cell. We employ lazy evaluation semantics for our new matrix data type to obtain execution traces of matrix operations. Traces are converted to data dependence graphs; operations in the data dependence graph are lowered (split into submatrices), scheduled and executed on the SPEs. Thereby, we exploit 1) data parallelism, 2) instruction level parallelism, 3) pipeline parallelism, and 4) task parallelism of matrix language programs. We conducted extensive experiments to show the validity of our approach. Our Cell-based implementation achieves speedups of up to a factor of 12 over code run on recent Intel Core2 Quad processors.
Programming languages, lazy evaluation, scheduling, data partitioning, math script languages, Cell Broadband Engine architecture.
Bernhard Scholz, Bernd Burgstaller, Raymes Khoury, "Accelerating the Execution of Matrix Languages on the Cell Broadband Engine Architecture", IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 7-21, January 2011, doi:10.1109/TPDS.2010.58
101 ms
(Ver 3.1 (10032016))