메뉴 건너뛰기




Volumn 18, Issue 5, 1997, Pages 1436-1445

How good is recursive bisection?

Author keywords

Communication cost; Data and computation mapping on parallel machines; Load balancing; Mesh partitioning; Parallel processing; Recursive bisection; Scalable parallel algorithms; Well shaped finite element and finite difference meshes

Indexed keywords

COMMUNICATION COST; LOAD BALANCING; MESH PARTITIONING; PARALLEL MACHINES; RECURSIVE BISECTION;

EID: 0031215997     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827593255135     Document Type: Article
Times cited : (159)

References (32)
  • 1
    • 0024984223 scopus 로고
    • A separator theorem for graphs with an excluded minor and its applications
    • Baltimore, MD
    • N. ALON, P. SEYMOUR, AND R. THOMAS, A separator theorem for graphs with an excluded minor and its applications, in ACM STOC, Baltimore, MD, 1990, pp. 293-299.
    • (1990) ACM STOC , pp. 293-299
    • Alon, N.1    Seymour, P.2    Thomas, R.3
  • 2
    • 0028419680 scopus 로고
    • A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
    • 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) 1994, pp. 101-117.
    • (1994) Concurrency: Practice and Experience , vol.6 , Issue.2 , pp. 101-117
    • Barnard, S.T.1    Simon, H.D.2
  • 3
    • 0023346636 scopus 로고
    • A partitioning strategy for nonuniform problems on multiprocessors
    • M. J. BERGER AND S. BOKHARI, A partitioning strategy for nonuniform problems on multiprocessors, IEEE Trans. Comput., C-36 (1987), pp. 570-580.
    • (1987) IEEE Trans. Comput. , vol.C-36 , pp. 570-580
    • Berger, M.J.1    Bokhari, S.2
  • 5
    • 84990678008 scopus 로고
    • Execution time support for adaptive scientific algorithms on distributed memory machines
    • H. BERRYMAN, J. SALTZ, AND J. SCROGGS, Execution time support for adaptive scientific algorithms on distributed memory machines, Concurrency: Practice and Experience, 3(3) (1991), pp. 159-178.
    • (1991) Concurrency: Practice and Experience , vol.3 , Issue.3 , pp. 159-178
    • Berryman, H.1    Saltz, J.2    Scroggs, J.3
  • 6
    • 0022918065 scopus 로고
    • Iterative methods for the solution of elliptic problems on regions partitioned into substructures
    • P. E. BJØRSTAD AND O. B. WIDLUND, Iterative methods for the solution of elliptic problems on regions partitioned into substructures, SIAM J. Numer. Anal., 23 (1986), pp. 1097-1120.
    • (1986) SIAM J. Numer. Anal. , vol.23 , pp. 1097-1120
    • Bjørstad, P.E.1    Widlund, O.B.2
  • 9
    • 0004174607 scopus 로고
    • Guaranteed Quality Triangular Meshes
    • Department of Computer Science, Cornell University, Ithaca, NY
    • L. P. CHEW, Guaranteed Quality Triangular Meshes, Tech. report, TR 89-893, Department of Computer Science, Cornell University, Ithaca, NY, 1989.
    • (1989) Tech. Report, TR 89-893
    • Chew, L.P.1
  • 12
    • 0001345696 scopus 로고
    • A separator theorem for graphs of bounded genus
    • J. R. GILBERT, J. P. HUTCHINSON, AND R. E. TARJAN, A separator theorem for graphs of bounded genus, J. Algorithms, 5 (1984), pp. 391-407.
    • (1984) J. Algorithms , vol.5 , pp. 391-407
    • Gilbert, J.R.1    Hutchinson, J.P.2    Tarjan, R.E.3
  • 14
    • 0010865720 scopus 로고
    • The analysis of a nested dissection algorithm
    • J. R. GILBERT AND R. E. TARJAN, The analysis of a nested dissection algorithm, Numer. Math., 50 (1987), pp. 377-404.
    • (1987) Numer. Math. , vol.50 , pp. 377-404
    • Gilbert, J.R.1    Tarjan, R.E.2
  • 15
    • 0000264382 scopus 로고
    • Nested dissection of a regular finite element mesh
    • J. A. GEORGE, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., 10 (1973), pp. 345-363.
    • (1973) SIAM J. Numer. Anal. , vol.10 , pp. 345-363
    • George, J.A.1
  • 17
    • 6044242156 scopus 로고
    • Solving Unstructured Grid Problems on Massively Parallel Computers
    • RIACS, Mountain View, CA
    • S. HAMMOND AND R. SCHREIBER, Solving Unstructured Grid Problems on Massively Parallel Computers, Tech. report TR 90.22, RIACS, Mountain View, CA, 1990.
    • (1990) Tech. Report TR 90.22
    • Hammond, S.1    Schreiber, R.2
  • 18
    • 0000063845 scopus 로고
    • An improved spectral graph partitioning algorithm for mapping parallel computations
    • B. HENDRICKSON AND R. LELAND, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput., 16 (1995), pp. 452-469.
    • (1995) SIAM J. Sci. Comput. , vol.16 , pp. 452-469
    • Hendrickson, B.1    Leland, R.2
  • 19
    • 0024135198 scopus 로고
    • An approximate max-flow rain-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
    • White Plains, NY
    • F. T. LEIGHTON AND S. RAO, An approximate max-flow rain-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in 29th Annual Symposium on Foundations of Computer Science, White Plains, NY, 1988, pp. 422-431.
    • (1988) 29th Annual Symposium on Foundations of Computer Science , pp. 422-431
    • Leighton, F.T.1    Rao, S.2
  • 20
    • 0003831797 scopus 로고
    • Area efficient VLSI computation
    • MIT Press, Cambridge, MA
    • C. E. LEISERSON, Area efficient VLSI computation, in Foundations of Computing, MIT Press, Cambridge, MA, 1983.
    • (1983) Foundations of Computing
    • Leiserson, C.E.1
  • 21
    • 0018457301 scopus 로고
    • A separator theorem for planar graphs
    • R. J. LIPTON AND R. E. TARJAN, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177-189.
    • (1979) SIAM J. Appl. Math. , vol.36 , pp. 177-189
    • Lipton, R.J.1    Tarjan, R.E.2
  • 23
    • 6044220136 scopus 로고
    • The solution of mesh equations on a parallel computer
    • NASA, Langley, VA
    • J. W. H. LIU, The solution of mesh equations on a parallel computer, in 2nd Langley Conference on Scientific Computing, NASA, Langley, VA, 1974, pp. 17-24.
    • (1974) 2nd Langley Conference on Scientific Computing , pp. 17-24
    • Liu, J.W.H.1
  • 27
    • 0000812783 scopus 로고
    • Partitioning sparse matrices with eigenvectors of graphs
    • A. POTHEN, H. D. SIMON, AND K.-P. LIOU, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix'Anal. Appl., 11 (1990), pp. 430-452.
    • (1990) SIAM J. Matrix'Anal. Appl. , vol.11 , pp. 430-452
    • Pothen, A.1    Simon, H.D.2    Liou, K.-P.3
  • 29
    • 44949282112 scopus 로고
    • Partitioning of unstructured problems for parallel processing
    • H. D. SIMON, Partitioning of unstructured problems for parallel processing, Comput. Systems Engrg., 2 (1991), pp. 135-148.
    • (1991) Comput. Systems Engrg. , vol.2 , pp. 135-148
    • Simon, H.D.1
  • 32
    • 84990643496 scopus 로고
    • Performance of dynamic load balancing algorithms for unstructured mesh calculations
    • R. D. WILLIAMS, Performance of dynamic load balancing algorithms for unstructured mesh calculations, Concurrency, 3 (1991), pp. 457-469.
    • (1991) Concurrency , vol.3 , pp. 457-469
    • Williams, R.D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.