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

Robert A. Fiedler

dblp:116/9252 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1997
—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% High-performance computing · 39%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel programming models
0.011997
Optimization and Scaling of Shared-Memory and Message-Passing Implementations of the Zeus Hydrodynamics Algorithm · SC 1997
Parallel and multicore computing › parallel programming models › hybrid programming models
shared memory and message passing
0.011997
Optimization and Scaling of Shared-Memory and Message-Passing Implementations of the Zeus Hydrodynamics Algorithm · SC 1997
High-performance computing
scientific computing systems
0.011997
Optimization and Scaling of Shared-Memory and Message-Passing Implementations of the Zeus Hydrodynamics Algorithm · SC 1997

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

performance modeling · 0.0non-blocking communication · 0.0
YearPublicationVenuePosition
1997 Optimization and Scaling of Shared-Memory and Message-Passing Implementations of the Zeus Hydrodynamics Algorithm
abstract
We compare the performance of shared-memory and message-passing versions of the ZEUS algorithm for astrophysical fluid dynamics on a 64-processor HP/Convex Exemplar SPP-2000. Single-processor optimization is guided by timing several versions of simple loops whose structure typifies the main performance bottlenecks. Overhead is minimized in the message-passing implementation through the use of non-blocking communication operations. Our benchmark results agree reasonably well with the predictions of a simple performance model. The message-passing version of ZEUS scales better than the shared-memory one primarily because, under shared-memory, (unless data-layout directives are utilized) the domain decomposition is effectively one-dimensional.
Robert A. Fiedler
SC1