Scalable Programming Models for Massively Multicore Processors
Michael D. McCool · Proceedings of the IEEE · 2008
Including multiple cores on a single chip has become the dominant mechanism for scaling processor performance. Exponential growth in the number of cores on a single processor is expected to lead in a short time to mainstream computers with hundreds of cores. Scalable implementations of parallel algorithms will be necessary in order to achieve improved single-application performance on such processors. In addition, memory access will continue to be an important limiting factor on achieving performance, and heterogeneous systems may make use of cores with varying capabilities and performance characteristics. An appropriate programming model can address scalability and can expose data locality while making it possible to migrate application code between processors with different parallel architectures and variable numbers and kinds of cores. We survey and evaluate a range of multicore processor architectures and programming models with a focus on GPUs and the Cell BE processor. These processors have a large number of cores and are available to consumers today, but the scalable programming models developed for them are also applicable to current and future multicore CPUs.
Cited by 70 works. doi:10.1109/jproc.2008.917731
Authors
References
- Communicating Sequential Processes
- Communicating sequential processes
- A programming language
- Communicating sequential processes
- A Bridging Model for Parallel Computation
- Some Computer Organizations and Their Effectiveness
- A Survey of General‐Purpose Computation on Graphics Hardware
- Brook for GPUs
- The Landscape of Parallel Computing Research: A View from Berkeley
- Simultaneous multithreading