메뉴 건너뛰기




Volumn 7155 LNCS, Issue PART 1, 2012, Pages 334-344

On partitioning problems with complex objectives

Author keywords

graph partitioning; Hypergraph partitioning; parallel sparse matrix computations; sparse matrix partitioning

Indexed keywords

MATRIX ALGEBRA;

EID: 84882574926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29737-3_38     Document Type: Conference Paper
Times cited : (5)

References (20)
  • 1
    • 0029354779 scopus 로고
    • Recent directions in netlist partitioning: A survey
    • Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning: A survey. Integration, the VLSI Journal 19, 1-81 (1995)
    • (1995) Integration, the VLSI Journal , vol.19 , pp. 1-81
    • Alpert, C.J.1    Kahng, A.B.2
  • 2
    • 41449100090 scopus 로고    scopus 로고
    • Multi-level direct k-way hypergraph partitioning with multiple constraints and fixed vertices
    • Aykanat, C., Cambazoglu, B.B., Uçar, B.: Multi-level direct k-way hypergraph partitioning with multiple constraints and fixed vertices. J. Parallel Distr. Com 68, 609-625 (2008)
    • (2008) J. Parallel Distr. Com , vol.68 , pp. 609-625
    • Aykanat, C.1    Cambazoglu, B.B.2    Uçar, B.3
  • 3
    • 10244251766 scopus 로고    scopus 로고
    • Permuting sparse rectangular matrices into block-diagonal form
    • Aykanat, C., Pinar, A., Çatalyürek, U.V.: Permuting sparse rectangular matrices into block-diagonal form. SIAM J. Sci. Comput. 25, 1860-1879 (2004)
    • (2004) SIAM J. Sci. Comput. , vol.25 , pp. 1860-1879
    • Aykanat, C.1    Pinar, A.2    Çatalyürek, U.V.3
  • 4
    • 31444439570 scopus 로고    scopus 로고
    • Communication balancing in parallel sparse matrixvector multiplication
    • Bisseling, R.H., Meesen, W.: Communication balancing in parallel sparse matrixvector multiplication. ETNA 21, 47-65 (2005)
    • (2005) ETNA , vol.21 , pp. 47-65
    • Bisseling, R.H.1    Meesen, W.2
  • 7
    • 77950793269 scopus 로고    scopus 로고
    • On two-dimensional sparse matrix partitioning: Models, methods, and a recipe
    • Çatalyürek, U.V., Aykanat, C., Uçar, B.: On two-dimensional sparse matrix partitioning: Models, methods, and a recipe. SIAM J. Sci. Comput. 32, 656-683 (2010)
    • (2010) SIAM J. Sci. Comput. , vol.32 , pp. 656-683
    • Çatalyürek, U.V.1    Aykanat, C.2    Uçar, B.3
  • 8
    • 0034497251 scopus 로고    scopus 로고
    • Partitioning rectangular and structurally unsymmetric sparse matrices for parallel processing
    • Hendrickson, B., Kolda, T.G.: Partitioning rectangular and structurally unsymmetric sparse matrices for parallel processing. SIAM J. Sci. Comput. 21, 2048-2072 (2000)
    • (2000) SIAM J. Sci. Comput. , vol.21 , pp. 2048-2072
    • Hendrickson, B.1    Kolda, T.G.2
  • 14
    • 78249265473 scopus 로고    scopus 로고
    • Laboratoire Bordelais de Recherche en Informatique (LaBRI)
    • Pellegrini, F.: SCOTCH 5.1 User's Guide. Laboratoire Bordelais de Recherche en Informatique (LaBRI) (2008)
    • (2008) SCOTCH 5.1 User's Guide
    • Pellegrini, F.1
  • 15
    • 84981248752 scopus 로고    scopus 로고
    • Partitioning for complex objectives
    • IEEE Computer Society, Washington, DC, CDROM
    • Pinar, A., Hendrickson, B.: Partitioning for complex objectives. In: IPDPS 2001, CDROM, p. 121. IEEE Computer Society, Washington, DC (2001)
    • (2001) IPDPS 2001 , pp. 121
    • Pinar, A.1    Hendrickson, B.2
  • 16
    • 0027845321 scopus 로고
    • Multiple-way network partitioning with different cost functions
    • Sanchis, L.A.: Multiple-way network partitioning with different cost functions. IEEE T. Comput. 42, 1500-1504 (1993)
    • (1993) IEEE T. Comput. , vol.42 , pp. 1500-1504
    • Sanchis, L.A.1
  • 17
    • 84937397986 scopus 로고    scopus 로고
    • Parallel multilevel algorithms for multiconstraint graph partitioning
    • Bode, A., Ludwig, T., Karl, W.C., Wismüller, R. (eds.). Springer, Heidelberg
    • Schloegel, K., Karypis, G., Kumar, V.: Parallel Multilevel Algorithms for Multiconstraint Graph Partitioning. In: Bode, A., Ludwig, T., Karl, W.C., Wismüller, R. (eds.) Euro-Par 2000. LNCS, vol. 1900, pp. 296-310. Springer, Heidelberg (2000)
    • (2000) Euro-Par 2000. LNCS , vol.1900 , pp. 296-310
    • Schloegel, K.1    Karypis, G.2    Kumar, V.3
  • 18
    • 10344261407 scopus 로고    scopus 로고
    • Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies
    • Uçar, B., Aykanat, C.: Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies. SIAM J. Sci. Comput. 25, 1827-1859 (2004)
    • (2004) SIAM J. Sci. Comput. , vol.25 , pp. 1827-1859
    • Uçar, B.1    Aykanat, C.2
  • 19
    • 17444414573 scopus 로고    scopus 로고
    • A two-dimensional data distribution method for parallel sparse matrix-vector multiplication
    • Vastenhouw, B., Bisseling, R.H.: A two-dimensional data distribution method for parallel sparse matrix-vector multiplication. SIAM Rev. 47, 67-95 (2005)
    • (2005) SIAM Rev. , vol.47 , pp. 67-95
    • Vastenhouw, B.1    Bisseling, R.H.2
  • 20
    • 84882612026 scopus 로고    scopus 로고
    • Combinatorial problems in a parallel hybrid linear solver
    • Becker, M., Lotz, J., Mosenkis, V., Naumann, U. (eds.). RWTH Aachen University
    • Yamazaki, I., Li, X.S., Rouet, F.H., Uçar, B.: Combinatorial problems in a parallel hybrid linear solver. In: Becker, M., Lotz, J., Mosenkis, V., Naumann, U. (eds.) Abstracts of 5th SIAM Workshop on Combinatorial Scientific Computing. pp. 87-89. RWTH Aachen University (2011)
    • (2011) Abstracts of 5th SIAM Workshop on Combinatorial Scientific Computing , pp. 87-89
    • Yamazaki, I.1    Li, X.S.2    Rouet, F.H.3    Uçar, B.4


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