Partitioning unstructured computational graphs for nonunifor
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Parallel & Distributed Technology: Systems & Applications
- Vol. 3 (3) , 63-69
- https://doi.org/10.1109/m-pdt.1995.414844
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problemsConcurrency: Practice and Experience, 1994
- Performance of dynamic load balancing algorithms for unstructured mesh calculationsConcurrency: Practice and Experience, 1991
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- Spatial query processing in an object-oriented database systemACM SIGMOD Record, 1986