Computation of minimum firing time for general self-cleaning SWITCH-less program nets

作     者：Ge, QW Yanagida, H Onaga, K 

作者机构：Yamaguchi Univ Fac Educ Yamaguchi 7530841 Japan Fujitsu Ten Ltd Kobe Hyogo 6528510 Japan Univ Ryukyus Fac Engn Okinawa 9030129 Japan 

出 版 物：《IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES》 (IEICE Trans Fund Electron Commun Comput Sci)

年 卷 期：1998年第E81A卷第6期

页      面：1072-1078页

核心收录：

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：data-flow program program net minimum firing time node contraction 

摘      要：A data-flow program net is a graph representation of data-Row programs consisting of three types of nodes, AND-node, OR-node and SWITCH-node, which represent arithmetic/logical, data merge and context switch operations respectively. Minimum firing (completion) time (T) under bar of a program net is an important element in computing parallel degree PARAdeg residing in a data-flow program and is defined as the minimum time when the program net is executed by enough many processors. In this paper, we propose algorithms to efficiently compute (T) under bar by contracting AND-nodes generally for self cleaning SWITCH-less program nets with arbitrary node firing time and give the experimental results of the algorithms to show the efficiency.