Scheduling of fork-join tasks on multi-core processors to avoid communication conflict

doi:10.1109/TENCON.2015.7373042

CORC > 自动化研究所 > 中国科学院自动化研究所 > 综合信息系统研究中心

	Scheduling of fork-join tasks on multi-core processors to avoid communication conflict
	Yuan L(袁柳); Jia PG(贾品贵); Yang YP(杨一平)
	2015
会议日期	1–4 November 2015
会议地点	Macau, Macao
关键词	Real-time Systems Multi-core Processors Task Scheduling Fork-join
DOI	10.1109/TENCON.2015.7373042
英文摘要	The scheduling of fork-join model which is one of the most basic DAG models has a great impact on the efficiency of multi-core processors. Most of the task scheduling methods are based on the assumption of parallel communication. However, the communication in non-fully connected network is serial. In this case the regular methods will result in communication conflict, so that the number of processors and the schedule length will be increased. In order to solve this problem, we introduce a new task scheduling method TSFJ SC to map the fork-join tasks on multi-core processors. The number of processors can be strictly controlled in TSFJ SC. Busy-window is introduced to avoid the communication conflict. Strategies such as P0 insertion strategy, interval insertion strategy, task allocation strategy and so on are introduced to obtain the shorter schedule length. Through these methods, the TSFJ SC algorithm can obtain a better performance than other existing methods. The number of processors can be greatly reduced, the speedup can be greatly increased, and the efficiency of each processor can also be improved. Real-time processing can be obtained by TSFJ SC method.
会议录	IEEE Region 10 Annual International Conference, Proceedings/TENCON
学科主题	工科
语种	英语
内容类型	会议论文
源URL	[http://ir.ia.ac.cn/handle/173211/11456]
专题	自动化研究所_综合信息系统研究中心
作者单位	中国科学院自动化研究所
推荐引用方式 GB/T 7714	Yuan L,Jia PG,Yang YP. Scheduling of fork-join tasks on multi-core processors to avoid communication conflict[C]. 见:. Macau, Macao. 1–4 November 2015.