Self-Adaptive Learning PSO-Based Deadline Constrained Task Scheduling for Hybrid IaaS Cloud

被引:227
|
作者
Zuo, Xingquan [1 ]
Zhang, Guoxiang [2 ]
Tan, Wei [3 ]
机构
[1] Beijing Univ Posts & Telecommun, Comp Sch, Beijing 100876, Peoples R China
[2] Chinese Acad Sci, Inst Microelect, Beijing 100029, Peoples R China
[3] IBM TJ Watson Res Ctr, Yorktown Hts, NY 10598 USA
关键词
Hybrid cloud; infrastructure as a service (IaaS) cloud; particle swarm optimization (PSO); task scheduling; PARTICLE SWARM OPTIMIZER; MANAGEMENT;
D O I
10.1109/TASE.2013.2272758
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Public clouds provide Infrastructure as a Service (IaaS) to users who do not own sufficient compute resources. IaaS achieves the economy of scale by multiplexing, and therefore faces the challenge of scheduling tasks to meet the peak demand while preserving Quality-of-Service (QoS). Previous studies proposed proactive machine purchasing or cloud federation to resolve this problem. However, the former is not economic and the latter for now is hardly feasible in practice. In this paper, we propose a resource allocation framework in which an IaaS provider can outsource its tasks to External Clouds (ECs) when its own resources are not sufficient to meet the demand. This architecture does not require any formal inter-cloud agreement that is necessary for the cloud federation. The key issue is how to allocate users' tasks to maximize the profit of IaaS provider while guaranteeing QoS. This problem is formulated as an integer programming (IP) model, and solved by a self-adaptive learning particle swarm optimization (SLPSO)-based scheduling approach. In SLPSO, four updating strategies are used to adaptively update the velocity of each particle to ensure its diversity and robustness. Experiments show that, SLPSO can improve a cloud provider's profit by 0.25%-11.56% compared with standard PSO; and by 2.37%-16.71% for problems of nontrivial size compared with CPLEX under reasonable computation time.
引用
收藏
页码:564 / 573
页数:10
相关论文
共 50 条
  • [21] Catfish-PSO based scheduling of scientific workflows in IaaS cloud
    S. Jaya Nirmala
    S. Mary Saira Bhanu
    Computing, 2016, 98 : 1091 - 1109
  • [22] Catfish-PSO based scheduling of scientific workflows in IaaS cloud
    Nirmala, S. Jaya
    Bhanu, S. Mary Saira
    COMPUTING, 2016, 98 (11) : 1091 - 1109
  • [23] A Course Scheduling Algorithm Based on Self-Adaptive Constrained Particle Swarm
    Cui Wei
    Long Xiaohong
    INTERNATIONAL SEMINAR ON APPLIED PHYSICS, OPTOELECTRONICS AND PHOTONICS (APOP 2016), 2016, 61
  • [24] A Self-adaptive Immune PSO Algorithm for Constrained Optimization Problems
    Ouyang, Aijia
    Zhou, Guo
    Zhou, Yongquan
    COMPUTATIONAL INTELLIGENCE AND INTELLIGENT SYSTEMS, 2010, 107 : 208 - +
  • [25] A SELF-ADAPTIVE HYBRID ALGORITHM OF PSO AND BFGS METHOD
    Wu Junqiang
    Ouyang Aijia
    Liu Libin
    2012 INTERNATIONAL CONFERENCE ON INDUSTRIAL CONTROL AND ELECTRONICS ENGINEERING (ICICEE), 2012, : 1690 - 1693
  • [26] Self-adaptive, Deadline-aware Resource Control in Cloud Computing
    Xiang, Yu
    Balasubramanian, Bharath
    Wang, Michael
    Lan, Tian
    Sen, Soumya
    Chiang, Mung
    2013 IEEE SEVENTH INTERNATIONAL CONFERENCE ON SELF-ADAPTATION AND SELF-ORGANIZING SYSTEMS WORKSHOPS (SASOW), 2014, : 42 - 47
  • [27] A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems
    Zhang, Le
    Wu, Jinnan
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [28] Deadline and Cost based Workflow Scheduling in Hybrid Cloud
    Chopra, Nitish
    Singh, Sarbjeet
    2013 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2013, : 840 - 846
  • [29] An Intensify Deadline Aware Credit Based Cloud Task Scheduling
    Chauhan, Pankaj Kumar
    Jaglan, Payal
    Dabas, Poonam
    2016 IEEE INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND AUTOMATION (ICCCA), 2016, : 1267 - 1270
  • [30] A PSO-based task scheduling algorithm improved using a load-balancing technique for the cloud computing environment
    Ebadifard, Fatemeh
    Babamir, Seyed Morteza
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2018, 30 (12):