Rigel
John H. Kelm, Daniel R. Johnson, Matthew R. Johnson et al. · Proceedings - International Symposium on Computer Architecture/Proceedings · 2009
This paper considers Rigel, a programmable accelerator architecture for a broad class of data- and task-parallel computation. Rigel comprises 1000+ hierarchically-organized cores that use a fine-grained, dynamically scheduled single-program, multiple-data (SPMD) execution model. Rigel's low-level programming interface adopts a single global address space model where parallel work is expressed in a task-centric, bulk-synchronized manner using minimal hardware support. Compared to existing accelerators, which contain domain-specific hardware, specialized memories, and/or restrictive programming models, Rigel is more flexible and provides a straightforward target for a broader set of applications.
Cited by 149 works. doi:10.1145/1555754.1555774
Authors
- John H. Kelm
- Neal Clayton Crago
- William Tuohy
- Aqeel A. Mahesri
- Steven S. Lumetta
- Matthew I. Frank
- Sanjay Jeram Patel
References
- A Bridging Model for Parallel Computation
- A Survey of General‐Purpose Computation on Graphics Hardware
- Scans as primitive parallel operations
- Scalable parallel programming with CUDA
- Scalable Parallel Programming with CUDA
- NVIDIA Tesla: A Unified Graphics and Computing Architecture
- Algorithms for scalable synchronization on shared-memory multiprocessors
- Accelerating molecular modeling applications with graphics processors
- Larrabee
- The Network Architecture of the Connection Machine CM-5