메뉴 건너뛰기




Volumn 38, Issue 1 SPEC. ISSUE, 2010, Pages 13-24

A mean field model of work stealing in large-scale systems

Author keywords

Grid computing; Load balancing; Mean field

Indexed keywords

AVERAGE RESPONSE TIME; COMPUTATIONAL GRIDS; GENERIC MODELS; HETEROGENEOUS SYSTEMS; HOMOGENEOUS PROCESSORS; JOB ALLOCATION; KEY ISSUES; MARKOVIAN MODEL; MEAN FIELD; MEAN FIELD MODELS; PERFORMANCE EVALUATION; PERFORMANCE FUNCTIONS;

EID: 77954912766     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1811099.1811042     Document Type: Conference Paper
Times cited : (76)

References (22)
  • 4
    • 0040249270 scopus 로고    scopus 로고
    • Recursive algorithms, urn processes and chaining number of chain recurrent sets
    • M. Benaim. Recursive algorithms, urn processes and chaining number of chain recurrent sets. Ergodic Theory and Dynamical Systems, 18(01):53-87, 1998.
    • (1998) Ergodic Theory and Dynamical Systems , vol.18 , Issue.1 , pp. 53-87
    • Benaim, M.1
  • 5
    • 0036590677 scopus 로고    scopus 로고
    • Online scheduling of parallel programs on heterogeneous systems with applications to cilk
    • Special issue on SPA00
    • M. Bender and M. Rabib. Online scheduling of parallel programs on heterogeneous systems with applications to cilk. Theory of Computing Systems, 35:289-304, 2002. Special issue on SPA00.
    • (2002) Theory of Computing Systems , vol.35 , pp. 289-304
    • Bender, M.1    Rabib, M.2
  • 6
    • 0344584867 scopus 로고    scopus 로고
    • The natural work-stealing algorithm is stable
    • P. Berenbrink, T. Friedetzky, and L. Goldberg. The natural work-stealing algorithm is stable. SIAM J. Comput., 32(5):1260-1279, 2003.
    • (2003) SIAM J. Comput. , vol.32 , Issue.5 , pp. 1260-1279
    • Berenbrink, P.1    Friedetzky, T.2    Goldberg, L.3
  • 12
    • 51049122237 scopus 로고    scopus 로고
    • The foundations for scalable multi-core software in intel threading building blocks
    • A. Kukanov and M. Voss. The foundations for scalable multi-core software in intel threading building blocks. Intel Technology Journal, 11(4):309-322, 2007.
    • (2007) Intel Technology Journal , vol.11 , Issue.4 , pp. 309-322
    • Kukanov, A.1    Voss, M.2
  • 16
    • 0347012192 scopus 로고
    • A central limit theorem for Markov processes that move by small steps
    • M. Norman. A central limit theorem for Markov processes that move by small steps. The Annals of Probability, 2(6):1065-1074, 1974.
    • (1974) The Annals of Probability , vol.2 , Issue.6 , pp. 1065-1074
    • Norman, M.1
  • 18
    • 85044029628 scopus 로고
    • Analysis of task migration in shared-memory multiprocessor scheduling
    • M. Squillante and R. Nelson. Analysis of task migration in shared-memory multiprocessor scheduling. SIGMETRICS Perf. Eval. Rev., 19(1):143-155, 1991.
    • (1991) SIGMETRICS Perf. Eval. Rev. , vol.19 , Issue.1 , pp. 143-155
    • Squillante, M.1    Nelson, R.2
  • 20
    • 70349977430 scopus 로고    scopus 로고
    • Mean field asymptotic of markov decision evolutionary games and teams
    • H. Tembine, J.-Y. Le Boudec, R. El-Azouzi, and E. Altman. Mean Field Asymptotic of Markov Decision Evolutionary Games and Teams. GameNets, 2009.
    • (2009) GameNets
    • Tembine, H.1    Le Boudec, J.-Y.2    El-Azouzi, R.3    Altman, E.4
  • 21
    • 0034819553 scopus 로고    scopus 로고
    • Efficient load balancing for wide-area divide-and-conquer applications
    • R. Van Nieuwpoort, T. Kielmann, and H. Bal. Efficient load balancing for wide-area divide-and-conquer applications. ACM SIGPLAN, 36(7):34-43, 2001.
    • (2001) ACM SIGPLAN , vol.36 , Issue.7 , pp. 34-43
    • Van Nieuwpoort, R.1    Kielmann, T.2    Bal, H.3


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