摘要
针对由周期任务和零星任务形成的实时混合任务集进行合理调度问题,文中提出了一种基于零松弛度边界公平(Boundary Fair until Zero Laxity,BFZL)的实时混合任务算法。该算法在改进边界公平(Improved Boundary Fair,I-BF)实时混合任务算法基础上,通过引入最小松弛度优先(Least Laxity First,LLF)算法中的松弛度参数来改进判定任务的优先级,并提出基于松弛度与启发式策略相结合的启发式算法改进任务的分配策略。实验结果表明,BFZL算法能够满足系统实时性,并达到了算法优化目的。通过数据对比分析可知,该算法相比于原始算法,零星任务的平均响应时间降低了约26%,上下文切换减少了约28%,迁移减少了约50%。该算法在调度开销方面也具有一定优势。
In this study,an algorithm based on BFZL(Boundary Fair until Zero Laxit)is proposed to solve the problem of reasonable scheduling of real-time mixed task set formed by periodic task and sporadic task.Based on the I-BF(Improved Boundary Fair)real-time mixed task algorithm,the relaxation parameter of LLF(Least Laxity First)algorithm is introduced to improve the priority of decision task.A heuristic algorithm based on relaxation and heuristic strategy is proposed to improve task assignment strategy.The experimental results show that the BFZL algorithm can satisfy the real-time performance of the system and achieve the purpose of algorithm optimization.Through data comparative analysis,compared with the original algorithm,the proposed algorithm reduces the average response time of sporadic tasks by about 26%,reduces the context switch and migration by about 28%and 50%,respectively.Additionally,the algorithm also has advantages in scheduling overhead.
作者
罗广
冒航
朱扬烁
张凤登
LUO Guang;MAO Hang;ZHU Yangshuo;ZHANG Fengdeng(School of Optical-Electrical and Computer Engineering,University of Shanghaifor Science and Technology,Shanghai 200093,China)
出处
《电子科技》
2024年第8期84-91,102,共9页
Electronic Science and Technology
基金
国家自然科学基金(71840003)
上海市自然科学基金(15ZR1429300)。
关键词
嵌入式系统
多核处理器
实时调度
混合任务
公平调度
公平性
划分
优先级
embedded system
multi-core processor
real-time scheduling
hybrid tasks
fair scheduling
fairness
divide
priority
