메뉴 건너뛰기




Volumn 30, Issue 1, 2000, Pages 145-160

Preemptive scheduling of parallel jobs on multiprocessors

Author keywords

Competitive analysis; Parallel programs; Processor scheduling; Unknown information

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; SCHEDULING; THEOREM PROVING;

EID: 0034457296     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797315598     Document Type: Article
Times cited : (15)

References (38)
  • 15
    • 0024068822 scopus 로고
    • Measuring parallelism in computation-intensive scientific/engineering applications
    • (1988) IEEE Trans. Comput. , vol.37 , pp. 1088-1098
    • Kumar, M.1
  • 37
    • 0003677860 scopus 로고
    • Processor scheduling in multiprogrammed shared-memory NUMA multiprocessors
    • M.Sc. Thesis, University of Toronto, Toronto, ON, Canada, October
    • (1993)
    • Wu, C.1


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