Scotch " a software package for static mapping by dual recursive bipartitioning process and architecture graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1067, Issue , 1996, Pages 493-498

  Pellegrini, Francois ^a   Roman, Jean ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; SOFTWARE PACKAGES;

COMBINATORIAL OPTIMIZATION PROBLEMS; COMMUNICATING PROCESS; NUMBER OF SOURCES; OVERALL EXECUTION; PARALLEL MACHINE; PARALLEL PROGRAM; RECURSIVE BIPARTITIONING; TARGET ARCHITECTURES;

MAPPING;

EID: 84944061403     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61142-8_588     Document Type: Conference Paper

References (13)

1. S. T. Barnard and H. D. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6(2):101-117, 1994
2. F. Ercal, J. Ramanujam, and P. Sadayappan. Task allocation onto a hypercube by recursive mincut bipartitionning. JPDC, 10:35-44, 1990
3. C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In Proc. 19th Design Autom. Conf., pages 175-181. IEEE, 1982
4. M. R. Garey and D. S. Johnson. Computers and IntractabIility: A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco, 1979
5. S.W. Hammond. Mapping unstructured grid computations to massively parallel computers. PhD thesis~ Rensselaer Polytechnic Institute, feb 1992
6. B. Hendrickson and R. Leland. The CHACO user's guide. Technical Report SAND93-2339, Sandia National Laboratories, nov 1993
7. B. Hendrickson and R. Leland. An empirical study of static load balancing algorithms. In Proceedings of SHPCC'9~ Knoxville, pages 682-685. IEEE, may 1994
8. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. TR 95-035, University of Minnesota, jun 1995
9. C-. Karypis and V. Kumar. MgYIS-Unstructured Graph Partitioning and Sparse Matrix Ordering System-Version 2.0. University of Minnesota, jun 1995
10. D. M. Nicol. Rectilinear partitioning of irregular data parallel computations. JournaI of Parallel and Distributed Computing, 23:119-134, 1994
11. F. Pellegrini. Application de mdthodes de partition ~ la rdsolution de probILmes de graphes issus du paralldlisme. Th~se de Doctorat, Universit~ Bordeaux I, jan 1995
12. F. Pellegrini. SCOTCH 3.0 User's guide. Technical Report 1095-95, LaBRI, Universit~ Bordeaux I, oct 1995
13. A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis, 11(3):430-452, jul 1990