Computation of Minimum Firing Time for General Self-Cleaning SWITCH-Less Program Nets
Summary :
A data-flow program net is a graph representation of data-flow 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 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 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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.6 pp.1072-1078
- Publication Date
- 1998/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section of Papers Selected from ITC-CSCC'97)
- Category
- Graphs and Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Qi-Wei GE, Hidenori YANAGIDA, Kenji ONAGA, "Computation of Minimum Firing Time for General Self-Cleaning SWITCH-Less Program Nets" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 6, pp. 1072-1078, June 1998, doi: .
Abstract: A data-flow program net is a graph representation of data-flow 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 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 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_6_1072/_p
Copy
@ARTICLE{e81-a_6_1072,
author={Qi-Wei GE, Hidenori YANAGIDA, Kenji ONAGA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Computation of Minimum Firing Time for General Self-Cleaning SWITCH-Less Program Nets},
year={1998},
volume={E81-A},
number={6},
pages={1072-1078},
abstract={A data-flow program net is a graph representation of data-flow 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 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 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.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Computation of Minimum Firing Time for General Self-Cleaning SWITCH-Less Program Nets
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1072
EP - 1078
AU - Qi-Wei GE
AU - Hidenori YANAGIDA
AU - Kenji ONAGA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1998
AB - A data-flow program net is a graph representation of data-flow 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 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 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.
ER -
English
