Deadline-based scheduling of periodic task systems on multiprocessors.

DOI10.1016/S0020-0190(02)00231-4zbMath1042.68021MaRDI QIDQ1853117

Sanjoy K. Baruah, Anand Srinivasan

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00231-4

zbMATH Keywords

Real-time systems; Multiprocessor scheduling; Earliest deadline first; Feasibility analysis; Periodic task systems

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks, Global EDF scheduling for parallel real-time tasks, Utility accrual real-time scheduling for multiprocessor embedded systems, M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms, Integrating job parallelism in real-time scheduling theory, Schedulability issues for EDZL scheduling on real-time multiprocessor systems, Optimal virtual cluster-based multiprocessor scheduling, An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems, A new fair scheduling algorithm for periodic tasks on multiprocessors, Laxity dynamics and LLF schedulability analysis on multiprocessor platforms, Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling, Tardiness bounds under global EDF scheduling on a multiprocessor, Schedulability analysis of global EDF

Cites Work

• Unnamed Item
• Unnamed Item
• Proportionate progress: A notion of fairness in resource allocation
• On a Real-Time Scheduling Problem
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment