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)
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
Speed scaling to manage temperature
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Power-aware scheduling for makespan and flow
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Competitive online scheduling for server systems
ACM SIGMETRICS Performance Evaluation Review
Speed scaling on parallel processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
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
Scheduling algorithms for procrastinators
Journal of Scheduling
Getting the best response for your erg
ACM Transactions on Algorithms (TALG)
Speed Scaling with a Solar Cell
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Speed scaling with an arbitrary power function
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Optimal speed scaling under arbitrary power functions
ACM SIGMETRICS Performance Evaluation Review
Power-aware scheduling for makespan and flow
Journal of Scheduling
Min-Energy Scheduling for Aligned Jobs in Accelerate Model
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Online deadline scheduling with bounded energy efficiency
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Energy efficient deadline scheduling in two processor systems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Optimality, fairness, and robustness in speed scaling designs
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Distributed dynamic speed scaling
INFOCOM'10 Proceedings of the 29th conference on Information communications
Software for improving the energy efficiency of a computer cluster
Programming and Computing Software
Min-energy scheduling for aligned jobs in accelerate model
Theoretical Computer Science
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
Power-aware speed scaling in processor sharing systems: Optimality and robustness
Performance Evaluation
Optimizing energy management in multi-core servers
ACM SIGMETRICS Performance Evaluation Review - Special issue on the 31st international symposium on computer performance, modeling, measurements and evaluation (IFIPWG 7.3 Performance 2013)
Energy-efficient scheduling in multi-core servers
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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 paper 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 power consumption and the total flow time of all the 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 paper 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.