Eliminating migration in multi-processor scheduling
Journal of Algorithms
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Real-time dynamic voltage scaling for low-power embedded operating systems
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Minimizing the Flow Time Without Migration
SIAM Journal on Computing
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Nonmigratory Online Deadline Scheduling on Multiprocessors
SIAM Journal on Computing
Algorithmic problems in power management
ACM SIGACT News
Speed scaling to manage energy and temperature
Journal of the ACM (JACM)
Speed scaling on parallel processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Policies for dynamic clock scheduling
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Scheduling for reduced CPU energy
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Approximating total flow time on parallel machines
Journal of Computer and System Sciences
Energy efficient online deadline scheduling
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Speed scaling for weighted flow time
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Energy-efficient algorithms for flow time minimization
ACM Transactions on Algorithms (TALG)
Speed Scaling of Tasks with Precedence Constraints
Theory of Computing Systems
Getting the best response for your erg
ACM Transactions on Algorithms (TALG)
Scheduling for Speed Bounded Processors
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
SRPT optimally utilizes faster machines to minimize flow time
ACM Transactions on Algorithms (TALG)
Nonmigratory Multiprocessor Scheduling for Response Time and Energy
IEEE Transactions on Parallel and Distributed Systems
Power-aware scheduling for makespan and flow
Journal of Scheduling
Deadline scheduling and power management for speed bounded processors
Theoretical Computer Science
| Hi-index | 0.00 |
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 in ACM Trans. Algorithms 3(4), 2007; Bansal et al. in Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pp. 805---813, 2007b, Bansal et al. in Proceedings of International Colloquium on Automata, Languages and Programming, pp. 409---420, 2008; Lam et al. in Proceedings of European Symposium on Algorithms, pp. 647---659, 2008b) in the multi-processor setting. Our main result is an enhanced analysis of a simple non-migratory online algorithm called CRR (classified round robin) on m驴2 processors, showing that its flow time plus energy is within O(1) times of the optimal non-migratory offline algorithm, when the maximum allowable speed is slightly relaxed. The result still holds even if the comparison is made against the optimal migratory offline algorithm. This improves previous analysis that CRR is O(log驴P)-competitive where P is the ratio of the maximum job size to the minimum job size.