EXECUTING A PROGRAM ON THE MIT TAGGED-TOKEN DATA-FLOW ARCHITECTURE

被引：119

作者：

ARVIND

NIKHIL, RS

机构：

[1] Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1990年 / 39卷 / 03期

关键词：

Dataflow architectures; dataflow graphs; functional languages; I-structures; implicit parallelism; MIMD machines;

D O I：

10.1109/12.48862

中图分类号：

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

学科分类号：

0812 ;

摘要：

The MIT Tagged-Token Dataflow project has an unconventional, but integrated approach to general-purpose high-performance parallel computing. Rather than extending conventional sequential languages, we use Id, a high-level language with fine-grained parallelism and determinacy implicit in its operational semantics. Id programs are compiled to dynamic dataflow graphs, a parallel machine language. Dataflow graphs are directly executed on the MIT Tagged-Token Dataflow Architecture (TTDA), a novel multiprocessor architecture. Dataflow research has advanced significantly in the last few years; in this paper, we provide an overview of our current thinking, by describing example Id programs, their compilation to dataflow graphs, and their execution on the TTDA. Finally, we describe related work and the status of our project. © 1990 IEEE

引用

页码：300 / 318

页数：19