Sleep Management on Multiple Machines for Energy and Flow Time
In large data centers, determining the right number of operating machines is often non-trivial, especially when the workload is unpredictable. Using too many machines would waste energy, while using too few would affect the performance. This paper extends the traditional study of online flow-time scheduling on multiple machines to take sleep management and energy into consideration. Specifically, we study online algorithms that can determine dynamically when and which subset of machines should wake up (or sleep), and how jobs are dispatched and scheduled. We consider schedules whose objective is to minimize the sum of flow time and energy, and obtain O(1)-competitive algorithms for two settings: one assumes machines running at a fixed speed, and the other allows dynamic speed scaling to further optimize energy usage.
Like the previous work on the tradeoff between flow time and energy, the analysis of our algorithms is based on potential functions. What is new here is that the online and offline algorithms would use different subsets of machines at different times, and we need a more general potential analysis that can consider different match-up of machines.
KeywordsCompetitive Ratio Online Algorithm Competitive Algorithm Multiple Machine Speed Scaling
Unable to display preview. Download preview PDF.
- 4.Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. In: Proc. SPAA, pp. 11–18 (2003)Google Scholar
- 5.Bansal, N., Chan, H.L., Pruhs, K.: Speed scaling with an arbitrary power function. In: Proc. SODA, pp. 693–701 (2009)Google Scholar
- 6.Chekuri, C., Goel, A., Khanna, S., Kumar, A.: Multi-processor scheduling to minimize flow time with ε resource augmentation. In: Proc. STOC, pp. 363–372 (2004)Google Scholar
- 9.Greiner, G., Nonner, T., Souza, A.: The bell is ringing in speed-scaled multiprocessor scheduling. In: Proc. SPAA, pp. 11–18 (2009)Google Scholar
- 10.Khuller, S., Li, J., Saha, B.: Energy efficient scheduling via partial shutdown. In: Proc. SODA, pp. 1360–1372 (2010)Google Scholar
- 12.Lam, T.W., Lee, L.K., To, I., Wong, P.: Competitive non-migratory scheduling for flow time and energy. In: Proc. SPAA, pp. 256–264 (2008)Google Scholar
- 14.Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Handbook of Scheduling: Algorithms, Models and Performance Analysis, pp. 15-1–15-41. CRC Press, Boca Raton (2004)Google Scholar
- 15.U.S. Environmental Protection Agency. EPA Report on server and data center energy efficiency (2007)Google Scholar
- 16.Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Proc. FOCS, pp. 374–382 (1995)Google Scholar