首页 | 本学科首页   官方微博 | 高级检索  
     

一种实时异构嵌入式系统的任务调度算法
引用本文:邱卫东,陈燕,李洁萍,彭澄廉.一种实时异构嵌入式系统的任务调度算法[J].软件学报,2004,15(4):504-511.
作者姓名:邱卫东  陈燕  李洁萍  彭澄廉
作者单位:复旦大学,计算机与信息技术系,上海,200433
基金项目:Supported by the National Natural Science Foundation of China under Grant Nos.69873010, 69873010 (国家自然科学基金)
摘    要:异构分布式系统已被广泛应用在实时嵌入式系统中,而调度算法是在进行嵌入式系统综合时,确保系统实现性能目标的一个关键问题,这是一个NP-完全问题.现有的算法主要是启发式算法,性能还有待提高.提出了一个异构分布式系统的动态BLevel优先(dynamic BLevel first,简称DBLF)算法,算法选择就绪任务中动态BLevel值最大的任务进行调度,用插入法为任务分配处理器,遵循以下3个插入原则:满足任务先后顺序关系;任务的最早完成时间(earliest-finish-time,简称EFT)最小;在EFT相等时,优先分配到利用率较低的处理器上.与现有算法比较可以看出,DBLF算法可以有效降低调度长度.

关 键 词:异构系统  列表调度  调度长度  动态关键路径  通信资源访问  最早完成时间
文章编号:1000-9825/2004/15(04)0504
收稿时间:2003/3/31 0:00:00
修稿时间:2003年3月31日

A Task Scheduling Algorithm for Real-Time Heterogeneous Embedded Systems
QIU Wei-Dong,CHEN Yan,LI Jie-Ping and PENG Cheng-Lian.A Task Scheduling Algorithm for Real-Time Heterogeneous Embedded Systems[J].Journal of Software,2004,15(4):504-511.
Authors:QIU Wei-Dong  CHEN Yan  LI Jie-Ping and PENG Cheng-Lian
Abstract:Heterogeneous computing environments have been widely used in real-time embedded systems. Efficient task scheduling is essential for achieving high performance in the synthesis of embedded systems. The problem has been proved to be NP-complete and mainly heuristic algorithms which often have room for improvement exist. In this paper, an algorithm called the dynamic BLevel first (DBLF) has been presented. The DBLF algorithm selects the ready task with a maximum Blevel (ni) at each step and assigns the selected task to a processor in an insertion mode. The task is assigned to the suitable processor that satisfies the precedence sequence and has the minimum earliest-finish-time (EFT) of the task. When the EFT costs are equal, the task is firstly assigned to the processor which has the least utilization. Comparied with the related work, the result shows that the DBLF algorithm significantly surpasses the previous approaches in scheduling length.
Keywords:heterogeneous system  list scheduling  scheduling length  dynamic critical path  communication resource access  earliest finish time
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号