Research on run-time overhead of RM and improvement
RM algorithm is a classic fixed priority real-time scheduling algorithm, but in most embedded real-time sys- tems, where the workload is composed of many tasks of high frequency and short execution time, the overheads from context-switches of real-time operating system will lead to a low resource ut...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2008-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74654995/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | RM algorithm is a classic fixed priority real-time scheduling algorithm, but in most embedded real-time sys- tems, where the workload is composed of many tasks of high frequency and short execution time, the overheads from context-switches of real-time operating system will lead to a low resource utilization rate if RM algorithm is directly used. By studying the preemption relationship of the tasks scheduled by RM algorithm, a model of context-switches overheads is established with task attributes, based on which the run-time context-switches overheads of RM algorithm are reduced by optimizing the release time of the tasks in embedded real-time systems. Finally, the experimental results show the va- lidity of the proposed strategy. |
|---|---|
| ISSN: | 1000-436X |