Amortized efficiency of list update and paging rules
Communications of the ACM
Scheduling Parallel Machines On-line
SIAM Journal on Computing
On-line analysis of the TCP acknowledgment delay problem
Journal of the ACM (JACM)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Proceedings of the twenty-second annual symposium on Principles of distributed computing
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Dynamic Speed Scaling to Manage Energy and Temperature
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
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 for weighted flow time
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Speed scaling to manage temperature
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Competitive non-migratory scheduling for flow time and energy
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Proceedings of the 6th ACM conference on Computing frontiers
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
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
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
The bell is ringing in speed-scaled multiprocessor scheduling
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Energy-Aware Scheduling of Flow Applications on Master-Worker Platforms
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Speed scaling with a solar cell
Theoretical Computer Science
Optimizing throughput and energy in online deadline scheduling
ACM Transactions on Algorithms (TALG)
Communications of the ACM
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
Optimality analysis of energy-performance trade-off for server farm management
Performance Evaluation
Scalably scheduling power-heterogeneous processors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
How to schedule when you have to buy your energy
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Non-clairvoyant speed scaling for weighted flow time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
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 Weighted Flow Time
SIAM Journal on Computing
Energy-efficient due date scheduling
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Low-energy automated scheduling of computing resources
Proceedings of the 1st ACM/IEEE workshop on Autonomic computing in economics
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
Information and Software Technology
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)
Nonclairvoyant sleep management and flow-time scheduling on multiple processors
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Dual techniques for scheduling on a machine with varying speed
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Decoupled speed scaling: Analysis and evaluation
Performance Evaluation
The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling
Theory of Computing Systems
| Hi-index | 0.02 |
We study scheduling problems in battery-operated computing devices, aiming at schedules with low total energy consumption. While most of the previous work has focused on finding feasible schedules in deadline-based settings, in this article we are interested in schedules that guarantee good response times. More specifically, our goal is to schedule a sequence of jobs on a variable-speed processor so as to minimize the total cost consisting of the energy consumption and the total flow time of all jobs. We first show that when the amount of work, for any job, may take an arbitrary value, then no online algorithm can achieve a constant competitive ratio. Therefore, most of the article is concerned with unit-size jobs. We devise a deterministic constant competitive online algorithm and show that the offline problem can be solved in polynomial time.