Abstract
The use of virtualization technology makes software applications more scalable and cost effective when they are deployed over cloud computing platforms, but virtualization technology also brings challenges to task scheduling over cloud. The commonly used list scheduling schemes split the scheduling process into two phases: ordering and dispatching. However, majorities of recent researches about scheduling of cloud tasks concentrate on optimizing the schedulers’ performance in one phase, but seldom consider the collaborations of scheduling policies used in different phases. This paper summarizes some representative ordering and dispatching policies used in list schedulers, models the execution processes of these ordering and dispatching policies using Stochastic Petri Nets (SPN), and simulates the list scheduling process of cloud tasks. Based on the modeling and experimental results, we further evaluate which composition of ordering and dispatching policies provides optimal performance in the two-phase scheduling process of cloud tasks.
Chapter PDF
Similar content being viewed by others
References
Marty, M., Hill, M.: Virtual Hierarchies to Support Server Consolidation. In: Proceedings of the 34th Annual International Symposium on Computer Architecture, pp. 46–56 (2007)
Speitkamp, B., Bichler, M.: A mathematical programming approach for server consolidation problems in virtualized data centers. IEEE Transactions on Services Computing, 266–278 (2010)
Beloglazov, A., Buyya, R.: Energy efficient allocation of virtual machines in cloud data centers. In: 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing, pp. 577–578 (2010)
Burkimsher, A., Bate, I., Indrusiak, L.S.: A survey of scheduling metrics and an improved ordering policy for list schedulers operating on workloads with dependencies and a wide variation in execution times. In: Future Generation Computer Systems (2012, 2013)
Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems, 260–274 (2002)
Lu, X., Sitters, R.A., Stougie, L.: A class of on-line scheduling algorithms to minimize total completion time. Operations Research Letters 31(3), 232–236 (2003)
Laili, Y., et al.: A Ranking Chaos Algorithm for dual scheduling of cloud service and computing resource in private cloud. Computers in Industry, 448–463 (2013)
Oracle: N1 grid engine 6 administration guide—configuring the share-based policy (2010), http://docs.oracle.com/cd/E19080-01/n1.grid.eng6/817-5677/i999588/index.html
Östberg, P.O., Danie, E., Erik, E.: Decentralized scalable fairshare scheduling. Future Generation Computer Systems, 130–143 (2013)
Chang, H., Kodialam, M., Kompella, R.R., et al.: Scheduling in mapreduce-like systems for fast completion time. In: Proceedings of IEEE INFOCOM Conference, pp. 3074–3082 (2011)
Chen, F., Kodialam, M., Lakshman, T.V.: Joint Scheduling of Processing and Shuffle Phases in MapReduce Systems. In: Proceedings of IEEE INFOCOM Conference (2012)
Lui, J.C.S., Richard, R.M., Don, T.: Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach. IEEE Transactions on Computers 44(12), 1371–1382 (1995)
Albers, S.: Better bounds for online scheduling. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC 1997), New York, USA, pp. 130–139 (1997)
Bender, M.A., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: Proceedings of the 9th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA 1998, Philadelphia, PA, USA, pp. 270–279 (1998)
Kong, X., Lin, C., Jiang, Y., Yan, W., Chu, X.: Efficient dynamic task scheduling in virtualized data centers with fuzzy prediction. Journal of Network and Computer Applications 34(4), 1068–1077 (2011)
Calheiros, R.N., Ranjan, R., Buyya, R.: Virtual machine provisioning based on analytical performance and qos in cloud computing environments. In: IEEE ICPP (2011)
Yuan, Y., Wang, H., Wang, D.: On Interference-aware Provisioning for Cloud-based Big Data Processing. In: IEEE 20th International Workshop on Quality of Service 2013 (IWQoS 2013) (June 2013)
Jung, G., Hiltunen, M.A., Joshi, K.R., Schlichting, R.D., Pu, C.: Mistral: Dynamically Managing Power, Performance, and Adaptation Cost in Cloud Infrastructures. In: IEEE ICDCS 2010 (June 2010)
Mitzenmacher, M.: The power of two choices in randomized load balancing. Ph.D. dissertation, University of California at Berkeley (1996)
He, Y.T., Down, D.G.: Limited choice and locality considerations for load balancing. Performance Evaluation 65(9) (2008)
Lin, C., Shan, Z., Yang, Y.: Integrated schemes of request dispatching and selecting in Web server clusters. In: Proceedings of Conference on Software: Theory and Practice, 16 th World Computer Congress 2000 (WCC 2000), Beijing, China (August 2000)
Maguluri, S.T., Srikant, R., Ying, L.: Stochastic models of load balancing and scheduling in cloud computing clusters. In: Proceedings of IEEE INFOCOMM Conference (2012)
Khan, A.A., McCreary, C.L., Jones, M.S.: A comparison of multiprocessor scheduling heuristics. In: IEEE International Conference on Parallel Processing (ICPP) (1994)
Kleinrock, L.: Queueing Systems. Theory, vol. I, p. 187. John Wiley & Sons, New York (1975)
Maguluri, S.T., Srikant, R.: Scheduling Jobs with Unknown Duration in Clouds. In: IEEE INFOCOM Conference (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Xu, C., Yang, J., Fu, D., Zhang, H. (2014). Towards Optimal Collaboration of Policies in the Two-Phase Scheduling of Cloud Tasks. In: Hsu, CH., Shi, X., Salapura, V. (eds) Network and Parallel Computing. NPC 2014. Lecture Notes in Computer Science, vol 8707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44917-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-662-44917-2_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44916-5
Online ISBN: 978-3-662-44917-2
eBook Packages: Computer ScienceComputer Science (R0)