STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling unrelated machines with costs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Preemptive scheduling of parallel jobs on multiprocessors
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Scheduling parallel tasks to minimize average response time
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Cilk multithreaded parallel programs on processors of different speeds
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A parallel workload model and its implications for processor allocation
HPDC '97 Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing
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
Multiprocessor Energy-Efficient Scheduling for Real-Time Tasks with Different Power Characteristics
ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing
Power-aware scheduling for makespan and flow
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture
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
Policies for dynamic clock scheduling
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Speed scaling for weighted flow time
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of dynamic voltage/frequency scaling in chip-multiprocessors
ISLPED '07 Proceedings of the 2007 international symposium on Low power electronics and design
Energy-efficient algorithms for flow time minimization
ACM Transactions on Algorithms (TALG)
Getting the best response for your erg
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
Provably efficient two-level adaptive scheduling
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Speed scaling of tasks with precedence constraints
WAOA'05 Proceedings of the Third 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
| Hi-index | 0.00 |
Energy consumption and heat dissipation have become key considerations for modern high performance computer systems. In this paper, we focus on non-clairvoyant speed scaling to minimize flow time plus energy for batched parallel jobs on multiprocessors. We consider a common scenario where the total power consumption cannot exceed a given budget and the power consumed on each processor is sα when running at speed s. Extending the EQUI processor allocation policy, we propose two algorithms: U-EQUI and N-EQUI, which use respectively a uniform-speed and a non-uniform speed scaling function for the allocated processors. Using competitive analysis, we show that U-EQUI is O(Pα-1)/α2)-competitive for flow time plus energy, and N-EQUI is O(α√lnP)-competitive for the same metric when given sufficient power, where P is the total number of processors. Our simulation results confirm that U-EQUI and N-EQUI achieve better performance than a straightforward fixed-speed EQUI strategy. Moreover, moderate power constraint does not significantly affect the performance of our algorithms.