A Real-Time Scheduling Algorithm with Delayed-Preemption Feature for Multimedia Communication

With the rapid deployment of multimedia applications, the need for real-time scheduling in embedded system continues to increase. However, the strict preemptive nature of traditional scheduling algorithms such as Rate-Monotonic (RM) and Earliest-Deadline-First (EDF) leads to inefficiencies specially in application to schedule protocol processing at high speeds or multimedia encode/decode computation. This paper presents a modified RM scheme called RM with Delayed Preemption (DP-RM). The analysis shows that our scheme solves some scheduling efficiency problems.