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

被引：0

|

作者：

Yamaguchi Univ, Yamaguchi-shi, Japan ^{[1
]}

机构：

来源：

IEICE Trans Fund Electron Commun Comput Sci | / 6卷 / 1072-1078期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

10

引用

收藏

相关论文

共 11 条

[1] Computation of minimum firing time for general self-cleaning SWITCH-less program nets
Ge, QW
Yanagida, H
Onaga, K
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1998, E81A (06) : 1072 - 1078
[2] A method of computing minimum firing time for self-cleaning SWITCH-less program nets
Ge, QW
Yanagida, H
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1998, 335B (05): : 877 - 895
[3] Evaluation of PARAdeg of acyclic SWITCH-less program nets
Ge, QW
Onaga, K
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (06) : 1186 - 1191
[4] PARAdeg-processor scheduling for acyclic SWITCH-less program nets
Ge, QW
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1999, 336 (07): : 1135 - 1153
[5] Two-processor scheduling of general acyclic SWITCH-less program nets via hybrid priority lists
Ge, QW
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (03) : 471 - 479
[6] A new proposal to two-processor scheduling problem for SWITCH-less program nets
Ge, QW
Li, C
Nakata, M
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (11): : 2859 - 2867
[7] A new proposal to two-processor scheduling problem for SWITCH-less program nets
Ge, Qi-Wei
Li, Chen
Nakata, Mitsuru
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2004, E87-A (11) : 2859 - 2867
[8] Performance evaluation of a two-processor scheduling method for acyclic SWITCH-less program nets
Ge, QW
Li, C
Nakata, M
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (06): : 1502 - 1506
[9] An optimal two-processor scheduling for a class of SWITCH-less program nets with combined OR-nodes
Ge, QW
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2002, E85A (06): : 1274 - 1280
[10] An optimal two-processor scheduling for a class of SWITCH-less program nets with combined OR-nodes
Ge, Qi-Wei
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2002, E85-A (06) : 1274 - 1280