On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling
From MaRDI portal
Recommendations
- Scheduling real-time computations with separation constraints
- On-line scheduling of scalable real-time tasks on multiprocessor systems.
- On-line scheduling with non-crossing constraints
- Refinement of Timing Constraints for Concurrent Tasks with Scheduling
- Scheduling algorithms based on weakly hard real-time constraints
- scientific article; zbMATH DE number 802345
- On-line scheduling with hard deadlines
- Extremal scheduling of parallel processing with and without real-time constraints
Cites work
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Measuring the performance of schedulability tests
- Optimal scheduling for two-processor systems
- Symmetry breaking for multi-criteria mapping and scheduling on multicores
This page was built for publication: On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945589)