Energy-efficient algorithms for flow time minimization
From MaRDI portal
Publication:4962689
DOI10.1145/1290672.1290686zbMath1445.68036OpenAlexW2048730512MaRDI QIDQ4962689
Hiroshi Fujiwara, Susanne Albers
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1290672.1290686
dynamic programmingcompetitive analysisonline algorithmsflow timeoffline algorithmsvariable-speed processor
Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items
Sustainable operations ⋮ Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling ⋮ On the Complexity of Speed Scaling ⋮ Energy-efficient multiprocessor scheduling for flow time and makespan ⋮ Speed scaling on parallel processors with migration ⋮ Speed scaling for stretch plus energy ⋮ The bell is ringing in speed-scaled multiprocessor scheduling ⋮ Speed scaling on parallel processors ⋮ Station assignment with reallocation ⋮ Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption ⋮ Energy efficient scheduling of parallelizable jobs ⋮ Resource cost aware scheduling ⋮ Continuous speed scaling with variability: a simple and direct approach ⋮ Deadline scheduling and power management for speed bounded processors ⋮ Scheduling to minimize energy and flow time in broadcast scheduling ⋮ On speed scaling via integer programming ⋮ Multi-Priority Online Scheduling with Cancellations ⋮ Models and algorithms for energy-efficient scheduling with immediate start of jobs ⋮ Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines ⋮ Green scheduling, flows and matchings ⋮ Speed scaling for maximum lateness ⋮ Minimizing total completion time in multiprocessor job systems with energy constraint
