一種應(yīng)用于多媒體通信的實時調(diào)度算法

隨著網(wǎng)絡(luò)技術(shù)和計算技術(shù)的發(fā)展，多媒體通信作為一種重要的應(yīng)用領(lǐng)域，獲得了越來越多的應(yīng)用，而其中重要的一個研究主題就是實時調(diào)度的效率。傳統(tǒng)的實時調(diào)度算法有著良好的理論模型，但是由于忽略了許多系統(tǒng)開銷，其性能有待提高。該文針對多媒體通信的周期性和實時性提出了一種延遲搶占的策略，與傳統(tǒng)立即搶占的模型相比，取得了更好的實際效果，提高了CPU的利用率。

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.