An optimal scheduling algorithm for preemptable real-time tasks

DOI10.1016/0020-0190(94)90043-4zbMath0803.68007OpenAlexW2012424391MaRDI QIDQ1321836

Yong-Seok Kim

Publication date: 3 May 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90043-4

zbMATH Keywords

schedulingreal-time systemsdeadlines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• Some simple scheduling algorithms
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: An optimal scheduling algorithm for preemptable real-time tasks