@inproceedings{79ff836abd374aaebf2558ce6cdfa1ec,
title = "Cloud scheduling with setup cost",
abstract = "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 payas-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.",
keywords = "Clairvoyant, Cloud computing, Competitive ratio, Non-clairvoyant, Online algorithms, Scheduling",
author = "Yossi Azar and Devanur, {Nikhil R.} and Navendu Jain",
year = "2013",
language = "الإنجليزيّة",
isbn = "9781450315722",
series = "Annual ACM Symposium on Parallelism in Algorithms and Architectures",
pages = "298--304",
booktitle = "SPAA 2013 - Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures",
note = "25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013 ; Conference date: 23-07-2013 Through 25-07-2013",
}