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

Mark P. Sears

dblp:48/2181 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1998
—ORCID · none

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

Systems, architecture and hardware · 2 · 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
2 papers
High-performance computing · 83% Parallel and multicore computing · 14% Interconnection networks and networks-on-chip · 3%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
High-performance computing
scientific computing systems
0.021998
Application of a High Performance Parallel Eigensolver to Electronic Structure Calculations · SC 1998
A radar simulation program for a 1024-processor hypercube · SC 1989
High-performance computing › parallel numerical algorithms
parallel eigensolver
0.011998
Application of a High Performance Parallel Eigensolver to Electronic Structure Calculations · SC 1998
Computational science and engineering › computational chemistry
electronic structure calculation
0.011998
Application of a High Performance Parallel Eigensolver to Electronic Structure Calculations · SC 1998
Parallel and multicore computing › load balancing
dynamic load balancing
0.011989
A radar simulation program for a 1024-processor hypercube · SC 1989
Interconnection networks and networks-on-chip
hypercube network
0.011989
A radar simulation program for a 1024-processor hypercube · SC 1989

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

ScaLAPACK · 0.0task distribution · 0.0domain decomposition · 0.0
YearPublicationVenuePosition
1998 Application of a High Performance Parallel Eigensolver to Electronic Structure Calculations
abstract
In this paper we report the development of a very high performance parallel eigensolver based on the portable ScaLAPACK library, and its application to electronic structure calculations in the MP-Quest code. This work was done on ASCI-Red, a supercomputer based on over 4600 dual-processor Pentium Pro1 nodes at Sandia National Laboratories. We report sustained performance in the code of 605GFlops and peak performance in the eigensolver of 684GFlops. This is comparable to performance obtained from MP-Linpack on a similar sized problem. For a smaller problem we have sustained performance of 420GFlops in the application and peak performance in the eigensolver of 563GFlops. Impact of this work on the specific application is important, but the development of significant improvements to a portable eigensolver and other libraries will also benefit a number of applications.
Mark P. Sears, Ken Stanley, Greg Henry
SC1
1989 A radar simulation program for a 1024-processor hypercube
abstract
We have developed a fast parallel version of an existing synthetic aperture radar (SAR) simulation program, SRIM. On a 1024-processor NCUBE hypercube it runs an order of magnitude faster than on a CRAY X-MP or CRAY Y-MP processor. This speed advantage is coupled with an order of magnitude advantage in machine acquisition cost. SRIM is a somewhat large (30,000 lines of Fortran 77) program designed for uniprocessors; its restructuring for a hypercube provides new lessons in the task of altering older serial programs to run well on modern parallel architectures. We describe the techniques used for parallelization, and the performance obtained. Several novel parallel approaches to problems of task distribution, data distribution, and direct output were required. These techniques increase performance and appear to have general applicability for massive parallelism. We describe the hierarchy necessary to dynamically manage (i.e., load balance) a large ensemble. The ensemble is used in a heterogeneous manner, with different programs on different parts of the hypercube. The heterogeneous approach takes advantage of the independent instruction streams possible on MIMD machines.
John L. Gustafson, Robert E. Benner, Mark P. Sears, Thomas D. Sullivan
SC3