Scheduling parallel tasks with individual deadlines

DOI10.1007/BFB0015424MaRDI QIDQ6487963zbMATH OpenFDO

Authors Oh-Heum Kwon, Kyung-Yong Chwa

Publication date 21 March 2023

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Recommendations

• Scheduling parallel tasks with individual deadlines
• scientific article; zbMATH DE number 1241387
• Linear-Time approximation schemes for scheduling malleable parallel tasks
• scientific article; zbMATH DE number 1947422
• scientific article; zbMATH DE number 2080263

Cites work

• scientific article; zbMATH DE number 1003247 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Algorithms for Scheduling Independent Tasks
• MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
• On the competitiveness of on-line real-time task scheduling
• On-line scheduling of jobs with fixed start and end times
• Optimal online scheduling of parallel jobs with dependencies

Cited in

(4)

• Algorithms for scheduling deadline-sensitive malleable tasks
• Scheduling with tails and deadlines
• Scheduling independent tasks with multiple modes
• Scheduling Interval Ordered Tasks in Parallel

This page was built for publication: Scheduling parallel tasks with individual deadlines

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