Performance evaluation of a two-processor scheduling method for acyclic SWITCH-less program nets

被引：1

作者：

Ge, QW ^{[1
]}

Li, C

Nakata, M

机构：

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

[2] Yamaguchi Univ, Grad Sch, Yamaguchi 7538512, Japan

来源：

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

关键词：

multiprocessor scheduling; program net; dynamic priority list; optimal schedule; GA scheduling;

D O I：

10.1093/ietfec/e88-a.6.1502

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper investigates the usefulness of a new priority list for two-processor scheduling problem of program nets. Firstly, we discuss the weakness of a previously proposed priority list and then introduce a new priority list. Through simulation experiment we show that the new priority list is better than the previous one and can generate the same length of schedules as GA scheduling, which implies the new priority list can generate approximately optimal schedules.

引用

页码：1502 / 1506

页数：5

共 14 条

[1] 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
[2] 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
[3] 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
[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] 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
[6] 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
[7] 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
[8] A two-processor scheduling method for a class of program nets with unity node firing time
Ge, QW
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1999, E82A (11) : 2579 - 2583
[9] 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
[10] 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):

← 1 2 →