Michael W. Schmidt

dblp:56/567 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · unresolved

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
1 paper
High-performance computing · 78% Parallel and multicore computing · 22%

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

TopicWeightPapersLastEvidence papers
High-performance computing › scientific computing systems
computational chemistry
0.012003
Enabling the Efficient Use of SMP Clusters: The GAMESS/DDI Model · SC 2003
High-performance computing › scientific computing systems
electronic structure calculation
0.012003
Enabling the Efficient Use of SMP Clusters: The GAMESS/DDI Model · SC 2003
Parallel and multicore computing
parallel programming models
0.012003
Enabling the Efficient Use of SMP Clusters: The GAMESS/DDI Model · SC 2003
High-performance computing
scientific computing systems
0.012003
Enabling the Efficient Use of SMP Clusters: The GAMESS/DDI Model · SC 2003
High-performance computing
cluster computing
0.012003
Enabling the Efficient Use of SMP Clusters: The GAMESS/DDI Model · SC 2003
High-performance computing › cluster computing
SMP cluster
0.012003
Enabling the Efficient Use of SMP Clusters: The GAMESS/DDI Model · SC 2003

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

shared memory programming · 0.0message passing · 0.0
YearPublicationVenuePosition
2003 Enabling the Efficient Use of SMP Clusters: The GAMESS/DDI Model
abstract
An important advance in cluster computing is the evolution from single processor clusters to multi-processor SMP clusters. Due to the increased complexity in the memory model on SMP clusters, new approaches are needed for applications that make use of distributed-memory paradigms. This paper presents new communications software developments that are designed to take advantage of SMP cluster hardware. Although the specific focus is on the central field of computational chemistry and materials science, as embodied in the popular electronic structure package GAMESS (General Atomic and Molecular Electronic Structure System), the impact of these new developments will be far broader in scope. Following a summary of the essential features of the distributed data interface (DDI) in the current implementation of GAMESS, the new developments for SMP clusters are described. The advantages of these new features are illustrated using timing benchmarks on several hardware platforms, using a typical computational chemistry application.
Ryan M. Olson, Michael W. Schmidt, Mark S. Gordon, Alistair P. Rendell
SC2
2002 Performance and Implementation of Distributed Data CPHF and SCF Algorithms
abstract
This paper describes a novel distributed data parallel self consistent field (SCF) algorithm and the distributed data coupled perturbed Hartree-Fock (CPHF) step of an analytic Hessian algorithm. The distinguishing features of these algorithms are: (a) columns of density and Fock matrices are distributed among processors, (b) pairwise dynamic load balancing and an efficient static load balancer were developed to achieve a good workload, and (c) network communication time is minimized via careful analysis of data flow in the SCF and CPHF algorithms. By using a shared memory model, novel work load balancers, and improved analytic Hessian steps, we have developed codes that achieve superb performance. The performance of the CPHF code is demonstrated on a large biological system.
Yuri Alexeev, Michael W. Schmidt, Theresa L. Windus, Mark S. Gordon, Ricky A. Kendall
CLUSTER2