Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Non-clairvoyant scheduling for weighted flow time
Information Processing Letters
Algorithmic problems in power management
ACM SIGACT News
Power-aware scheduling for makespan and flow
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
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
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)
ACM Transactions on Algorithms (TALG)
Energy-efficient algorithms for flow time minimization
ACM Transactions on Algorithms (TALG)
Competitive non-migratory scheduling for flow time and energy
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Scheduling for Speed Bounded Processors
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Speed scaling of tasks with precedence constraints
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Min-Energy Scheduling for Aligned Jobs in Accelerate Model
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Deadline scheduling and power management for speed bounded processors
Theoretical Computer Science
Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Scalably scheduling power-heterogeneous processors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Non-clairvoyant speed scaling for weighted flow time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Min-energy scheduling for aligned jobs in accelerate model
Theoretical Computer Science
Tradeoff between energy and throughput for online deadline scheduling
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Speed scaling for energy and performance with instantaneous parallelism
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Sleep management on multiple machines for energy and flow time
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Improved multi-processor scheduling for flow time and energy
Journal of Scheduling
Algorithms for energy management
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Scheduling for weighted flow time and energy with rejection penalty
Theoretical Computer Science
Speed Scaling with an Arbitrary Power Function
ACM Transactions on Algorithms (TALG)
Competitive online algorithms for multiple-machine power management and weighted flow time
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling
Theory of Computing Systems
| Hi-index | 0.00 |
We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of active jobs, replacing the existing speed scaling functions in the literature that depend on the remaining work of active jobs. The new speed functions are more stable and also more efficient. They can support better job selection strategies to improve the competitive ratios of existing algorithms [8,5], and, more importantly, to remove the requirement of extra speed. These functions further distinguish themselves from others as they can readily be used in the non-clairvoyant model (where the size of a job is only known when the job finishes). As a first step, we study the scheduling of batched jobs (i.e., jobs with the same release time) in the non-clairvoyant model and present the first competitive algorithm for minimizing flow time plus energy (as well as for weighted flow time plus energy); the performance is close to optimal.