메뉴 건너뛰기




Volumn , Issue , 2004, Pages 347-350

A novel algorithm for mapping parallel applications in computational Grid environments

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COSTS; GRID COMPUTING; HEURISTIC ALGORITHMS; SELF MAPPING ALGORITHM (TSMA);

EID: 11244309384     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCASIA.2004.1324056     Document Type: Conference Paper
Times cited : (2)

References (9)
  • 2
    • 0001108827 scopus 로고    scopus 로고
    • Graph partitioning models for parallel computing
    • B. Hendrickson and T. Kolda. Graph partitioning models for parallel computing. Parallel Computing, 26(12):1519-1534, 2000.
    • (2000) Parallel Computing , vol.26 , Issue.12 , pp. 1519-1534
    • Hendrickson, B.1    Kolda, T.2
  • 3
    • 84883471289 scopus 로고    scopus 로고
    • Graph partitioning and parallel solvers: Has the emperor no clothes?
    • B. Hendrickson and R. Leland. Graph partitioning and parallel solvers: Has the emperor no clothes? (extended abstract). In Irregular'98 Lecture Notes in Computer Science, volume 1457, pages 218-225, 1998.
    • (1998) Irregular'98 Lecture Notes in Computer Science , vol.1457 , pp. 218-225
    • Hendrickson, B.1    Leland, R.2
  • 6
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, 1979.
    • (1979) The Bell System Technical Journal , vol.49 , Issue.2 , pp. 291-307
    • Kernighan, B.1    Lin, S.2


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