Executing a program on the MIT tagged-token dataflow architecture

Journal Article · Thu Mar 01 00:00:00 EST 1990 · IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA)

DOI:https://doi.org/10.1109/12.48862· OSTI ID:6992026

Arvind,; Nikhil, R S ^[1]

---

1. Massachusetts Inst. of Tech., Cambridge, MA (USA). Lab. for Computer Science

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, the authors 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, the authors provide an overview of our current thinking, by describing example Id programs, their compilation to dataflow graphs, and their execution on the TTDA. Finally, the authors describe related work and the status of our project.

• OSTI ID: 6992026
• Journal Information: IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA), Vol. 39:3; ISSN 0018-9340
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
PARALLEL PROCESSING
PERFORMANCE
COMPUTER CODES
DATA-FLOW PROCESSING
GRAPHS
RESEARCH PROGRAMS
PROGRAMMING
990200* - Mathematics & Computers