Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel Gerzhoy

dblp:256/9221 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0002-4277-9994ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 75% GPUs and heterogeneous computing · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
GPUs and heterogeneous computing
CPU-GPU heterogeneous computing
0.412020
Nested MIMD-SIMD Parallelization for Heterogeneous Microprocessors · ACM Trans. Archit. Code Optim. 2020
Parallel and multicore computing › parallelization strategies
nested parallelism
0.412020
Nested MIMD-SIMD Parallelization for Heterogeneous Microprocessors · ACM Trans. Archit. Code Optim. 2020
Parallel and multicore computing › parallel programming models › directive-based programming
OpenMP
0.412020
Nested MIMD-SIMD Parallelization for Heterogeneous Microprocessors · ACM Trans. Archit. Code Optim. 2020
Parallel and multicore computing
parallel programming models
0.412020
Nested MIMD-SIMD Parallelization for Heterogeneous Microprocessors · ACM Trans. Archit. Code Optim. 2020

Methods — techniques the papers use, named apart from their topics

nested loop scheduling · 0.4MIMD-SIMD parallelization · 0.4
YearPublicationVenuePosition
2020 Nested MIMD-SIMD Parallelization for Heterogeneous Microprocessors
abstract
Heterogeneous microprocessors integrate a CPU and GPU on the same chip, providing fast CPU-GPU communication and enabling cores to compute on data “in place.” This permits exploiting a finer granularity of parallelism on the integrated GPUs, and enables the use of GPUs for accelerating more complex and irregular codes. One challenge, however, is exposing enough parallelism such that both the CPU and GPU are effectively utilized to achieve maximum gain. In this article, we propose exploiting nested parallelism for integrated CPU-GPU chips. We look for loop structures in which one or more regular data parallel loops are nested within a parallel outer loop that can contain irregular code (e.g., with control divergence). By scheduling the outer loop on multiple CPU cores, multiple dynamic instances of the inner regular loop(s) can be scheduled on the GPU cores. This boosts GPU utilization and parallelizes the outer loop. We find that such nested MIMD-SIMD parallelization provides greater levels of parallelism for integrated CPU-GPU chips, and additionally there is ample opportunity to perform such parallelization in OpenMP programs. Our results show nested MIMD-SIMD parallelization provides a 16.1x and 8.67x speedup over sequential execution on a simulator and a physical machine, respectively. Our technique beats CPU-only parallelization by 4.13x and 2.40x, respectively, and GPU-only parallelization by 2.74x and 2.26x, respectively. Compared to the next-best scheme (either CPU- or GPU-only parallelization) per benchmark, our approach provides a 1.46x and 1.23x speedup for the simulator and physical machine, respectively.
Daniel Gerzhoy, Xiaowu Sun, Michael Zuzak, Donald Yeung
ACM Trans. Archit. Code Optim.1