A hypergraph-partitioning approach for coarse-grain decomposition
Authors:
Open Access
- 10 November 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 28
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Graph partitioning models for parallel computingParallel Computing, 2000
- Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplicationIEEE Transactions on Parallel and Distributed Systems, 1999
- T2ACM SIGMOD Record, 1998
- Parallel incremental graph partitioningIEEE Transactions on Parallel and Distributed Systems, 1997
- Mapping molecular dynamics computations on to hypercubesParallel Computing, 1995
- Partitioning of unstructured meshes for load balancingConcurrency: Practice and Experience, 1995
- AN EFFICIENT PARALLEL ALGORITHM FOR MATRIX-VECTOR MULTIPLICATIONInternational Journal of High Speed Computing, 1995
- Massively parallel methods for engineering and science problemsCommunications of the ACM, 1994
- A new mapping heuristic based on mean field annealingJournal of Parallel and Distributed Computing, 1992
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989