메뉴 건너뛰기




Volumn 17, Issue 5, 2001, Pages 601-623

Multilevel mesh partitioning for heterogeneous communication networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HIERARCHICAL SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); TELECOMMUNICATION NETWORKS;

EID: 0034836740     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-739X(00)00107-2     Document Type: Article
Times cited : (68)

References (27)
  • 1
    • 0028419680 scopus 로고
    • A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
    • S.T. Barnard, H.D. Simon, A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Pract. Experience 6 (2) (1994) 101-117.
    • (1994) Concurrency: Pract. Experience , vol.6 , Issue.2 , pp. 101-117
    • Barnard, S.T.1    Simon, H.D.2
  • 2
    • 0001494416 scopus 로고
    • A heuristic for reducing fill-in in sparse matrix factorization
    • R.F. Sincovec, et al. (Eds.), SIAM, Philadelphia, PA
    • T.N. Bui, C. Jones, A heuristic for reducing fill-in in sparse matrix factorization, in: R.F. Sincovec, et al. (Eds.), Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1993, pp. 445-452.
    • (1993) Parallel Processing for Scientific Computing , pp. 445-452
    • Bui, T.N.1    Jones, C.2
  • 3
    • 85031479850 scopus 로고    scopus 로고
    • The quadratic assignment problem
    • Inst. Mathematik B, Tech. Univ. Graz, Austria
    • R.E. Burkard, E. Cela, P.M. Pardalos, L.S. Pitsoulis, The quadratic assignment problem, SFB-Report 126, Inst. Mathematik B, Tech. Univ. Graz, Austria, 1998.
    • (1998) SFB-Report , vol.126
    • Burkard, R.E.1    Cela, E.2    Pardalos, P.M.3    Pitsoulis, L.S.4
  • 4
    • 0001805769 scopus 로고    scopus 로고
    • QAPLIB - A quadratic assignment problem library
    • R.E. Burkard, S.E. Karisch, F. Rendl, QAPLIB - a quadratic assignment problem library, J. Global Optim. 10 (4) (1997) 391-403.
    • (1997) J. Global Optim. , vol.10 , Issue.4 , pp. 391-403
    • Burkard, R.E.1    Karisch, S.E.2    Rendl, F.3
  • 5
    • 0021481361 scopus 로고
    • A thermodynamically motivated simulation procedure for combinatorial optimization problems
    • R.E. Burkard, F. Rendl, A thermodynamically motivated simulation procedure for combinatorial optimization problems, Eur. J. Oper. Res. 17 (2) (1984) 169-174.
    • (1984) Eur. J. Oper. Res. , vol.17 , Issue.2 , pp. 169-174
    • Burkard, R.E.1    Rendl, F.2
  • 6
    • 0342328705 scopus 로고    scopus 로고
    • Mesh partitioning for distributed systems: Exploring optimal number of partitions with local and remote communication
    • B. Hendrickson et al. (Eds.), SIAM, Philadelphia, CD-rom
    • J. Chen, V. Taylor, Mesh partitioning for distributed systems: exploring optimal number of partitions with local and remote communication, in: B. Hendrickson et al. (Eds.), Proc. 9th SIAM Conference on Parallel Processing and Scientific Computing, SIAM, Philadelphia, 1999. CD-rom.
    • (1999) Proc. 9th SIAM Conference on Parallel Processing and Scientific Computing
    • Chen, J.1    Taylor, V.2
  • 7
    • 22644450973 scopus 로고    scopus 로고
    • ParaPART: Parallel mesh partitioning for distributed systems
    • Proc. Irregular'98: Solving Irregularly Structured Problems in Parallel, San Juan, Puerto Rico, Springer, Berlin
    • J. Chen, V. Taylor, ParaPART: parallel mesh partitioning for distributed systems, in: Proc. Irregular'98: Solving Irregularly Structured Problems in Parallel, San Juan, Puerto Rico, Lecture Notes in Computer Science, Vol. 1586, Springer, Berlin, 1999.
    • (1999) Lecture Notes in Computer Science , vol.1586
    • Chen, J.1    Taylor, V.2
  • 8
    • 0343198051 scopus 로고
    • Mapping large-scale FEM-graphs to highly parallel computers with grid-like topology by self-organization
    • Dept. Informatics, Univ. Karlsruhe, D-76128 Karlsruhe, Germany, February
    • M. Dormanns, H.-U. Heiss, Mapping large-scale FEM-graphs to highly parallel computers with grid-like topology by self-organization, Technical Report, Dept. Informatics, Univ. Karlsruhe, D-76128 Karlsruhe, Germany, February 1994.
    • (1994) Technical Report
    • Dormanns, M.1    Heiss, H.-U.2
  • 11
    • 0030672717 scopus 로고    scopus 로고
    • Fast and effective algorithms for graph partitioning and sparse matrix reordering
    • A. Gupta, Fast and effective algorithms for graph partitioning and sparse matrix reordering, IBM J. Res. Dev. 41 (1/2) (1996) 171-183.
    • (1996) IBM J. Res. Dev. , vol.41 , Issue.1-2 , pp. 171-183
    • Gupta, A.1
  • 12
    • 0001108827 scopus 로고    scopus 로고
    • Graph partitioning models for parallel computing
    • B. Hendrickson, T.G. Kolda, Graph partitioning models for parallel computing, Parallel Comput. 26 (2000) 1519-1534.
    • (2000) Parallel Comput. , vol.26 , pp. 1519-1534
    • Hendrickson, B.1    Kolda, T.G.2
  • 13
    • 0003223128 scopus 로고
    • A multilevel algorithm for partitioning graphs
    • S. Karin (Ed.), San Diego, ACM, New York
    • B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, in: S. Karin (Ed.), Proceedings of the Supercomputing'95, San Diego, ACM, New York, 1995.
    • (1995) Proceedings of the Supercomputing'95
    • Hendrickson, B.1    Leland, R.2
  • 16
    • 0032131147 scopus 로고    scopus 로고
    • A fast and high quality multilevel scheme for partitioning irregular graphs
    • G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput. 20 (1) (1998) 359-392.
    • (1998) SIAM J. Sci. Comput. , vol.20 , Issue.1 , pp. 359-392
    • Karypis, G.1    Kumar, V.2
  • 17
    • 84990479742 scopus 로고
    • An efficient heuristic for partitioning graphs
    • B.W. Kernighan, S. Lin, An efficient heuristic for partitioning graphs, Bell Syst. Tech. J. 49 (1970) 291-308.
    • (1970) Bell Syst. Tech. J. , vol.49 , pp. 291-308
    • Kernighan, B.W.1    Lin, S.2
  • 18
    • 0034197535 scopus 로고    scopus 로고
    • A scalable strategy for the parallelization of multiphysics unstructured mesh-iterative codes on distributed-memory systems
    • K. McManus, M. Cross, C. Walshaw, S. Johnson, P. Leggett, A scalable strategy for the parallelization of multiphysics unstructured mesh-iterative codes on distributed-memory systems, Int. J. High Perform. Comput. Appl. 14 (2) (2000) 137-174.
    • (2000) Int. J. High Perform. Comput. Appl. , vol.14 , Issue.2 , pp. 137-174
    • McManus, K.1    Cross, M.2    Walshaw, C.3    Johnson, S.4    Leggett, P.5
  • 20
    • 0343633754 scopus 로고
    • Pasadena
    • K. McManus, C. Walshaw, M. Cross, P. Leggett, S. Johnson, Evaluation of the JOSTLE mesh partitioning code for practical multiphysics applications, in: A. Ecer, et al. (Eds.), Parallel Computational Fluid Dynamics: Implementations and Results Using Parallel Computers, Elsevier, Amsterdam, 1996, pp. 673-680 (Proc. Parallel CFD'95, Pasadena, 1995).
    • (1995) Proc. Parallel CFD'95
  • 22
    • 84944061403 scopus 로고    scopus 로고
    • SCOTCH: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs
    • H. Liddell, et al. (Eds.), High-performance Computing and Networking, Proc. HPCN'96, Brussels, Springer, Berlin
    • F. Pellegrini, J. Roman, SCOTCH: a software package for static mapping by dual recursive bipartitioning of process and architecture graphs, in: H. Liddell, et al. (Eds.), High-performance Computing and Networking, Proc. HPCN'96, Brussels, Lecture Notes in Computer Science, Vol. 1067, Springer, Berlin, 1996, pp. 493-498.
    • (1996) Lecture Notes in Computer Science , vol.1067 , pp. 493-498
    • Pellegrini, F.1    Roman, J.2
  • 23
    • 16244379908 scopus 로고    scopus 로고
    • Graph partitioning for high performance scientific simulations
    • J. Dongarra, et al. (Eds.), Morgan Kaufmann, Los Altos, CA, in press
    • K. Schloegel, G. Karypis, V. Kumar, Graph partitioning for high performance scientific simulations, in: J. Dongarra, et al. (Eds.), CRPC Parallel Computing Handbook, Morgan Kaufmann, Los Altos, CA, in press.
    • CRPC Parallel Computing Handbook
    • Schloegel, K.1    Karypis, G.2    Kumar, V.3
  • 25
    • 0001514750 scopus 로고    scopus 로고
    • Parallel optimisation algorithms for multilevel mesh partitioning
    • originally published as Univ. Greenwich Tech. Rep. 99/IM/44
    • C. Walshaw, M. Cross, Parallel optimisation algorithms for multilevel mesh partitioning, Parallel Comput. 26 (2000) 1635-1660. (originally published as Univ. Greenwich Tech. Rep. 99/IM/44).
    • (2000) Parallel Comput. , vol.26 , pp. 1635-1660
    • Walshaw, C.1    Cross, M.2
  • 26
    • 0034456293 scopus 로고    scopus 로고
    • Mesh partitioning: A multilevel balancing and refinement algorithm
    • originally published as Univ. Greenwich Tech. Rep. 98/IM/35
    • C. Walshaw, M. Cross, Mesh partitioning: a multilevel balancing and refinement algorithm, SIAM J. Sci. Comput. 22 (1) (2000) 63-80 (originally published as Univ. Greenwich Tech. Rep. 98/IM/35).
    • (2000) SIAM J. Sci. Comput. , vol.22 , Issue.1 , pp. 63-80
    • Walshaw, C.1    Cross, M.2
  • 27
    • 84893365931 scopus 로고
    • Partitioning and mapping of unstructured meshes to parallel machine topologies
    • A. Ferreira, J. Rolim (Eds.), Proceedings of the Irregular'95 on Parallel Algorithms for Irregularly Structured Problems, Springer, Berlin
    • C. Walshaw, M. Cross, M. Everett, S. Johnson, K. McManus, Partitioning and mapping of unstructured meshes to parallel machine topologies, in: A. Ferreira, J. Rolim (Eds.), Proceedings of the Irregular'95 on Parallel Algorithms for Irregularly Structured Problems, Lecture Notes in Computer Science, Vol. 980, Springer, Berlin, 1995, pp. 121-126.
    • (1995) Lecture Notes in Computer Science , vol.980 , pp. 121-126
    • Walshaw, C.1    Cross, M.2    Everett, M.3    Johnson, S.4    McManus, K.5


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