文献类型：期刊文献

英文题名：Algorithms for numbering communication tasks in task graphs

作者：Wu, Huixin[1]; Huang, Jianghua[2]; Wang, Yingfeng[3]

第一作者：Wu, Huixin

通讯作者：Wu, H.

机构：[1] Department of Information Engineering, North China University of Water Conservancy and Electric Power, Zhengzhou, 450011, China; [2] Department of Mathematics and Physics, Hunan Institute of Technology, Hengyang, 421002, China; [3] College of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou, 450002, China

第一机构：Department of Information Engineering, North China University of Water Conservancy and Electric Power, Zhengzhou, 450011, China

通讯机构：[1]Department of Information Engineering, North China University of Water Conservancy and Electric Power, Zhengzhou, 450011, China

年份：2012

卷号：4

期号：16

起止页码：55-63

外文期刊名：International Journal of Advancements in Computing Technology

收录：EI(收录号：20123915473299);Scopus(收录号：2-s2.0-84866551041)

语种：英文

外文关键词：Algorithms - Graphic methods - Scheduling

摘要：In this paper, we propose algorithms to number communication tasks in task graphs to serve task scheduling considering both computation tasks and communication tasks. Adopting depth-first and width-first manners, we propose algorithms considering two cases: numbering computation tasks with communication tasks and individually numbering computation tasks, respectively. We generate sizes of communication tasks by random functions for random task graphs generated by various task graph generators. We demonstrate the proposed algorithms with a task graph including computation tasks only. Results show that the algorithms can achieve expected results. The proposed algorithms used in numbering communication tasks are suitable for both random task graphs generated by task graph generators and task graphs extracted from actual applications.