Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth 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
SRPT optimally utilizes faster machines to minimize flow time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of 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
Nonmigratory Online Deadline Scheduling on Multiprocessors
SIAM Journal on Computing
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 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
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
Energy-efficient algorithms for flow time minimization
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 of tasks with precedence constraints
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Min-energy voltage allocation for tree-structured tasks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
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
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
The bell is ringing in speed-scaled multiprocessor scheduling
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Communications of the ACM
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
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
The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling
Theory of Computing Systems
| Hi-index | 0.02 |
Energy usage has been an important concern in recent research on online scheduling. In this paper we extend the study of the tradeoff between flow time and energy from the single-processor setting [8, 6] to the multi-processor setting. Our main result is an 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. This result still holds even if the comparison is made against the optimal migratory offline algorithm (the competitive ratio increases by a factor of 2.5). As a special case, our work also contributes to the traditional online flow-time scheduling. Specifically, for minimizing flow time only, CRR can yield a competitive ratio one or even arbitrarily smaller than one, when using sufficiently faster processors. Prior to our work, similar result is only known for online algorithms that needs migration [21, 23], while the best non-migratory result can achieve an O(1) competitive ratio [14]. The above result stems from an interesting observation that there always exists some optimal migratory schedule S that can be converted (in an offline sense) to a non-migratory schedule S' with a moderate increase in flow time plus energy. More importantly, this non-migratory schedule always dispatches jobs in the same way as CRR.