Can GPGPU Programming Be Liberated from the Data-Parallel Bottleneck?

With the growth in transistor counts in modern hardware, heterogeneous systems are becoming commonplace. Core counts are increasing such that GPU and CPU designs are reaching deep into the tens of cores. For performance reasons, different cores in a heterogeneous platform follow different design cho...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer (Long Beach, Calif.) Ročník 45; číslo 8; s. 42 - 52
Hlavní autoři: Gaster, Benedict R., Howes, Lee
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.08.2012
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Bottlenecks
braided parallelism
Braiding
Circuits
Computer graphics
Computer programming
Computer simulation
data-parallel execution
distributed arrays
Flexibility
GPGPU programming
Graphics processing unit
Hardware
heterogeneous parallel primitives
Indexes
massively threaded computing systems
Mathematical models
Multithreading
Parellel processing
Performance evaluation
persistent threading
Programming
ISSN:0018-9162, 1558-0814
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:With the growth in transistor counts in modern hardware, heterogeneous systems are becoming commonplace. Core counts are increasing such that GPU and CPU designs are reaching deep into the tens of cores. For performance reasons, different cores in a heterogeneous platform follow different design choices. Based on throughput computing goals, GPU cores tend to support wide vectors and substantial register files. Current designs optimize CPU cores for latency, dedicating logic to caches and out-of-order dependence control. Heterogeneous parallel primitives (HPP) addresses two major shortcomings in current GPGPU programming models: it supports full composability by defining abstractions and increases flexibility in execution by introducing braided parallelism. Heterogeneous parallel primitives is an object-oriented, C++11-based programming model that addresses these shortcomings on both CPUs and massively multithreaded GPUs: it supports full composability by defining abstractions using distributed arrays and barrier objects, and it increases flexibility in execution by introducing braided parallelism. This paper implemented a feature-complete version of HPP, including all syntactic constructs, that runs on top of a task-parallel runtime executing on the CPU. They continue to develop and improve the model, including reducing overhead due to channel management, and plan to make a public version available sometime in the future.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9162
1558-0814
DOI:10.1109/MC.2012.257