Network real-time scheduling algorithm based on multi-feature dynamic priority
Real-time task scheduling system structure and task model were proposed aiming at the network real-time scheduling problem.The task degree of urgency was defined by considering the deadline of task,execution time and interval time between works.The task degree of tightness was proposed based on serv...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2020-05-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020091/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539390409539584 |
|---|---|
| author | Xun SU Yanfang LI Ning ZONG Wei WEI Juan LI Ying DING |
| author_facet | Xun SU Yanfang LI Ning ZONG Wei WEI Juan LI Ying DING |
| author_sort | Xun SU |
| collection | DOAJ |
| description | Real-time task scheduling system structure and task model were proposed aiming at the network real-time scheduling problem.The task degree of urgency was defined by considering the deadline of task,execution time and interval time between works.The task degree of tightness was proposed based on service-level assurance,according to functional importance of different tasks in the real-time task scheduling system.The thrashing limit for avoiding task switching frequently was acquired through dynamic regulation to task priorities by degree of urgency and degree of tightness,which guaranteed the success rate of tasks execution and utilization ratio of client execution.Test simulation results suggest that the multi-feature dynamic priority scheduling strategy improves the success rate of task scheduling and shorten the average response time,which suggests it has obvious superiority compared with BE and EDF scheduling algorithm. |
| format | Article |
| id | doaj-art-eb7617d3f8eb4fceabde96b4344b84b0 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2020-05-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-eb7617d3f8eb4fceabde96b4344b84b02025-01-14T07:19:21ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2020-05-014115916759735599Network real-time scheduling algorithm based on multi-feature dynamic priorityXun SUYanfang LINing ZONGWei WEIJuan LIYing DINGReal-time task scheduling system structure and task model were proposed aiming at the network real-time scheduling problem.The task degree of urgency was defined by considering the deadline of task,execution time and interval time between works.The task degree of tightness was proposed based on service-level assurance,according to functional importance of different tasks in the real-time task scheduling system.The thrashing limit for avoiding task switching frequently was acquired through dynamic regulation to task priorities by degree of urgency and degree of tightness,which guaranteed the success rate of tasks execution and utilization ratio of client execution.Test simulation results suggest that the multi-feature dynamic priority scheduling strategy improves the success rate of task scheduling and shorten the average response time,which suggests it has obvious superiority compared with BE and EDF scheduling algorithm.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020091/multi-feature dynamic prioritydegree of urgencydegree of tightnessthrashing limit |
| spellingShingle | Xun SU Yanfang LI Ning ZONG Wei WEI Juan LI Ying DING Network real-time scheduling algorithm based on multi-feature dynamic priority Tongxin xuebao multi-feature dynamic priority degree of urgency degree of tightness thrashing limit |
| title | Network real-time scheduling algorithm based on multi-feature dynamic priority |
| title_full | Network real-time scheduling algorithm based on multi-feature dynamic priority |
| title_fullStr | Network real-time scheduling algorithm based on multi-feature dynamic priority |
| title_full_unstemmed | Network real-time scheduling algorithm based on multi-feature dynamic priority |
| title_short | Network real-time scheduling algorithm based on multi-feature dynamic priority |
| title_sort | network real time scheduling algorithm based on multi feature dynamic priority |
| topic | multi-feature dynamic priority degree of urgency degree of tightness thrashing limit |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020091/ |
| work_keys_str_mv | AT xunsu networkrealtimeschedulingalgorithmbasedonmultifeaturedynamicpriority AT yanfangli networkrealtimeschedulingalgorithmbasedonmultifeaturedynamicpriority AT ningzong networkrealtimeschedulingalgorithmbasedonmultifeaturedynamicpriority AT weiwei networkrealtimeschedulingalgorithmbasedonmultifeaturedynamicpriority AT juanli networkrealtimeschedulingalgorithmbasedonmultifeaturedynamicpriority AT yingding networkrealtimeschedulingalgorithmbasedonmultifeaturedynamicpriority |