메뉴 건너뛰기




Volumn 1, Issue , 2007, Pages 542-549

Randomized load balancing with non-uniform task lengths

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK MANAGEMENT; OPTIMIZATION; SCHEDULING;

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

References (11)
  • 1
    • 0022712930 scopus 로고
    • Probabilistic bounds on the performance of list scheduling
    • J. Bruno and P. Downey. Probabilistic bounds on the performance of list scheduling. SIAM Journal on Computing, 15(2):409-417, 1986.
    • (1986) SIAM Journal on Computing , vol.15 , Issue.2 , pp. 409-417
    • Bruno, J.1    Downey, P.2
  • 4
    • 0019552967 scopus 로고
    • Expected length of the longest probe sequence in hash code searching
    • G.H. Gonnet. Expected length of the longest probe sequence in hash code searching. Journal of the ACM, 28(2):289-304, 1981.
    • (1981) Journal of the ACM , vol.28 , Issue.2 , pp. 289-304
    • Gonnet, G.H.1
  • 5
    • 84944813080 scopus 로고
    • Bounds for certain multiprocessing anomalies
    • R.L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45(9):1563-1581, 1966.
    • (1966) Bell System Technical Journal , vol.45 , Issue.9 , pp. 1563-1581
    • Graham, R.L.1
  • 6
    • 0014477093 scopus 로고
    • Bounds on multiprocessing timing anomalies
    • R.L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Math., 17(2):416-429, 1969.
    • (1969) SIAM Journal on Applied Math. , vol.17 , Issue.2 , pp. 416-429
    • Graham, R.L.1
  • 11
    • 84958683395 scopus 로고    scopus 로고
    • "Balls into bins" - A simple and tight analysis
    • M. Raab and A. Steger. "Balls into bins" - A simple and tight analysis. Lecture Notes in Computer Science, 1518:159-170, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1518 , pp. 159-170
    • Raab, M.1    Steger, A.2


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