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.

Michael L. Welcome

dblp:83/2539 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

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

Systems, architecture and hardware · 2

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
2 papers
High-performance computing · 53% Parallel and multicore computing · 44% Distributed systems · 4%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel programming models
0.122006
Poster reception - Optimized collectives for PGAS languages with one-sided communication · SC 2006
Tera-Scalable Algorithms for Variable-Density Elliptic Hydrodynamics with Spectral Accuracy · SC 2005
High-performance computing
collective communication
0.112006
Poster reception - Optimized collectives for PGAS languages with one-sided communication · SC 2006
Parallel and multicore computing › parallel programming models › distributed memory programming models
partitioned global address space
0.112006
Poster reception - Optimized collectives for PGAS languages with one-sided communication · SC 2006
High-performance computing › scientific computing systems
computational fluid dynamics
0.112005
Tera-Scalable Algorithms for Variable-Density Elliptic Hydrodynamics with Spectral Accuracy · SC 2005
Parallel and multicore computing
parallelization strategies
0.112005
Tera-Scalable Algorithms for Variable-Density Elliptic Hydrodynamics with Spectral Accuracy · SC 2005
High-performance computing › performance optimization at scale
parallel scalability
0.112005
Tera-Scalable Algorithms for Variable-Density Elliptic Hydrodynamics with Spectral Accuracy · SC 2005
High-performance computing
performance optimization at scale
0.112005
Tera-Scalable Algorithms for Variable-Density Elliptic Hydrodynamics with Spectral Accuracy · SC 2005
High-performance computing
scientific computing systems
0.112005
Tera-Scalable Algorithms for Variable-Density Elliptic Hydrodynamics with Spectral Accuracy · SC 2005
Distributed systems › distributed communication
communication patterns
0.012006
Poster reception - Optimized collectives for PGAS languages with one-sided communication · SC 2006

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

one-sided communication · 0.1benchmarking · 0.1band-diagonal matrix solver · 0.1FFT · 0.1
YearPublicationVenuePosition
2006 Poster reception - Optimized collectives for PGAS languages with one-sided communication
abstract
Optimized collective operations are a crucial performance factor for many scientific applications. This work investigates the design and optimization of collectives in the context of Partitioned Global Address Space (PGAS) languages such as Unified Parallel C (UPC). Languages with one-sided communication permit a more flexible and expressive collective interface with application code, in turn enabling more aggressive optimization and more effective utilization of system resources. We investigate the design tradeoffs in a collectives implementation for UPC, ranging from resource management to synchronization mechanisms and target-dependent selection of optimal communication patterns. Our collectives are implemented in the Berkeley UPC compiler using the GASNet communication system, tuned across a wide variety of supercomputing platforms, and benchmarked against MPI collectives. Special emphasis is placed on the newly added Cray XT3 backend for UPC, whose characteristics are benchmarked in detail.
Dan Bonachea, Paul Hargrove, Rajesh Nishtala, Michael L. Welcome, Katherine A. Yelick
SC4
2005 Tera-Scalable Algorithms for Variable-Density Elliptic Hydrodynamics with Spectral Accuracy
abstract
We describe Miranda, a massively parallel spectral/compact solver for variabledensity incompressible flow, including viscosity and species diffusivity effects. Miranda utilizes FFTs and band-diagonal matrix solvers to compute spatial derivatives to at least 10th-order accuracy. We have successfully ported this communicationintensive application to BlueGene/L and have explored both direct block parallel and transpose-based parallelization strategies for its implicit solvers. We have discovered a mapping strategy which results in virtually perfect scaling of the transpose method up to 65,536 processors of the BlueGene/L machine. Sustained global communication rates in Miranda typically run at 85% of the theoretical peak speed of the BlueGene/L torus network, while sustained communication plus computation speeds reach 2.76 TeraFLOPS. This effort represents the first time that a high-order variable-density incompressible flow solver with species diffusion has demonstrated sustained performance in the TeraFLOPS range.
Andrew W. Cook, William H. Cabot, Peter L. Williams, Brian J. Miller, Bronis R. de Supinski, Robert K. Yates, Michael L. Welcome
SC7