Multiprocessor scheduling with availability constraints

DOI10.1007/978-3-319-00795-3_63MaRDI QIDQ5171824zbMATH OpenOpenAlexFDO

Authors Liliana Grigoriu

Publication date 12 February 2015

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7694

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Scheduling on uniform processors with at most one downtime on each machine
• Scheduling on same-speed processors with at most one downtime on each machine
• Scheduling preemptable tasks on parallel processors with limited availability
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• Machine scheduling with availability constraints

Cited in

(8)

• A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees
• Bandwidth availability of \(m\)-level hierarchical multiprocessor systems
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• Scheduling multiprocessor tasks in presence of correlated failures.
• Scheduling on uniform processors with at most one downtime on each machine
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• Scheduling on same-speed processors with at most one downtime on each machine
• Explicit Modelling of Multiple Intervals in a Constraint Generation Procedure for Multiprocessor Scheduling

This page was built for publication: Multiprocessor scheduling with availability constraints

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