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

Rolf vande Vaart

dblp:116/7964 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1999
—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 · 62% Parallel and multicore computing · 38%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel programming models
message passing
0.011999
Optimization of MPI Collectives on Clusters of Large-Scale SMP's · SC 1999
High-performance computing › collective communication
MPI collective communication
0.011999
Optimization of MPI Collectives on Clusters of Large-Scale SMP's · SC 1999
High-performance computing › collective communication
collective communication optimization
0.011999
Optimization of MPI Collectives on Clusters of Large-Scale SMP's · SC 1999
High-performance computing › cluster computing
SMP cluster
0.011999
Optimization of MPI Collectives on Clusters of Large-Scale SMP's · SC 1999

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

performance modeling · 0.0MPI · 0.0
YearPublicationVenuePosition
1999 Optimization of MPI Collectives on Clusters of Large-Scale SMP's
abstract
Implementors of message-passing libraries have focused on optimizing point-to-point protocols and have largely ignored the performance of collective operations. In addition, algorithms for collectives have been tuned to run well on networks of uni-processor machines, ignoring the performance that may be gained on large-scale SMP’s in wide-spread use as compute nodes. This is unfortunate, because the high backplane bandwidths and shared-memory capabilities of large SMP’s are a perfect match for the requirements of collectives. We present new algorithms for MPI collective operations that take advantage of the capabilities of fat-node SMP’s and provide models that show the characteristics of the old and new algorithms. Using the SunTM MPI library, we present results on a 64-way StarfireTM SMP and a 4-node cluster of 8-way Sun EnterpriseTM 4000 nodes that show performance improvements ranging typically from 2x to 5x for the collectives we studied.
Steve Sistare, Rolf vande Vaart, Eugene Loh
SC2