Cutting-plane algorithms for preemptive uniprocessor scheduling problems

DOI10.1007/S11241-023-09408-YMaRDI QIDQ6554176zbMATH OpenFDO

Authors Abhishek Singh

Publication date 12 June 2024

Published in Real-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11241-023-09408-Y

zbMATH Keywords

cutting planesearliest deadline firstfixed priorityfixed-point iterationhard real-time schedulinglinear programming duality

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of mathematical programming (90C90)

Recommendations

• Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
• A new algorithm for scheduling periodic, real-time tasks
• A cutting plane algorithm for the unrelated parallel machine scheduling problem
• Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
• Preemptive scheduling of periodic jobs in uniform multiprocessor systems

Cites work

• Determining rate monotonic schedulability of real-time periodic tasks using continued fractions
• Real time scheduling theory: A historical perspective

Cited in

(1)

• Minimizing cache usage with fixed-priority and earliest deadline first scheduling

This page was built for publication: Cutting-plane algorithms for preemptive uniprocessor scheduling problems

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