Cloud scheduling with setup cost

In this paper, we investigate the problem of online task scheduling of jobs such as MapReduce jobs, Monte Carlo simulations and generating search index from web documents, on cloud computing infrastructures. We consider the virtualized cloud computing setup comprising machines that host multiple identical virtual machines (VMs) under pay-as-you-go charging, and that booting a VM requires a constant setup time. The cost of job computation depends on the number of VMs activated, and the VMs can be activated and shutdown on demand. We propose a new bi-objective algorithm to minimize the maximum task delay, and the total cost of the computation. We study both the clairvoyant case, where the duration of each task is known upon its arrival, and the more realistic non-clairvoyant case.

[1]  Ronald L. Graham,et al.  Bounds for Multiprocessor Scheduling with Resource Constraints , 1975, SIAM J. Comput..

[2]  David P. Williamson,et al.  Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[3]  Anja Feldmann,et al.  Competitive Analysis of Call Admission Algorithms that Allow Delay. , 1995 .

[4]  Jirí Sgall,et al.  On-line Scheduling , 1996, Online Algorithms.

[5]  Michael A. Bender,et al.  Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.

[6]  Gerhard J. Woeginger,et al.  Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

[7]  Yossi Azar,et al.  Minimizing the flow time without migration , 1999, STOC '99.

[8]  Scheduling Algorithms , 1999, Algorithms and Theory of Computation Handbook.

[9]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

[10]  D. Atkin OR scheduling algorithms. , 2000, Anesthesiology.

[11]  Yossi Azar,et al.  Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching , 2003, SPAA '03.

[12]  Kirk Pruhs,et al.  Online scheduling , 2003 .

[13]  Cynthia Bailey Lee,et al.  Are User Runtime Estimates Inherently Inaccurate? , 2004, JSSPP.

[14]  Han Hoogeveen,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[15]  Andrei Tchernykh,et al.  Two Level Job-Scheduling Strategies for a Computational Grid , 2005, PPAM.

[16]  Stefano Leonardi,et al.  Approximating total flow time on parallel machines , 2007, J. Comput. Syst. Sci..

[17]  Uwe Schwiegelshohn,et al.  Online scheduling in grids , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[18]  U. Schwiegelshohn MISTA 2009 An Owner-centric Metric for the Evaluation of Online Job Schedules , 2009 .

[19]  Uwe Schwiegelshohn,et al.  On-line hierarchical job scheduling on grids with admissible allocation , 2010, J. Sched..

[20]  Prashant Pandey,et al.  Cloud computing , 2010, ICWET.

[21]  Uwe Schwiegelshohn,et al.  A system-centric metric for the evaluation of online job schedules , 2011, J. Sched..