Evaluation of PARAdeg of acyclic SWITCH-less program nets

被引：0

作者：

Ge, QW ^{[1
]}

Onaga, K

机构：

[1] Yamaguchi Univ, Fac Educ, Yamaguchi 7538513, Japan

[2] Univ Ryukyus, Dept Informat Engn, Okinawa 9030213, Japan

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2000年 / E83A卷 / 06期

关键词：

program net; parallel degree; multiprocessor scheduling; GA scheduling; evaluation;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

PARAdeg has been defined to try to measure parallelism inherent in a program net. Studies on computation of PARAdeg have been done, but the quantitative evaluation. oil how much PARAdeg fits parallelism of program nets. has trot been studied. in this paper, we do the evaluation by apply -ing genetic algorithm to measure firing completion times when PARAdeg processors: and less and more processors are provided for 300 program nets. Our experimental results show that the firing completion times decrease rapidly with increase of processors till PARAdeg and slowly when processors are increased to more than PARAdeg, which implies PARAdeg is a reasonable standard to measure parallelism of program nets.

引用

页码：1186 / 1191

页数：6

共 48 条

[1] 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
[2] 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
[3] 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
[4] 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
[5] 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
[6] Computation of minimum firing time for general self-cleaning SWITCH-less program nets
Yamaguchi Univ, Yamaguchi-shi, Japan
IEICE Trans Fund Electron Commun Comput Sci, 6 (1072-1078):
[7] 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
[8] 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
[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

← 1 2 3 4 5 →