메뉴 건너뛰기




Volumn , Issue , 2008, Pages 15-24

Scheduling divisible real-time loads on clusters with varying processor start times

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS; EMBEDDED SYSTEMS;

EID: 53449102965     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTCSA.2008.23     Document Type: Conference Paper
Times cited : (22)

References (9)
  • 3
    • 51249181779 scopus 로고
    • A new polynomial-time algorithm for linear programming
    • N. Karmakar. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373-395, 1984.
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmakar, N.1
  • 4
    • 0000564361 scopus 로고
    • A polynomial algorithm in linear programming
    • L. Khachiyan. A polynomial algorithm in linear programming. Dokklady Akademiia Nauk SSSR, 244:1093-1096, 1979.
    • (1979) Dokklady Akademiia Nauk SSSR , vol.244 , pp. 1093-1096
    • Khachiyan, L.1
  • 5
    • 34548110076 scopus 로고    scopus 로고
    • Real-time divisible load scheduling for cluster computing
    • Technical Report UNL-CSE-2006-0016, Department of Computer Science and Engineering, The University of Nebraska at Lincoln
    • X. Lin, Y. Lu, J. Deogun, and S. Goddard. Real-time divisible load scheduling for cluster computing. Technical Report UNL-CSE-2006-0016, Department of Computer Science and Engineering, The University of Nebraska at Lincoln, 2006.
    • (2006)
    • Lin, X.1    Lu, Y.2    Deogun, J.3    Goddard, S.4


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