메뉴 건너뛰기




Volumn 2, Issue , 2004, Pages 842-848

Fast optimal task graph scheduling by means of an optimized parallel A*-Algorithm

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; DECISION THEORY; GRAPH THEORY; HEURISTIC METHODS; LOCAL AREA NETWORKS; OPTIMIZATION; PERSONAL COMPUTERS; PROBLEM SOLVING;

EID: 11844252206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (5)

References (10)
  • 1
    • 0031104514 scopus 로고    scopus 로고
    • Task assignment and transaction clustering heuristics for distributed systems
    • Aguilar, J., Gelenbe E.: Task Assignment and Transaction Clustering Heuristics for Distributed Systems, Information Sciences, Vol. 97, No. 1& 2, pp. 199-219, 1997
    • (1997) Information Sciences , vol.97 , Issue.1-2 , pp. 199-219
    • Aguilar, J.1    Gelenbe, E.2
  • 2
    • 0041848306 scopus 로고    scopus 로고
    • An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systems
    • June
    • Bansal S., Kumar P., Singh K.: An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systems, IEEE Transactions on Parallel and Distributed Systems, Vol. 14, No. 6, June 2003
    • (2003) IEEE Transactions on Parallel and Distributed Systems , vol.14 , Issue.6
    • Bansal, S.1    Kumar, P.2    Singh, K.3
  • 3
    • 84949779068 scopus 로고    scopus 로고
    • Optimal and sub-optimal reliable scheduling of precedence-constrained tasks in heterogeneous distributed computing
    • Toronto, August 21-24
    • Dogan A., Özgüner F.: Optimal and Sub-optimal reliable scheduling of precedence-constrained tasks in heterogeneous distributed computing, International Workshop on Parallel Processing, p. 429, Toronto, August 21-24, 2000
    • (2000) International Workshop on Parallel Processing , pp. 429
    • Dogan, A.1    Özgüner, F.2
  • 6
    • 0002050141 scopus 로고    scopus 로고
    • Static scheduling algorithms for allocating directed task graphs to multiprocessors
    • Kwok, Y.-K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, Vol. 31, No. 4, 1999, pp. 406-471
    • (1999) ACM Computing Surveys , vol.31 , Issue.4 , pp. 406-471
    • Kwok, Y.-K.1    Ahmad, I.2
  • 7
    • 0036538070 scopus 로고    scopus 로고
    • An optimal scheduling algorithm based on task duplication
    • April
    • Park C.-I., Choe T.Y.: An optimal scheduling algorithm based on task duplication, IEEE Transactions on Computerss, Vol. 51, No. 4, April 2002
    • (2002) IEEE Transactions on Computerss , vol.51 , Issue.4
    • Park, C.-I.1    Choe, T.Y.2


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