A new proposal to two-processor scheduling problem for SWITCH-less program nets

被引：0

作者：

Ge, Qi-Wei ^{[1
]}

Li, Chen ^{[2
]}

Nakata, Mitsuru ^{[1
]}

机构：

[1] Faculty of Education, Yamaguchi University, Yamaguchi-shi, 753-8513, Japan

[2] Grad. Sch. of Sci. and Engineering, Yamaguchi University, Yamaguchi-shi, 753-8512, Japan

来源：

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences | 2004年 / E87-A卷 / 11期

关键词：

Dynamic priority list - GA scheduling - Multiprocessor scheduling - Opimal schedule - Program nets;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：2859 / 2867

共 50 条

[1] 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
[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] 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
[4] 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
[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] 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
[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] Optimal parallel algorithm for two-processor scheduling
Albacea, Eliezer A.
Proceedings of the Conference on High Performance Computing on the Information Superhighway, HPC Asia'97, 1997, : 220 - 223
[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 3 4 5 →