OPTIMAL ASSIGNMENT OF TASK MODULES WITH PRECEDENCE FOR DISTRIBUTED-PROCESSING BY GRAPH MATCHING AND STATE-SPACE SEARCH

被引：17

作者：

WANG, LL

TSAI, WH

机构：

[1] NATL CHIAO TUNG UNIV,INST COMP ENGN,HSINCHU 30050,TAIWAN

[2] NATL CHIAO TUNG UNIV,DEPT INFORMAT SCI,HSINCHU 30050,TAIWAN

来源：

BIT | 1988年 / 28卷 / 01期

关键词：

D O I：

10.1007/BF01934694

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：54 / 68

页数：15

共 24 条

[1] RANDOM GRAPH ISOMORPHISM [J].

BABAI, L ;

ERDOS, P ;

SELKOW, SM .

[2]

BOKHARI SH, 1981, IEEE T COMPUT, V30, P207, DOI 10.1109/TC.1981.1675756

[3]

CHOW TCK, 1982, IEEE T SOFTWARE ENG, V8, P401

[4]

CHOW YC, 1979, IEEE T COMPUT, V28, P354, DOI 10.1109/TC.1979.1675365

[5]

CHU WW, 1980, COMPUTER, V13, P57, DOI 10.1109/MC.1980.1653419

[6]

CHUNG MJ, 1986, MAY P ARM RES OFF WO

[7]

CHUNG MJ, 1986, PARALLEL COMPUTER BA

[8] SCHEDULING PRECEDENCE GRAPHS OF BOUNDED HEIGHT [J].

DOLEV, D ;

WARMUTH, MK .

[9]

EFE K, 1982, COMPUTER, V15, P50, DOI 10.1109/MC.1982.1654050

[10]

HARALICK RM, 1978, MAY P IEEE C PATT RE