Mean-field Macro Computation in Large-scale Cloud Service Systems with Resource Management and Job Scheduling

被引:2
作者
Yang, Feifei [1 ]
Jiang, Yanping [1 ]
Li, Quanlin [2 ]
机构
[1] Northeastern Univ, Sch Business Adm, Shenyang 110167, Liaoning, Peoples R China
[2] Beijing Univ Technol, Sch Econ & Management, Beijing 100124, Peoples R China
基金
中国国家自然科学基金;
关键词
Large-scale cloud service system; resource management; job scheduling; supermarket model; work stealing model; scheduling of public reserved resource; SIMULATION;
D O I
10.1007/s11518-018-5399-z
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Service computing is an emerging and distributed computing mode in cloud service systems, and has become an interesting research direction for both academia and industry. Note that the cloud service systems always display new characteristics, such as stochasticity, large scale, loose coupling, concurrency, non-homogeneity and heterogeneity, thus their load balancing investigation has been more interesting, difficult and challenging until now. By using resource management and job scheduling, this paper proposes an integrated, real-time and dynamic control mechanism for large-scale cloud service systems and their load balancing through combining supermarket models with not only work stealing models but also scheduling of public reserved resource. To this end, this paper provides a novel stochastic model with weak interactions by means of nonlinear Markov processes. To overcome theoretical difficulties growing out of the state explosion in high-dimensional stochastic systems, this paper applies the mean-field theory to develop a macro computational technique in terms of an infinite-dimensional system of mean-field equations. Furthermore, this paper proves the asymptotic independence of the large-scale cloud service system, and show how to compute the fixed point by virtue of an infinite-dimensional system of nonlinear equations. Based on the fixed point, this paper provides effective numerical computation for performance analysis of this system under a high approximate precision. Therefore, we hope that the methodology and results given in this paper can be applicable to the study of more general large-scale cloud service systems.
引用
收藏
页码:238 / 261
页数:24
相关论文
共 40 条
  • [1] [Anonymous], 1996, THESIS U CALIFORNIA
  • [2] Anselmi J, 2009, 13 INT C PRINC DISTR
  • [3] The natural work-stealing algorithm is stable
    Berenbrink, P
    Friedetzky, T
    Goldberg, LA
    [J]. SIAM JOURNAL ON COMPUTING, 2003, 32 (05) : 1260 - 1279
  • [4] BLUMOFE R, 1965, JOURNAL OF THE ACM, V46, P720, DOI DOI 10.1145/324133.324234
  • [5] DECAY OF TAILS AT EQUILIBRIUM FOR FIFO JOIN THE SHORTEST QUEUE NETWORKS
    Bramson, Maury
    Lu, Yi
    Prabhakar, Balaji
    [J]. ANNALS OF APPLIED PROBABILITY, 2013, 23 (05) : 1841 - 1878
  • [6] Asymptotic independence of queues under randomized load balancing
    Bramson, Maury
    Lu, Yi
    Prabhakar, Balaji
    [J]. QUEUEING SYSTEMS, 2012, 71 (03) : 247 - 292
  • [7] Bramson M, 2010, PERF E R SI, V38, P275, DOI 10.1145/1811099.1811071
  • [8] CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms
    Calheiros, Rodrigo N.
    Ranjan, Rajiv
    Beloglazov, Anton
    De Rose, Cesar A. F.
    Buyya, Rajkumar
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 2011, 41 (01) : 23 - 50
  • [9] Ethier Stewart N, 2009, MARKOV PROCESSES CHA
  • [10] Gast N, 2010, PERF E R SI, V38, P13, DOI 10.1145/1811099.1811042