Efficient scheduling of DAG tasks on multi-core processor based parallel systems
Yuan L(袁柳); Jia PG(贾品贵); Yang YP(杨一平)
2015
会议日期1–4 November 2015
会议地点Macau, Macao
关键词Real-time Systems Multi-core Processors Task Scheduling Dag
DOI10.1109/TENCON.2015.7373088
英文摘要Directed Acyclic Graph (DAG) task models have been widely used in multi-core processor based parallel system. The efficiency of it is closely related to the performance of multi-core processors. However, most of the researches ignore the allocation of the non-critical predecessors, so that they still have some disadvantages. The number of processors and the schedule length need to be further reduced. In order to solve this problem, we propose a new scheduling algorithm, which combined the cluster-based method and the interval insertion strategies. The earliest start time will be obtained according to the cluster-based method. Strategies of task-duplication and interval insertion will also be given to satisfy the earliest start time. In this paper, the non-critical predecessors can be assigned to the same processor with the key predecessor or the same processor with other non-critical predecessors. So the schedule length and the number of processors can be both reduced by proposed method, especially the situation of high communication cost. More efficient task scheduling can be achieved. 
会议录IEEE Region 10 Annual International Conference, Proceedings/TENCON
学科主题工科
语种英语
内容类型会议论文
源URL[http://ir.ia.ac.cn/handle/173211/11455]  
专题自动化研究所_综合信息系统研究中心
作者单位中国科学院自动化研究所
推荐引用方式
GB/T 7714
Yuan L,Jia PG,Yang YP. Efficient scheduling of DAG tasks on multi-core processor based parallel systems[C]. 见:. Macau, Macao. 1–4 November 2015.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace