Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines

DOI10.1016/J.EJOR.2011.10.017MaRDI QIDQ439457zbMATH OpenOpenAlexFDO

Authors Rafał Różycki, Jan Węglarz

Publication date 16 August 2012

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2011.10.017

zbMATH Keywords

preemptable jobsdeadlinesnon-linear programmingpower-aware computingready times

Mathematics Subject Classification ID

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

Recommendations

• Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
• Preemptive Scheduling of Parallel Jobs on Multiprocessors
• scientific article; zbMATH DE number 871911
• Preemptive scheduling on identical parallel machines subject to deadlines.
• Scheduling on power-heterogeneous processors
• Scheduling on power-heterogeneous processors
• Scheduling preemptable tasks on parallel processors with limited availability
• Scheduling Precedence Constrained Tasks with Reduced Processor Energy on Multiprocessor Computers
• Preemptive scheduling with deadlines on parallel machines

Cites work

• scientific article; zbMATH DE number 6381709 (Why is no real title available?)
• scientific article; zbMATH DE number 3688701 (Why is no real title available?)
• scientific article; zbMATH DE number 1306870 (Why is no real title available?)
• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
• Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
• Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• STACS 2005
• Scheduling for Speed Bounded Processors

Cited in

(14)

• A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages
• Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
• Comparative analysis of some metaheuristics for discrete-continuous project scheduling with activities of identical processing rates
• Energy-efficient scheduling in manufacturing companies: a review and research framework
• Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
• Scheduling shared continuous resources on many-cores
• A work-demand analysis compatible with preemption-aware scheduling for power-aware real-time tasks
• Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
• Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic
• On a certain class of power- and energy-related scheduling problems
• Energy-efficient deadline scheduling for heterogeneous systems
• Power and performance management for parallel computations in clouds and data centers
• Simple matching vs linear assignment in scheduling models with positional effects: a critical review

This page was built for publication: Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines

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