Energy-Aware Multi-Organization Scheduling Problem
Scheduling algorithms for shared platforms such as grids and clouds granted users of different organizations access to powerful resources and may improve machine utilization; however, this can also increase operational costs of less-loaded organizations.
We consider energy as a resource, where the objective is to optimize the total energy consumption without increasing the energy spent by a selfish organization. We model the problem as a energy-aware variant of the Multi-Organization Scheduling Problem that we call MOSP-energy.
We show that the clairvoyant problem with variable speed processors and jobs with release dates and deadlines is NP-hard and also that being selfish can cause solutions at most mα − 1 far from the optimal, where m is the number of machines and α > 1 is a constant. Finally, we present efficient heuristics for scenarios with all jobs ready from the beginning.
- 1.Albers, S., Antoniadis, A., Greiner, G.: On multi-processor speed scaling with migration. In: ACM Symposium on Parallelism in Algorithms and Architectures, pp. 279–288 (2011)Google Scholar
- 2.Albers, S., Müller, F., Schmelzer, S.: Speed scaling on parallel processors. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 289–298 (2007)Google Scholar
- 3.Cohen, J., Cordeiro, D., Trystram, D., Wagner, F.: Coordination mechanisms for selfish multi-organization scheduling. In: IEEE International Conference on High Performance Computing, pp. 1–9 (December 2011)Google Scholar
- 6.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (January 1979)Google Scholar
- 7.Iosup, A., Dumitrescu, C., Epema, D., Li, H., Wolters, L.: How are real grids used? The analysis of four grid traces and its implications. In: 7th IEEE/ACM International Conference on Grid Computing, pp. 262–269 (September 2006)Google Scholar
- 9.Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Symposium on Foundations of Computer Science, pp. 374–382. IEEE (1995)Google Scholar