文献类型：期刊文献

英文题名：An algorithm for changing ordinary DAGs into conditional task graphs

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

第一作者：王颖锋

通讯作者：Wang, Y.|[1048417685a1a25]王昱;[104841877a3626d]王雅;[10484aa5f8043]王阳;[1048487e32913b]王颖;[104843e5bbb6d]王勇;[10484d18d76e7]王莹;[1048477a3626d]王雅;[10484f2129c2f]王岩;[1048426d18d76e7]王莹;[10484980491ae]王媛;

机构：[1] College of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou, 450002, China; [2] Department of Information Engineering, North China University of Water Conservancy and Electric Power, Zhengzhou, 450011, China

第一机构：河南财经政法大学计算机与信息工程学院

通讯机构：[1]College of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou, 450002, China|[1048412]河南财经政法大学计算机与信息工程学院;[10484]河南财经政法大学;

年份：2012

卷号：7

期号：21

起止页码：104-111

外文期刊名：Journal of Convergence Information Technology

收录：EI(收录号：20125015781075);Scopus(收录号：2-s2.0-84870568944)

语种：英文

外文关键词：Directed graphs - Graphic methods - Scheduling

摘要：We propose a novel algorithm to achieve conditional task graphs based on ordinary directed acyclic graphs. The proposed algorithm firstly adopts a random directed acyclic graph generation algorithm to generate random directed acyclic graphs. Then it calculates the number of out-edge for each nodes based on the corresponding adjacent matrix or directed acyclic graph. Next, it generates random integers for each node with more than one out-edge. The number of generated integers is accordance with the number of out-edge for each node with more than one out-edge. Last, it divides each integer except the last one by the sum of these integers to get the corresponding condition value. The last condition value of each node selected as the node with conditional branches is the difference between 1 and the sum of the first k -1 condition values when the node with k conditional branches. Experimental results show that our algorithm can effectively change ordinary directed acyclic graphs into conditional task graphs. Our algorithm can be adopted by scheduling algorithm design for conditional task graph to show flexibility and effectiveness of the proposed algorithm compared with other algorithms.