Scheduling interval ordered tasks with non-uniform deadlines

DOI10.1007/BFB0009513MaRDI QIDQ6487456zbMATH OpenFDO

Authors Jacques Verriet

Publication date 25 January 2023

Full work available at URL https://doi.org/10.1007/BFB0009513

Mathematics Subject Classification ID

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

Recommendations

• Scheduling interval-ordered tasks with non-uniform deadlines subject to non-zero communication delays
• Scheduling an interval ordered precedence graph with communication delays and a limited number of processors
• Scheduling interval orders with communication delays in parallel
• An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
• scientific article; zbMATH DE number 1759465

Cites work

• An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
• Scheduling Interval-Ordered Tasks
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• The Complexity of Scheduling Trees with Communication Delays
• Three, four, five, six, or the complexity of scheduling with communication delays

Cited in

(5)

• Scheduling interval-ordered tasks with non-uniform deadlines subject to non-zero communication delays
• Scheduling split intervals with non-uniform demands
• Scheduling with constrained processor allocation for interval orders
• Scheduling an interval ordered precedence graph with communication delays and a limited number of processors
• Scheduling Interval Ordered Tasks in Parallel

This page was built for publication: Scheduling interval ordered tasks with non-uniform deadlines

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