Improved multi-processor scheduling for flow time and energy

DOI10.1007/S10951-009-0145-5zbMATH Open1280.68074DBLPjournals/scheduling/LamLTW12OpenAlexW2074314785WikidataQ58062893 ScholiaQ58062893MaRDI QIDQ2434271FDOQ2434271

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

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

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)

Cites Work

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

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)