isrjournals
User Sign in    Editor Sign in

elastic provisioning of resources in cloud enviroment

Abdul bari.T,Srinivasan O.G,Sivapriya.S

Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology

ISSN: 2321-3337          Impact Factor:1.521         Volume:6         Issue:3         Year: 27 March,2017         Pages:1263-1269

International Journal of Advanced Research in Computer Science Engineering and Information Technology

Abstract

With the booming cloud computing industry, computational resources are readily and elastically available to the customers. In order to attract customers with various demands, most Infrastructure-as-a-service (IaaS) cloud service providers offer several pricing strategies such as pay as you go, pay less per unit when you use more (so called volume discount), and pay even less when you reserve. The diverse pricing schemes among different IaaS service providers or even in the same provider form a complex economic landscape that nurtures the market of cloud brokers. By strategically scheduling multiple customers resource requests, a cloud broker can fully take advantage of the discounts offered by cloud service providers. In this paper, we focus on how a broker can help a group of customers to fully utilize the volume discount pricing strategy offered by cloud service providers through cost-efficient online resource scheduling. We present a randomized online stack-centric scheduling algorithm (ROSA) and theoretically prove the lower bound of its competitive ratio. Three special cases of the offline concave cost scheduling problem and the corresponding optimal algorithms are introduced. Our simulation shows that ROSA achieves a competitive ratio close to the theoretical lower bound under the special cases. Trace-driven simulation using Google cluster data demonstrates that ROSA is superior to the conventional online scheduling algorithms in terms of cost saving.

Kewords

authentication, allocation, scheduling, payment, discount,ROSA Algorithm,Job scheduling.

Reference

[1] Online Resource Scheduling Under Concave Pricing for Cloud Computing Rui Zhang, Kui Wu, Minming Li, and Jianping Wang,Apr.2016. [2] Amazon. Amazon elastic compute cloud (amazon ec2) [Online]. Available: http://aws.amazon.com/cn/ec2/, Apr. 2015. [3] L. Andrew, A. Wierman, and A. Tang, “Optimal speed scaling under arbitrary power functions,” ACM SIGMETRICS Perform. Eval. Rev., vol. 37, no. 2, pp. 39–41, 2009. [4] A. Antoniadis and C.-C. Huang, “Non-preemptive speed scaling,” J. Scheduling, vol. 16, no. 4, pp. 385–394, 2013. [5] Apache. Apache hadoop [Online]. Available: http://hadoop. apache.org/, Apr. 2015. [6] N. Bansal, H. Chan, and K. Pruhs, “Speed scaling with an arbitrary power function,” in Proc. 20th Annu. ACM-SIAM Symp. Discrete Algorithms, 2009, pp. 693–701. [7] A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. New York, NY, USA: Cambridge Univ. Press, 1998. [8] J. Chang, H. Gabow, and S. Khuller, “A model for minimizing active processor time,” in Proc. 20th Annu. Eur. Symp., 2012, pp. 289–300. [9] P. Charalampous. Increasing the adoption rates of cloud computing [Online]. Available: http://www.academia.edu/3400195/ Increasing_the_adoption_rates_of_cloud_computing, Apr. 2015.