Robust Allocation and Scheduling Heuristics for Dynamic, Distributed Real-Time Systems
From MaRDI portal
Publication:3603109
Recommendations
- Publication:3478251
- Robust partitioned scheduling for real-time multiprocessor systems
- Efficient algorithms for robustness in resource allocation and scheduling problems
- A scheduling heuristics for distributed real-time embedded systems tolerant to processor and communication media failures
- Task scheduling in distributed real-time systems
Cites work
- Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions
- scientific article; zbMATH DE number 1640601 (Why is no real title available?)
- Quantitative characterization of event streams in analysis of hard real-time applications
- Resource management middleware for dynamic, dependable real-time systems
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Utilization bounds for EDF scheduling on real-time multiprocessor systems
Cited in
(7)- Stable and real-time scheduling of a class of hybrid dynamic systems
- Experimental analysis of timing validation methods for distributed real-time systems
- Assessing the robustness of arrival curves models for real-time systems
- Composition and distribution of resources for real-time computing systems
- Stochastic robustness metric and its use for static resource allocations
- scientific article; zbMATH DE number 2080042 (Why is no real title available?)
- Flexible hard real-time scheduling for deliberative AI systems
This page was built for publication: Robust Allocation and Scheduling Heuristics for Dynamic, Distributed Real-Time Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603109)