Executing a program on the MIT tagged-token dataflow architecture
- 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), Journal Name: IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA) Vol. 39:3; ISSN ITCOB; ISSN 0018-9340
- Country of Publication:
- United States
- Language:
- English
Similar Records
Tagged token dataflow architecture
Selected reprints on dataflow and reduction architectures