|Table of Contents|

[1] Shen Zhuowei, Wang Yun,. Long-release-interval-first real-time scheduling algorithmand its schedulability test [J]. Journal of Southeast University (English Edition), 2006, 22 (4): 484-489. [doi:10.3969/j.issn.1003-7985.2006.04.009]
Copy

Long-release-interval-first real-time scheduling algorithmand its schedulability test()
长释放时间间隔优先调度算法及其可调度性分析
Share:

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:
22
Issue:
2006 4
Page:
484-489
Research Field:
Computer Science and Engineering
Publishing date:
2006-12-30

Info

Title:
Long-release-interval-first real-time scheduling algorithmand its schedulability test
长释放时间间隔优先调度算法及其可调度性分析
Author(s):
Shen Zhuowei Wang Yun
Key Laboratory of Computer Network and Information Integration of Ministry of Education, Southeast University, Nanjing 210096, China
沈卓炜 汪芸
东南大学计算机网络和信息集成教育部重点实验室, 南京 210096
Keywords:
real-time scheduling schedulability test earliest deadline first maximum urgency first long release interval first
实时调度 可调度性分析 截止期优先调度 最大紧急度优先调度 长释放时间间隔优先调度
PACS:
TP393
DOI:
10.3969/j.issn.1003-7985.2006.04.009
Abstract:
To fulfill the requirements for hybrid real-time system scheduling, a long-release-interval-first(LRIF)real-time scheduling algorithm is proposed.The algorithm adopts both the fixed priority and the dynamic priority to assign priorities for tasks.By assigning higher priorities to the aperiodic soft real-time jobs with longer release intervals, it guarantees the executions for periodic hard real-time tasks and further probabilistically guarantees the executions for aperiodic soft real-time tasks.The schedulability test approach for the LRIF algorithm is presented.The implementation issues of the LRIF algorithm are also discussed.Simulation result shows that LRIF obtains better schedulable performance than the maximum urgency first(MUF)algorithm, the earliest deadline first(EDF)algorithm and EDF for hybrid tasks.LRIF has great capability to schedule both periodic hard real-time and aperiodic soft real-time tasks.
针对混合任务实时调度的需求和现有混合任务实时调度算法的局限性, 提出了一种长释放时间间隔优先的混合任务实时调度算法LRIF, 该算法采用固定优先级和动态优先级相结合的调度策略, 根据非周期性软实时任务作业到达流分布, 将一定比例的软实时任务作业当作硬实时作业调度, 除了可对周期性硬实时任务提供调度保证外, 同时还可确保非周期性软实时任务的可调度率.还提出了LRIF调度算法的可调度性分析方法, 并讨论了LRIF调度算法的实现方法.测试结果表明:LRIF调度算法具有更好的调度性能, 可有效调度由周期性硬实时任务和非周期性软实时任务构成的混合实时系统.

References:

[1] Krishna C M, Shin K G.Real-time systems [M].Columbus, Ohio:McGraw-Hill Companies, Inc., 1997.47-72.
[2] Stankovic J, Spuri M, Di Natale M, et al.Implications of classical scheduling results for real-time systems [J].IEEE Computer Magazine, 1995, 28(6):16-25.
[3] Liu J W S.Real-time systems [M].New Jersey:Prentice-Hall, Inc., 2000.
[4] Liu C L, Layland J.Scheduling algorithms for multiprogramming in a hard real-time environment [J].Journal of ACM, 1973, 20(1):46-61.
[5] Buttazzo G C.Rate monotonic vs.EDF:judgment day [J].Journal of Real-Time Systems, 2005, 29(1):5-26.
[6] Shen Zhuowei.Research on hybrid real-time CORBA scheduling model and its schedulability [D].Nanjing:School of Computer Science and Engineering of Southeast University, 2004.(in Chinese)
[7] Strosnider J K, Lehoczky J P, Sha L.The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments [J].IEEE Transactions on Computers, 1995, 44(1):73-91.
[8] Ripoll I, Garcia-Fornes A, Crespo A.Optimal aperiodic scheduling for dynamic-priority systems [A].In:Proceedings of the IEEE International Workshop on Real-Time Computing Systems and Applications (IEEE RTCSA)[C].Seoul, 1996.294-300.
[9] Stewart D B, Khosla P K.Real-time scheduling of sensor-based control systems [A].In:Halang W, Ramamaritham K, eds.Real-Time Programming[C].New York:Pergamon Press Inc., 1992.139-144.
[10] Lu Chuanlai.Queuing theory [M].Beijing:Beijing University of Posts and Telecommunications Press, 1994.(in Chinese)

Memo

Memo:
Biographies: Shen Zhuowei(1974—), male, doctor, zwshen@seu.edu.cn;Wang Yun(1966—), female, doctor, professor, yunwang@seu.edu.cn.
Last Update: 2006-12-20