Abstract
Scheduling of user tasks is a very complicated process in cloud computing environment. Min-min algorithm shortcoming is the long tasks may not be scheduled. Therefore, this paper puts forward an improved min-min algorithm that not only based on the min-min algorithm but also the three constraints. The three constraints are quality of service, the dynamic priority model and the cost of service. By using the software CloudSim to run the simulation experiment. Compared with the traditional min-min algorithm, the experimental results show it can make long tasks execute at reasonable time, increase resource utilization rate and meet users’ requirements.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Calheiros, R.N., Rajiv, De Rose, C.A.F., Buyya, R.: Cloudsim: A Novel Framework for Modeling and Simulation of Cloud Computing Infrastructures and Services, http://www.gridbus.org/reports/CloudSim-ICPP2009.pdf
China cloud computing. Peng Liu:cloud computing definition and characteristics, http://www.chinacloud.cn/.2009-2-25
Buyya, R., Yeo, C.S., Venugopal, S., Broberg, J., Brandic, I.: Cloud Computing and Emerging IT Platforms: Vision, Hype, and Reality for Delivering Computing as the 5th Utility. Future Generation Computer Systems 25(6), 599–616 (2009)
Braun, T.D., Siegenl, H.J., Beck, N.: A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. Journal of Parrallel and Distributed Computing, 801–837 (2001)
Shan, H.X., He, S.X., Gregor, V.L.: QoS Guided Min-Min Heuristic for Grid Task Scheduling. Journal of Computer Science and Technology 18(4), 442–451 (2003)
Deng, J.: User-oriented job fair scheduling algorithm of Cluster system. Beijing University of Posts and Telecommunications, Beijing (2008)
Ding, M.: Improved Min-Min algorithm in grid computing. Northwestern University (2010) TP393.01
Howell, F., Mcnab, R.: SimJava: A discrete event simulation library for java. In: Proceedings of the first International Conference on Web-Based Modeling and Simulation (1998)
Zhao, C.: Job Scheduling Algorithm Research and Implementation of the cloud environment. Jiaotong University, Beijing (2009) TP393.01
GRIDS Laboratory, http://www.gridbus.org.cloud
Jasso, G.: The Theory of the Distributive-Justice Force in Human Affairs:Analyzing the Three Central Questions. In: Sociological Theories in Progress:New Formulation, pp. 354–387. Sage Pub., Newbury Park (1989)
Braun, T.D., Siegenl, H.J., Beck, N.: A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. Journal of Parrallel and Distributed Computing, 801–837 (2001)
Bharadwaj, V., Ghose, D., Robertazzi, T.G.: Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems. Cluster Comput. 6(1), 7–17 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, G., Li, J., Xu, J. (2013). An Improved Min-Min Algorithm in Cloud Computing. In: Du, Z. (eds) Proceedings of the 2012 International Conference of Modern Computer Science and Applications. Advances in Intelligent Systems and Computing, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33030-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-33030-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33029-2
Online ISBN: 978-3-642-33030-8
eBook Packages: EngineeringEngineering (R0)