Abstract
In recent multiprocessor platforms in embadded systems are commonly used. Due to this background, optimal real-time scheduling algorithms which run at full utilization have been proposed, but such algorithms are not established yet. Meanwhile, a high schedulability and the schedule success ratio cannot be improved by a existing simple algorithms, for example, RM (Rate Monotonic). To resolve such problems, the RMZL which based on global RM is proposed. RMZL takes the merit of RM such as high predictability, low jitter, and low overhead, and also improves the schedulability and schedule success ratio. In this paper we propose the LP-RMZL based on RMZL which keeps high schedule success ratio under high load. The simulation evaluation shows that our algorithm outperforms the RMZL under high load situation.
| Translated title of the contribution | A Real-Time Scheduling Algorithm with Decreasing Preemption for Multiprocessor Based on RM |
|---|---|
| Original language | Japanese |
| Pages (from-to) | 37 - 42 |
| Journal | IEICE technical report |
| Volume | 110 |
| Issue number | 458 |
| State | Published - 28 Feb 2011 |