메뉴 건너뛰기




Volumn 3841 LNCS, Issue , 2006, Pages 905-910

Optimal task scheduling algorithm for non-preemptive processing system

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COSTS; DISTRIBUTED COMPUTER SYSTEMS; DYNAMIC PROGRAMMING; MATHEMATICAL MORPHOLOGY; PROBLEM SOLVING; SCHEDULING;

EID: 33745659882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11610113_93     Document Type: Conference Paper
Times cited : (2)

References (5)
  • 1
    • 0037619247 scopus 로고    scopus 로고
    • Processor allocation and task scheduling of matrix chain products on parallel systems
    • Lee, H., Kim, J., and Lee, S.: Processor allocation and Task Scheduling of Matrix Chain Products on Parallel Systems. IEEE Transaction on Parallel and Distributed Systems. Vol. 14. No. 4. (2003) 394-337.
    • (2003) IEEE Transaction on Parallel and Distributed Systems , vol.14 , Issue.4 , pp. 394-1337
    • Lee, H.1    Kim, J.2    Lee, S.3
  • 2
    • 0036160959 scopus 로고    scopus 로고
    • A fast and efficient processor allocation scheme for mesh-connected multicomputers
    • Yoo, B and Das., C: A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers. IEEE Transactions on Computers. (2002) 46-60.
    • (2002) IEEE Transactions on Computers , pp. 46-60
    • Yoo, B.1    Das, C.2


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