Article ID: | iaor2012923 |
Volume: | 15 |
Issue: | 1 |
Start Page Number: | 105 |
End Page Number: | 116 |
Publication Date: | Feb 2012 |
Journal: | Journal of Scheduling |
Authors: | Lam Tak-Wah, Lee Lap-Kei, To Isaac, Wong Prudence |
Keywords: | scheduling, networks: flow, combinatorial optimization |
Energy usage has been an important concern in recent research on online scheduling. In this paper, we study the tradeoff between flow time and energy (Albers and Fujiwara 2007; Bansal et al. 2007b, Bansal et al. 2008; Lam et al. 2008b) in the multi‐processor setting. Our main result is an enhanced analysis of a simple non‐migratory online algorithm called