Scheduling parallel tasks with individual deadlines

DOI10.1016/S0304-3975(97)00178-3MaRDI QIDQ1285585zbMATH OpenOpenAlexFDO

Authors Oh-Heum Kwon, Kyung-Yong Chwa

Publication date 28 April 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(97)00178-3

zbMATH Keywords

approximation algorithmdeadlinesapproximation factorparallel task scheduling

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1003241 (Why is no real title available?)
• 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

(7)

• Algorithms for scheduling deadline-sensitive malleable tasks
• Scheduling with tails and deadlines
• Scheduling parallel tasks with individual deadlines
• Scheduling independent tasks with multiple modes
• Scheduling Interval Ordered Tasks in Parallel
• Multi-core real-time scheduling for generalized parallel task models
• Global EDF scheduling for parallel real-time tasks

Describes a project that uses

Uses Software

• MOCA

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 Q1285585)