메뉴 건너뛰기




Volumn , Issue , 2004, Pages 114-121

A parallel algorithm for multilevel k-way hypergraph partitioning

Author keywords

[No Author keywords available]

Indexed keywords

DISK CONTENTION; HYPERGRAPH; PARTITION QUALITY; PROCESSOR UTILIZATION;

EID: 19644382744     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2004.6     Document Type: Conference Paper
Times cited : (21)

References (21)
  • 2
    • 0028419680 scopus 로고
    • A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
    • April
    • S. Barnard and H. Simon. A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems. Concurrency: Practice and Experience, 6(2):101-117, April 1994.
    • (1994) Concurrency: Practice and Experience , vol.6 , Issue.2 , pp. 101-117
    • Barnard, S.1    Simon, H.2
  • 5
    • 0033360524 scopus 로고    scopus 로고
    • Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication
    • U. Catalyurek and C. Aykanat. Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication. IEEE Transactions on Parallel and Distributed Systems, 10(7):673-693, 1999.
    • (1999) IEEE Transactions on Parallel and Distributed Systems , vol.10 , Issue.7 , pp. 673-693
    • Catalyurek, U.1    Aykanat, C.2
  • 6
    • 10844256700 scopus 로고    scopus 로고
    • Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models
    • To appear
    • N. Dingle, W. Knottenbelt, and P. Harrison. Uniformization and Hypergraph Partitioning for the Distributed Computation of Response Time Densities in Very Large Markov Models. Journal of Parallel and Distributed Computing, 2004. (To appear).
    • (2004) Journal of Parallel and Distributed Computing
    • Dingle, N.1    Knottenbelt, W.2    Harrison, P.3
  • 7
    • 0029720905 scopus 로고    scopus 로고
    • A probability-based approach to VLSI circuit partitioning
    • June
    • S. Dutt and W. Deng. A Probability-based Approach to VLSI Circuit Partitioning. In Proc. 33rd Annual Design Automation Conference, pages 100-105, June 1996.
    • (1996) Proc. 33rd Annual Design Automation Conference , pp. 100-105
    • Dutt, S.1    Deng, W.2
  • 12
    • 0007071645 scopus 로고
    • Modeling hypergraphs by graphs with the same mincut properties
    • March
    • E. Ihler, D. Wagner, and F. Wagner. Modeling Hypergraphs by Graphs with the same Mincut Properties. Information Processing Letters, 45:171-175, March 1993.
    • (1993) Information Processing Letters , vol.45 , pp. 171-175
    • Ihler, E.1    Wagner, D.2    Wagner, F.3
  • 13
    • 0013023902 scopus 로고    scopus 로고
    • Multilevel hypergraph partitioning
    • University of Minnesota
    • G. Karypis. Multilevel Hypergraph Partitioning. Technical Report #02-25., University of Minnesota, 2002.
    • (2002) Technical Report #02-25 , vol.2 , Issue.25
    • Karypis, G.1
  • 16
    • 0003561908 scopus 로고    scopus 로고
    • Multilevel k-way hypergraph partitioning
    • University of Minnesota
    • G. Karypis and V. Kumar. Multilevel k-way Hypergraph Partitioning. Technical Report #98-036, University of Minnesota, 1998.
    • (1998) Technical Report #98-036 , vol.98 , Issue.36
    • Karypis, G.1    Kumar, V.2
  • 19
    • 0021425044 scopus 로고
    • An improved min-cut algorithm for partitioning VLSI networks
    • B. Krishnamurthy. An Improved min-cut Algorithm for Partitioning VLSI Networks. IEEE Transactions on Computers, 33(C):438-446, 1984.
    • (1984) IEEE Transactions on Computers , vol.33 , Issue.C , pp. 438-446
    • Krishnamurthy, B.1


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