An optimal scheduling algorithm for preemptable real-time tasks

DOI10.1016/0020-0190(94)90043-4MaRDI QIDQ1321836zbMATH OpenOpenAlexFDO

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

Recommendations

• An optimal multiprocessor real-time scheduling algorithm
• A new algorithm for scheduling periodic, real-time tasks
• Preemptive Scheduling of Uniform Processor Systems
• Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
• scientific article; zbMATH DE number 4199946

Cites work

• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3560745 (Why is no real title available?)
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Some simple scheduling algorithms

Cited in

(10)

• scientific article; zbMATH DE number 2112421 (Why is no real title available?)
• An algorithm for coalescing operations with precedence constraints in real-time systems
• REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE
• Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems
• Intelligent time slice for round robin in real time operating systems
• Dynamic model and optimal scheduling algorithm for a set of jobs with preemption constraints
• Combinatorial optimization in real-time scheduling: Theory and algorithms
• A non-preemptive scheduling algorithm for soft real-time systems
• Optimal real-time scheduling with minimal rejections and minimal finishing time
• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness

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

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