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

被引:230
作者
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
相关论文
共 39 条
[1]  
[Anonymous], 2010, 2010 IEEE 3 INT C CL
[2]  
[Anonymous], 2010, Int. J. Eng. Inf. Technol
[3]  
[Anonymous], 2011, POLICY DRIVEN SERVIC
[4]   On the improved performances of the particle swarm optimization algorithms with adaptive parameters, cross-over operators and root mean square (RMS) variants for computing optimal control of a class of hybrid systems [J].
Arumugam, M. Senthil ;
Rao, M. V. C. .
APPLIED SOFT COMPUTING, 2008, 8 (01) :324-336
[5]  
Bean J. C., 1994, ORSA Journal on Computing, V6, P154, DOI 10.1287/ijoc.6.2.154
[6]   Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility [J].
Buyya, Rajkumar ;
Yeo, Chee Shin ;
Venugopal, Srikumar ;
Broberg, James ;
Brandic, Ivona .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2009, 25 (06) :599-616
[7]  
Chaisiri S., Services Computing Conference, 2009. APSCC 2009. IEEE Asia-Pacific, P103, DOI DOI 10.1109/APSCC.2009.5394134
[8]   Optimal PSO for collective robotic search applications [J].
Doctor, S ;
Venayagamoorthy, GK ;
Gudise, VG .
CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, :1390-1395
[9]   A particle swarm optimizer with passive congregation [J].
He, S ;
Wu, QH ;
Wen, JY ;
Saunders, JR ;
Paton, RC .
BIOSYSTEMS, 2004, 78 (1-3) :135-147
[10]  
Hu XH, 2002, IEEE C EVOL COMPUTAT, P1677, DOI 10.1109/CEC.2002.1004494