Memory---CellSs
Pieter Bellens, J. M. PÉREZ, Rosa M. Badia et al. · 2006
In this work we present Cell superscalar (CellSs) which addresses the automatic exploitation of the functional parallelism of a sequential program through the different processing elements of the Cell BE architecture. The focus in on the simplicity and flexibility of the programming model. Based on a simple annotation of the source code, a source to source compiler generates the necessary code and a runtime library exploits the existing parallelism by building at runtime a task dependency graph. The runtime takes care of the task scheduling and data handling between the different processors of this heterogeneous architecture. Besides, a locality-aware task scheduling has been implemented to reduce the overhead of data transfers. The approach has been implemented and tested with a set of examples and the results obtained since now are promising.
Cited by 267 works. doi:10.1145/1188455.1188546
Authors
References
- Computer Architecture: A Quantitative Approach
- The design and implementation of a first-generation CELL processor
- Cg
- LU-GPU: Efficient Algorithms for Solving Dense Linear Systems on Graphics Hardware
- GPU Cluster for High Performance Computing
- Chip makers turn to multicore processors
- Dip: A parallel program development environment
- Using advanced compiler technology to exploit the performance of the Cell Broadband Engine™ architecture
- A fast static scheduling algorithm for DAGs on an unbounded number of processors
- Nanos mercurium: A research compiler for OpenMP