THE POWER OF RECONFIGURATION

被引：100

作者：

BENASHER, Y

PELEG, D

RAMASWAMI, R

SCHUSTER, A

机构：

[1] TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI,HAIFA,ISRAEL

[2] WEIZMANN INST SCI,DEPT APPL MATH & COMP SCI,IL-76100 REHOVOT,ISRAEL

[3] IBM CORP,THOMAS J WATSON RES CTR,OPT NETWORKING GRP,YORKTOWN HTS,NY 10598

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1991年 / 13卷 / 02期

关键词：

D O I：

10.1016/0743-7315(91)90084-M

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper examines the computational aspects of the reconfigurable network model. The computational power of the model is investigated under several network topologies and with several variants of the model assumed. In particular, it is shown that there are reconfigurable machines based on simple network topologies that are capable of solving large classes of problems in constant time. These classes depend on the kinds of switches assumed for the network nodes. Reconfigurable networks are also compared with various other models of parallel computation, like PRAMS and Branching Programs. © 1991.

引用

页码：139 / 153

页数：15

共 50 条

[1] AGGARWAL A, 1986, IEEE T COMPUT, V35, P62, DOI 10.1109/TC.1986.1676658
[2] WAVE-GUIDE ELECTROOPTIC SWITCH ARRAYS
ALFERNESS, RC
[J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1988, 6 (07) : 1117 - 1130
[3] SQUARE MESHES ARE NOT ALWAYS OPTIMAL
BARNOY, A
PELEG, D
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (02) : 196 - 204
[4] BARRINGTON D, 1986, 18TH P ACM STOC, P1
[5] BEAME P, 1986, 18TH P ANN ACM S THE, P169
[6] BEAME P, 1987, 19TH P ACM S THEOR C, P83
[7] BENASHER A, 1990, 9014 HEBR U TECH REP
[8] BENASHER A, 1990, 5TH P JER C INF TECH, P225
[9] BENASHER A, 1990, 1990 P INT TOP M OPT
[10] BENASHER A, UNPUB COMPLEXITY REC

← 1 2 3 4 5 →