Backup or Not: An Online Cost Optimal Algorithm for Data Analysis Jobs Using Spot Instances

被引:4
|
作者
Lin, Liduo [1 ]
Pan, Li [1 ]
Liu, Shijun [1 ]
机构
[1] Shandong Univ, Sch Software, Jinan 250101, Peoples R China
来源
IEEE ACCESS | 2020年 / 8卷
关键词
Spot instance; online algorithm; back up; abrupt termination; BIG DATA;
D O I
10.1109/ACCESS.2020.3014978
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recently, large-scale public cloud providers begin to offer spot instances. This type of instance has become popular with more and more cloud users in the light of its convenient access mode and low price, especially for those big data analysis jobs with high performance computation requirements. However, using spot instances may carry the risk of being interrupted and lead to extra costs for job re-executions because these instances are generally unstable. Yet, such cost can be greatly reduced if a backup can be made at the right time before interruptions. For convenience and cost efficiency, users can choose the StaaS (Storage-as-a-Service) storage provided by the same cloud provider, whose spot instances are used by the users, to store backup data files for future job execution recovery. Since making backups too often will incur increased costs, users need to make the backup decisions appropriately considering the condition when an abrupt interruption will occur in the future. However, it is hard to know or predict precisely when such an interruption will occur. For solving this problem, in this article, we propose an online algorithm to guide cloud users to make backups when using spot instances to execute big data analysis jobs, without requiring any information about future interruptions. We prove theoretically that our proposed online algorithm can guarantee a bounded competitive ratio less than 2. Finally, according to extensive experiments, we verify the effectiveness of our online algorithm in reducing the additional cost caused by interruptions in using spot instances and find that our online algorithm can still achieve a stable cost optimization even if interruptions occur frequently.
引用
收藏
页码:144945 / 144956
页数:12
相关论文
共 50 条
  • [31] Cost Analysis in Online Teaching Using an Activity Map
    Segovia-Garcia, Nuria
    Martin-Caro, Ester
    [J]. EDUCATION SCIENCES, 2023, 13 (05):
  • [32] Cost–benefit analysis for optimal DG placement in distribution systems by using elephant herding optimization algorithm
    Prasad, C. Hari
    Subbaramaiah, K.
    Sujatha, P.
    [J]. Renewables: Wind, Water, and Solar, 2019, 6 (01):
  • [33] Computational Cost Analysis and Data-Driven Predictive Modeling of Cloud-Based Online-NILM Algorithm
    Asres, Mulugeta Weldezgina
    Ardito, Luca
    Patti, Edoardo
    [J]. IEEE TRANSACTIONS ON CLOUD COMPUTING, 2022, 10 (04) : 2409 - 2423
  • [34] Optimal Power and Cost on Placement of Wind Turbines using Firefly Algorithm
    Hendrawati, Dwiana
    Soeprijanto, Adi
    Ashari, Mochamad
    [J]. 2015 INTERNATIONAL CONFERENCE ON SUSTAINABLE ENERGY ENGINEERING AND APPLICATION (ICSEEA), 2015, : 59 - 64
  • [35] Cost-efficient disaster backup for multiple data centers using capacity-constrained multicast
    Li, Xiaole
    Wang, Hua
    Yi, Shanwen
    Zhai, Linbo
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2019, 31 (17):
  • [36] Optimal spot pricing in electricity market with inelastic load using constrained bat algorithm
    Murali, M.
    Kumari, M. Sailaja
    Sydulu, M.
    [J]. INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2014, 62 : 897 - 911
  • [37] Carbon-Aware Power Optimal Online Algorithm for Green Cloud Data Center
    碳感知的绿色云数据中心能源优化在线算法
    [J]. 2018, Univ. of Electronic Science and Technology of China (47):
  • [38] An algorithm for mapping burnt areas in Australia using SPOT-VEGETATION data
    Stroppiana, D
    Tansey, K
    Grégoire, JM
    Pereira, JMC
    [J]. IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2003, 41 (04): : 907 - 909
  • [39] Online Heuristically Planning for Relative Optimal Paths Using a Stochastic Algorithm for USVs
    Wen, Naifeng
    Zhang, Rubo
    Liu, Guanqun
    Wu, Junwei
    [J]. JOURNAL OF NAVIGATION, 2020, 73 (02): : 485 - 508
  • [40] Data object optimal manipulation on data base using merging algorithm(DOOMDUMA)
    Agrawal, Ekta
    Nair, Sreeja
    [J]. 2013 FOURTH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS AND NETWORKING TECHNOLOGIES (ICCCNT), 2013,