检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:田文韬 李晓明[1] TIAN Wentao;LI Xiaoming(College of Mechanical Engineering,Zhejiang Sci-Tech University,Hangzhou 310000,China)
出 处:《集成电路与嵌入式系统》2025年第3期24-32,共9页Integrated Circuits and Embedded Systems
摘 要:在嵌入式测试平台开发中,实时性是一个至关重要的特性,能够使平台系统快速响应任务事件。大多情况下平台运行的任务繁多且类型不一,因此针对任务众多且任务之间关系多样的情况下如何使实时的任务优先执行的问题,本文提出了一种多DAG实时调度算法MDRTPS,算法主要分为3个步骤:①对多个DAG进行实时任务分离,分离出来的实时任务集和普通任务集使用不同的优先级算法和资源分配。②维护3个调度队列,队列协调不同DAG任务之间的排序。③调度器基于最早完成时间来调度任务到处理器核。实验结果表明,MDRTPS算法的任务跨度和实时任务的响应速度均优于HEFT算法和CPOP算法。In the development of embedded test platforms,real-time capability that enables the platform system to respond swiftly to task events.In most cases,there are numerous tasks of different types running on the platform,hence the challenge of ensuring the real-time execution of tasks with multiple and diverse relationships.To address,this paper proposes a multi-DAG real-time priority scheduling algorithm(MDRTPS).This algorithm is mainly divided into three steps:firstly,real-time task separation for multiple DAGs,where the separated real-time task set and the normal task set use different priority algorithms and resource allocations.Secondly,Maintainance of three scheduling queues to coordinate the ordering between different DAG tasks.Fianlly,the scheduler assigns tasks to the processor core based on the earliest completion time.Experimental results show that the MDRTPS algorithm outperforms the HEFT algorithm and CPOP algorithm in terms of task span and response speed of real-time tasks.
分 类 号:TP368.1[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.135.224.139