메뉴 건너뛰기




Volumn 24, Issue 5-6, 1998, Pages 893-909

An efficient clustering algorithm for partitioning parallel programs

Author keywords

Clustering; Granularity; Multiprocessor scheduling; Parallel processing; Partitioning

Indexed keywords

COMPUTATIONAL METHODS; PARALLEL PROCESSING SYSTEMS; TREES (MATHEMATICS);

EID: 0032095261     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(98)00004-0     Document Type: Article
Times cited : (4)

References (11)
  • 1
    • 0023866688 scopus 로고
    • Grain size determination for parallel processing
    • Jan
    • B. Kruatrachue, T. Lewis, Grain size determination for parallel processing, IEEE Software, Jan. 1988, 23-32.
    • (1988) IEEE Software , pp. 23-32
    • Kruatrachue, B.1    Lewis, T.2
  • 2
    • 0024732926 scopus 로고
    • Automatic determination of grain size for efficient parallel processing
    • C. McCreary, H. Gill, Automatic determination of grain size for efficient parallel processing, Comm. ACM 32 (9) (1989) 1073-1078.
    • (1989) Comm. ACM , vol.32 , Issue.9 , pp. 1073-1078
    • McCreary, C.1    Gill, H.2
  • 3
    • 0027606923 scopus 로고
    • Declustering: A new multiprocessor scheduling technique
    • G.G. Sih, E.A. Lee, Declustering: a new multiprocessor scheduling technique, IEEE Trans. Parallel Distributed Syst. 4 (6) (1993) 625-637.
    • (1993) IEEE Trans. Parallel Distributed Syst. , vol.4 , Issue.6 , pp. 625-637
    • Sih, G.G.1    Lee, E.A.2
  • 4
    • 0019544910 scopus 로고
    • On the mapping problem
    • S.H. Bokhari, On the mapping problem, IEEE Trans. Comput. 30 (3) (1981) 207-214.
    • (1981) IEEE Trans. Comput. , vol.30 , Issue.3 , pp. 207-214
    • Bokhari, S.H.1
  • 5
    • 0023558425 scopus 로고
    • Nearest-neighbor mapping of finite element graphs onto processors meshes
    • P. Sadayappan, F. Ercal, Nearest-neighbor mapping of finite element graphs onto processors meshes, IEEE Trans. Comput. 36 (12) (1987) 1408-1424.
    • (1987) IEEE Trans. Comput. , vol.36 , Issue.12 , pp. 1408-1424
    • Sadayappan, P.1    Ercal, F.2
  • 6
    • 0025245089 scopus 로고
    • Cluster partitioning approaches to mapping parallel programs onto a hypercube
    • P. Sadayappan, F. Ercal, J. Ramanujam, Cluster partitioning approaches to mapping parallel programs onto a hypercube, Parallel Comput. 13 (1990) 1-16.
    • (1990) Parallel Comput. , vol.13 , pp. 1-16
    • Sadayappan, P.1    Ercal, F.2    Ramanujam, J.3
  • 7
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • B.W. Kernighan, S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Syst. Tech. J. 49 (2) (1970) 291-308.
    • (1970) Bell Syst. Tech. J. , vol.49 , Issue.2 , pp. 291-308
    • Kernighan, B.W.1    Lin, S.2
  • 8
    • 0024126036 scopus 로고
    • A general approach to mapping of parallel computations upon multiprocessor architectures
    • S.J. Kim, J.C. Browne, A general approach to mapping of parallel computations upon multiprocessor architectures, in: Proc. Int. Conf. Parallel Processing, Vol. 3, 1988, pp. 1-8.
    • (1988) Proc. Int. Conf. Parallel Processing , vol.3 , pp. 1-8
    • Kim, S.J.1    Browne, J.C.2
  • 10
    • 0031123078 scopus 로고    scopus 로고
    • Divide-and-conquer mapping of parallel programs onto hypercube computers
    • S. Lor, H. Shen, P. Maheshwari, Divide-and-conquer mapping of parallel programs onto hypercube computers, J. Syst. Archi. 43 (6&7) (1997) 373-390.
    • (1997) J. Syst. Archi. , vol.43 , Issue.6-7 , pp. 373-390
    • Lor, S.1    Shen, H.2    Maheshwari, P.3
  • 11
    • 0027606922 scopus 로고
    • On the granularity and clustering of directed acyclic task graphs
    • A. Gerasoulis, T. Yang, On the granularity and clustering of directed acyclic task graphs, IEEE Trans. Parallel Distributed Syst. 4 (6) (1993) 686-701.
    • (1993) IEEE Trans. Parallel Distributed Syst. , vol.4 , Issue.6 , pp. 686-701
    • Gerasoulis, A.1    Yang, T.2


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