Timing analysis for embedded systems using non-preemptive EDF scheduling under bounded error arrivals

Keyphrases

• Algorithm Analysis 33%
• Bounded Error 100%
• Competitive Ratio 33%
• Computational Experiment 33%
• Deadline Scheduling 33%
• Deadline-driven 33%
• EDF Scheduling 100%
• Embedded Systems 100%
• Fault Tolerance 33%
• Fault-tolerant 33%
• Functional Specification 33%
• High Efficiency 33%
• Multimedia 33%
• Non-preemptive 100%
• Non-preemptive Scheduling 66%
• Periodic Tasks 33%
• Preemptive Scheduling 33%
• Processing Unit 33%
• Processor Speed 33%
• Runtime Complexity 33%
• Schedulability Conditions 33%
• Scheduling Techniques 33%
• Software Tasks 33%
• Sporadic Tasks 33%
• Task Scheduling Algorithm 33%
• Task Set 33%
• Task Type 33%
• Time Application 33%
• Time Constraints 33%
• Timing Analysis 100%
• Timing Error 33%
• Timing Properties 33%

Computer Science

• Analysis Technique 33%
• Competitive Ratio 33%
• Computational Experiment 33%
• Embedded Systems 100%
• Fault Tolerant 33%
• fault-tolerance 33%
• Functional Specification 33%
• Multimedia 33%
• Preemptive Scheduling 100%
• Processing Unit 33%
• Real-Time Application 33%
• Runtime Complexity 33%
• Scheduling Algorithm 33%
• Scheduling Deadline 33%
• task-scheduling 33%
• Timing Analysis 100%
• Timing Constraint 33%