THE EXPLICIT TOKEN STORE

被引:18
作者
CULLER, DE [1 ]
PAPADOPOULOS, GM [1 ]
机构
[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139
基金
美国国家科学基金会;
关键词
D O I
10.1016/0743-7315(90)90031-J
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper presents an unusually simple approach to dynamic dataflow execution, called the Explicit Token Store (ETS) architecture, and its current realization in Monsoon. The essence of dynamic dataflow execution is captured by a simple transition on state bits associated with storage local to a processor. Low-level storage management is performed by the compiler in assigning nodes to slots in an activation frame, rather than dynamically in hardware. The processor is simple, highly pipelined, and quite general. There is exactly one instruction executed for each action on the dataflow graph. Thus, the machine-oriented ETS model provides new insight into the real cost of direct execution of dataflow graphs. © 1990.
引用
收藏
页码:289 / 308
页数:20
相关论文
共 47 条
[1]   FUTURE SCIENTIFIC PROGRAMMING ON PARALLEL MACHINES [J].
ARVIND ;
EKANADHAM, K .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1988, 5 (05) :460-493
[2]  
ARVIND, 1988, 4TH P INT S BIOL ART
[3]  
ARVIND, 1987, DATAFLOW REDUCTION A, V1, P25
[4]  
ARVIND, 1988, CST MEMO, V278
[5]  
ARVIND, 1985, JUL P IFIP TC 10 WOR
[6]  
ARVIND, 1987, 1987 P DFVLR C PAR P
[7]  
ARVIND, 1984, TAGGED TOKEN DATAFLO
[8]  
ARVIND, 1986, MIT269 LAB COMP SCI
[9]  
ARVIND, 1982, IEEE COMPUT, V15, P2
[10]  
ARVIND, 1988, TECH REP COMPUTER ST, V285