Cost-Minimizing Preemptive Scheduling of MapReduce Workloads on Hybrid Clouds

被引:0
|
作者
Qiu, Xuanjia [1 ]
Yeow, Wai Leong [2 ]
Wu, Chuan [1 ]
Lau, Francis C. M. [1 ]
机构
[1] Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[2] Inst INFOCOMM Res, Singapore, Singapore
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
MapReduce has become the dominant programming model for processing massive amounts of data on cloud platforms. More and more enterprises are now utilizing hybrid clouds, consisting of private infrastructure owned by themselves and public clouds such as Amazon EC2, to process their spiky MapReduce workloads, which fully utilize their own on-premise resources while outsourcing the tasks only when needed. With disparate workloads of different MapReduce tasks, an efficient scheduling mechanism is in need to enable efficient utilization of the on-premise resources and to minimize the task outsourcing cost, while meeting the task completion time requirements as well. In this paper, a fine-grained model is described to characterize the scheduling of heterogeneous MapReduce workloads, and an online algorithm is proposed for joint task admission control into the private cloud, task outsourcing to the public cloud, and VM allocation to execute the admitted tasks on the private cloud, such that the time-averaged task outsourcing cost is minimized over the long run. The online algorithm features preemptive scheduling of the tasks, where a task executed partially on the on-premise infrastructure can be paused and scheduled to run later. It also achieves desirable properties such as meeting a pre-set task admission ratio and bounding the worst-case task completion time, as proven by our rigorous theoretical analysis.
引用
收藏
页码:213 / 218
页数:6
相关论文
共 50 条
  • [21] Interactive object retrieval via cost-minimizing queries
    Wu, Weining
    [J]. APPLIED SOFT COMPUTING, 2018, 69 : 453 - 463
  • [22] EXISTENCE OF COST-MINIMIZING SYSTEMS WITHIN THE SRAFFA FRAMEWORK
    SALVADORI, N
    [J]. ZEITSCHRIFT FUR NATIONALOKONOMIE-JOURNAL OF ECONOMICS, 1982, 42 (03): : 281 - 298
  • [23] COST-MINIMIZING NUMBER OF FIRMS AND DETERMINATION OF INDUSTRY STRUCTURE
    BAUMOL, WJ
    FISCHER, D
    [J]. QUARTERLY JOURNAL OF ECONOMICS, 1978, 92 (03): : 439 - 467
  • [24] DERIVATION OF COST-MINIMIZING DEPTH FOR LATERAL PIPE DRAINS
    BOUMANS, JH
    SMEDEMA, LK
    [J]. AGRICULTURAL WATER MANAGEMENT, 1986, 12 (1-2) : 41 - 51
  • [25] Online MapReduce scheduling problem of minimizing the makespan
    Cong Chen
    Yinfeng Xu
    Yuqing Zhu
    Chengyu Sun
    [J]. Journal of Combinatorial Optimization, 2017, 33 : 590 - 608
  • [26] STOCHASTIC SPECIFICATION IN RANDOM PRODUCTION MODELS OF COST-MINIMIZING FIRMS
    BROWN, BW
    WALKER, MB
    [J]. JOURNAL OF ECONOMETRICS, 1995, 66 (1-2) : 175 - 205
  • [27] Online MapReduce scheduling problem of minimizing the makespan
    Chen, Cong
    Xu, Yinfeng
    Zhu, Yuqing
    Sun, Chengyu
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (02) : 590 - 608
  • [28] Selecting cost-minimizing herbicide programs for corn (Zea mays)
    Olsen, JR
    Harper, JK
    Curran, WS
    [J]. WEED TECHNOLOGY, 1996, 10 (02) : 327 - 336
  • [29] Online scheduling of deadline-constrained bag-of-task workloads on hybrid clouds
    Pelaez, Victor
    Campos, Antonio
    Garcia, Daniel F.
    Entrialgo, Joaquin
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2018, 30 (19):
  • [30] An efficient solution method to design the cost-minimizing platform portfolio
    Van den Broeke, Maud
    Boute, Robert
    Cardoen, Brecht
    Samii, Behzad
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 259 (01) : 236 - 250