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

Otto Sievert

dblp:36/1557 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2003
—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 · 61% Distributed systems · 30% Processor architecture and microarchitecture · 9%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel computing
parallel application performance
0.012003
Policies for Swapping MPI Processes · HPDC 2003
Distributed systems › distributed system architecture › distributed operating systems
process migration
0.012003
Policies for Swapping MPI Processes · HPDC 2003
Processor architecture and microarchitecture
resource contention
0.012003
Policies for Swapping MPI Processes · HPDC 2003

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

MPI · 0.0
YearPublicationVenuePosition
2003 Policies for Swapping MPI Processes
abstract
Despite the enormous amount of research and development work in the area of parallel computing, it is a common observation that simultaneous performance and ease-of-use are elusive. We believe that ease-of-use is critical for many end users, and thus seek performance enhancing techniques that can be easily retrofitted to existing parallel applications. In a precious paper we have presented MPI (message passing interface) process swapping, a simple add-on to the MPI programming environment that can improve performance in shared computing environments. MPI process swapping requires as few as three lines of source code change to an existing application. In this paper we explore a question that we had left open in our previous work: based on which policies should processes be swapped for best performance? Our results show that, with adequate swapping policies, MPI process swapping can provide substantial performance benefits with very limited implementation effort.
Otto Sievert, Henri Casanova
HPDC1