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

Ki-Yong Kim

dblp:21/4212 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

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

Systems, architecture and hardware · 1

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
High-performance computing · 67% Distributed systems · 33%

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

TopicWeightPapersLastEvidence papers
High-performance computing › collective communication
collective communication optimization
0.112005
Transformations to Parallel Codes for Communication-Computation Overlap · SC 2005
Distributed systems › communication optimization
communication-computation overlap
0.112005
Transformations to Parallel Codes for Communication-Computation Overlap · SC 2005
High-performance computing
scientific computing systems
0.112005
Transformations to Parallel Codes for Communication-Computation Overlap · SC 2005

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

RDMA · 0.1MPI collective operations · 0.1
YearPublicationVenuePosition
2005 Transformations to Parallel Codes for Communication-Computation Overlap
abstract
This paper presents program transformations directed toward improving communication-computation overlap in parallel programs that use MPI’s collective operations. Our transformations target a wide variety of applications focusing on scientific codes with computation loops that exhibit limited dependence among iterations. We include guidance for developers for transforming an application code in order to exploit the communicationcomputation overlap available in the underlying cluster, as well as a discussion of the performance improvements achieved by our transformations. We present results from a detailed study of the effect of the problem and message size, level of communication-computation overlap, and amount of communication aggregation on runtime performance in a cluster environment based on an RDMA-enabled network. The targets of our study are two scientific codes written by domain scientists, but the applicability of our work extends far beyond the scope of these two applications.
Anthony Danalis, Ki-Yong Kim, Lori L. Pollock, D. Martin Swany
SC2