Exploiting Approximations in Real-Time Scheduling

Keyphrases

• Dependent Tasks 100%
• Computational Tasks 100%
• Real-time Scheduling 100%
• Communication Tasks 100%
• Optimization Problem 50%
• Real-time Systems 50%
• Worst-case Bounds 50%
• Tight Bounds 50%
• Admissibility 50%
• Application Quality 50%
• Real-time Constraints 50%
• Fundamental Tradeoffs 50%
• Task Set 50%
• Task Graph 50%
• Timing Guarantees 50%
• Real-time Task 50%
• Optimized Mapping 50%
• Quality Optimization 50%
• Quality Degradation 50%
• Mixed-criticality Systems 50%

Computer Science

• Approximation (Algorithm) 100%
• Real Time Scheduling 100%
• Criticality 100%
• Real Time Systems 50%
• Optimization Problem 50%
• Application Quality 50%
• Time Constraint 50%
• Task Graph 50%