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