Demo Data from EDBT 2026 / reviewers in the wild / expert
Okwan Kwon
dblp:20/10955
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none
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 · 87% High-performance computing · 13% | |
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization › parallelization
automatic parallelization |
0.1 | 1 | 2012 | A hybrid approach of OpenMP for clusters · PPoPP 2012 |
Parallel and multicore computing › parallel programming models › directive-based programming
OpenMP |
0.1 | 1 | 2012 | A hybrid approach of OpenMP for clusters · PPoPP 2012 |
Parallel and multicore computing
parallel programming models |
0.1 | 1 | 2012 | A hybrid approach of OpenMP for clusters · PPoPP 2012 |
High-performance computing
cluster computing |
0.0 | 1 | 2012 | A hybrid approach of OpenMP for clusters · PPoPP 2012 |
Methods — techniques the papers use, named apart from their topics
runtime data flow analysis · 0.3data affinity optimization · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | A hybrid approach of OpenMP for clustersabstractWe present the first fully automated compiler-runtime system that successfully translates and executes OpenMP shared-address-space programs on laboratory-size clusters, for the complete set of regular, repetitive applications in the NAS Parallel Benchmarks. We introduce a hybrid compiler-runtime translation scheme. Compared to previous work, this scheme features a new runtime data flow analysis and new compiler techniques for improving data affinity and reducing communication costs. We present and discuss the performance of our translated programs, and compare them with the performance of the MPI, HPF and UPC versions of the benchmarks. The results show that our translated programs achieve 75% of the hand-coded MPI programs, on average. Okwan Kwon, Fahed Jubair, Rudolf Eigenmann, Samuel P. Midkiff |
PPoPP | 1 |