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!
|
| _version_ | 1841537574603063296 |
|---|---|
| author | LUO Ding-ding ZHAO Hai SUN Pei-gang ZHANG Xi-yuan YIN Zhen-yu |
| author_facet | LUO Ding-ding ZHAO Hai SUN Pei-gang ZHANG Xi-yuan YIN Zhen-yu |
| author_sort | LUO Ding-ding |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-d7284c5de0fb4f8683b8ebb724abbedc |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2008-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-d7284c5de0fb4f8683b8ebb724abbedc2025-01-14T08:33:25ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2008-01-01798674654995Research on run-time overhead of RM and improvementLUO Ding-dingZHAO HaiSUN Pei-gangZHANG Xi-yuanYIN Zhen-yuRM 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.http://www.joconline.com.cn/zh/article/74654995/RM algorithmreal-time schedulingembedded real-time operating systemrun-time overheadcon- text-switch |
| spellingShingle | LUO Ding-ding ZHAO Hai SUN Pei-gang ZHANG Xi-yuan YIN Zhen-yu Research on run-time overhead of RM and improvement Tongxin xuebao RM algorithm real-time scheduling embedded real-time operating system run-time overhead con- text-switch |
| title | Research on run-time overhead of RM and improvement |
| title_full | Research on run-time overhead of RM and improvement |
| title_fullStr | Research on run-time overhead of RM and improvement |
| title_full_unstemmed | Research on run-time overhead of RM and improvement |
| title_short | Research on run-time overhead of RM and improvement |
| title_sort | research on run time overhead of rm and improvement |
| topic | RM algorithm real-time scheduling embedded real-time operating system run-time overhead con- text-switch |
| url | http://www.joconline.com.cn/zh/article/74654995/ |
| work_keys_str_mv | AT luodingding researchonruntimeoverheadofrmandimprovement AT zhaohai researchonruntimeoverheadofrmandimprovement AT sunpeigang researchonruntimeoverheadofrmandimprovement AT zhangxiyuan researchonruntimeoverheadofrmandimprovement AT yinzhenyu researchonruntimeoverheadofrmandimprovement |