Real time scheduling theory: A historical perspective

DOI10.1023/B:TIME.0000045315.61234.1EzbMATH Open1073.68537MaRDI QIDQ704048FDOQ704048

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

Publication date: 12 January 2005

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

Recommendations

• Special issue on scheduling and timing analysis for advanced real-time systems
• The study of design optimization about single-processor scheduling algorithms in real-time system
• A survey of hard real-time scheduling for multiprocessor systems
• Rate monotonic scheduling in hard real-time systems
• Investigating the usability of real-time scheduling theory with the Cheddar project

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)

Cited In (27)

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

Uses Software

• Giotto

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

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