Heterogeneous systems are becoming increasingly popular, delivering high performance through hardware specialization. However, sequential data accesses may have a negative impact on performance. Data parallel solutions such as Polymorphic Register Files (PRFs) can potentially accelerate applications by facilitating high-speed, parallel access to performance-critical data. This article shows how PRFs can be integrated into dataflow computational platforms. Our semi-automatic, compiler-based methodology generates customized PRFs and modifies the computational kernels to efficiently exploit them. We use a separable 2D convolution case study to evaluate the impact of memory latency and bandwidth on performance compared to a state-of-the-art NVIDIA Tesla C2050 GPU. We improve the throughput up to 56.17X and show that the PRF-augmented system outperforms the GPU for 9×9 or larger mask sizes, even in bandwidth-constrained systems.
|Titolo:||The Case for Polymorphic Registers in Dataflow Computing|
|Data di pubblicazione:||2018|
|Appare nelle tipologie:||01.1 Articolo in Rivista|
File in questo prodotto:
|10.1007_s10766-017-0494-1.pdf||articolo||Publisher’s version||Accesso apertoVisualizza/Apri|
|Ciobanu2018_Article_TheCaseForPolymorphicRegisters.pdf||Version of Record||Publisher’s version||Accesso riservato|