Massively parallel methods for engineering and science problems

Authors:
W. J. Camp;S. J. Plimpton;B. A. Hendrickson;R. W. Leland
Affiliations:
Sandia National Labs, Albuquerque, NM;Sandia National Labs, Albuquerque, NM;Sandia National Labs, Albuquerque, NM;Sandia National Labs, Albuquerque, NM
Venue:
Communications of the ACM
Year:
1994

Citing 8
Cited 15

Solving problems on concurrent processors. Vol. 1: General techniques and regular problems

Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Computer simulation of liquids

Computer simulation of liquids
A radar simulation program for a 1024-processor hypercube

Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
Computational physics on the Connection Machine

Computers in Physics
Molecular dynamics on a distributed-memory multiprocessor

Journal of Computational Chemistry
AMBERCUBE MD, parallelization of AMBER's molecular dynamics module for distributed-memory hypercube computers

Journal of Computational Chemistry
Parallel Molecular Dynamics

Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing

The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization

PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Run-time methods for parallelizing partially parallel loops

ICS '95 Proceedings of the 9th international conference on Supercomputing
Experimental evaluation of efficient sparse matrix distributions

ICS '96 Proceedings of the 10th international conference on Supercomputing
Fast and effective algorithms for graph partitioning and sparse-matrix ordering

IBM Journal of Research and Development - Special issue: optical lithography I
Vienna-Fortran/HPF Extensions for Sparse and Irregular Problems and Their Compilation

IEEE Transactions on Parallel and Distributed Systems
The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization

IEEE Transactions on Parallel and Distributed Systems
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication

IEEE Transactions on Parallel and Distributed Systems
Topology preserving dynamic load balancing for parallel molecular simulations

SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
A hypergraph-partitioning approach for coarse-grain decomposition

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Efficient communication algorithms for pipeline multicomputers

Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Time-Stamping Algorithms for Parallelization of Loops at Run-Time

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Partitioning Planar Graphs with Costs and Weights

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Partitioning planar graphs with costs and weights

Journal of Experimental Algorithmics (JEA)
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids

Journal of Parallel and Distributed Computing
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	48.23

Visualization

Abstract