Real time scheduling theory: A historical perspective

DOI10.1023/B:TIME.0000045315.61234.1ezbMath1073.68537MaRDI QIDQ704048

Aloysius K. Mok, Lui Sha, Anton Cervin, Marco Caccamo, Alan Burns, Karl-Erik Årzén, Theodore P. Baker, Giorgio C. Buttazzo, Tarek F. Abdelzaher, John P. Lehoczky

Publication date: 12 January 2005

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

zbMATH Keywords

feedbackhard real-timerate-monotonic schedulingearliest deadline firstsoft real-timedynamic-priority schedulingFixed-priority schedulingnew challengesscheduling models

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) History of computer science (68-03)

Related Items (22)

Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling ⋮ An analysis of fixed-priority schedulability on a multiprocessor ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution time ⋮ Controlling computationally intensive heterogeneous computational tasks with directive deadlines ⋮ Reliable social sensing with physical constraints: analytic bounds and performance evaluation ⋮ Temporal Robustness of Stochastic Signals ⋮ An efficient implementation of a VNS heuristic for the weighted fair sequences problem ⋮ On the nature and impact of self-similarity in real-time systems ⋮ Contention-resolving model predictive control for coupled control systems with a shared resource ⋮ An optimal boundary fair scheduling algorithm for multiprocessor real-time systems ⋮ Control: a perspective ⋮ Graph-based models for real-time workload: a survey ⋮ Efficient implementation of tight response-times for tasks with offsets ⋮ Network‐based robust fault detection with incomplete measurements ⋮ Counter machines, Petri nets, and consensual computation ⋮ Model predictive control under timing constraints induced by controller area networks ⋮ Reconciling fault-tolerant distributed algorithms and real-time computing ⋮ An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems ⋮ Tardiness bounds under global EDF scheduling on a multiprocessor ⋮ A survey on standards for real-time distribution middleware ⋮ Towards a real-time distributed computing model

Uses Software

• Giotto

This page was built for publication: Real time scheduling theory: A historical perspective