Scheduling parallel tasks with individual deadlines

DOI10.1007/BFB0015424zbMATH Open1512.90099MaRDI QIDQ6487963FDOQ6487963

Authors: Oh-Heum Kwon, Kyung-Yong Chwa 

Publication date: 21 March 2023

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

Mathematics Subject Classification ID

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

Cites Work

• MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
• Title not available (Why is that?)
• On the competitiveness of on-line real-time task scheduling
• On-line scheduling of jobs with fixed start and end times
• Algorithms for Scheduling Independent Tasks
• Title not available (Why is that?)
• 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)