Improved multi-processor scheduling for flow time and energy

DOI10.1007/S10951-009-0145-5MaRDI QIDQ2434271zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Lap-Kei Lee, Isaac K. K. To, Prudence W. H. Wong, Tak-Wah Lam

Publication date 5 February 2014

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-009-0145-5

zbMATH Keywords

competitive analysisenergy minimizationdynamic speed scalingmulti-processor schedulingonline scheduling algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Energy-efficient multiprocessor scheduling for flow time and makespan
• Scheduling for Speed Bounded Processors
• Energy-efficient algorithms for flow time minimization
• Online speed scaling based on active job count to minimize flow plus energy
• Energy-Efficient Algorithms for Flow Time Minimization

Cites work

• scientific article; zbMATH DE number 6381709 (Why is no real title available?)
• scientific article; zbMATH DE number 1306870 (Why is no real title available?)
• scientific article; zbMATH DE number 2079319 (Why is no real title available?)
• scientific article; zbMATH DE number 6469165 (Why is no real title available?)
• Algorithm Theory - SWAT 2004
• Algorithms for minimizing weighted flow time
• Approximating total flow time on parallel machines
• Eliminating migration in multi-processor scheduling
• Energy-Efficient Algorithms for Flow Time Minimization
• Minimizing the Flow Time Without Migration
• Minimizing total flow time and total completion time with immediate dispatching
• Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
• Nonmigratory Online Deadline Scheduling on Multiprocessors
• Optimal time-critical scheduling via resource augmentation
• Power-aware scheduling for makespan and flow
• Scheduling for Speed Bounded Processors
• Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
• Speed scaling for weighted flow time
• Speed scaling of tasks with precedence constraints
• Speed scaling to manage energy and temperature

Cited in

(6)

• Energy-efficient multiprocessor scheduling for flow time and makespan
• Speed scaling on parallel processors
• Energy efficient scheduling of parallelizable jobs
• Sleep management on multiple machines for energy and flow time
• Models and algorithms for energy-efficient scheduling with immediate start of jobs
• Energy-efficient algorithms for flow time minimization

This page was built for publication: Improved multi-processor scheduling for flow time and energy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434271)