(Enter summary)
Abstract: The Tagged Token Dataflow Architecture is multiprocessor based on the U.interpreter model of
dataflow computation. It captures the essential execution mechanism of the U.interpreter precisely;
operations are enabled for execution by the availability of operand data. However, computational
resources in the model and the machine are viewed quite differently. This thesis addresses four
major resource management issues essential to bridge the gap between the U-interpreter and the
Tagged Token... (Update)
Context of citations to this paper: More
...tokens that are ready for execution will saturate the matching store and other data buffers. In the worst case this can result in deadlock [7]. ffl Communication Overhead: fine granularity potentially increases the amount of data communication in the system. ffl Structure Store...
...mention this fact. The problem of storage management for multithreaded computations has been a growing concern among practitioners [6, 12]. To date, most existing techniques for controlling storage requirements have consisted of heuristics to either bound storage use by...
Cited by: More
Executing Multithreaded Programs Efficiently - Blumofe (1995)
(Correct)
The Spectrum Of Thread Implementations On Hybrid Multithreaded.. - Shankar (1995)
(Correct)
Space-Efficient Scheduling of Multithreaded Computations - Blumofe, Leiserson (1993)
(Correct)
Active bibliography (related documents): More All
0.5: Congestion Control in Routing Networks - Chien (1986)
(Correct)
0.3: A Compiler Approach to Scalable Concurrent Program Design - Foster, Taylor (1992)
(Correct)
0.3: Hope: An Experimental Applicative Language - Burstall, MacQueen, Sannella (1980)
(Correct)
Similar documents based on text: More All
0.7: A Compiler for the MIT Tagged-token Dataflow Architecture - Traub (1986)
(Correct)
0.5: ENEE 759E: Dataflow modeling (Handout 10) - Shuvra Bhattacharyya Dataflow
(Correct)
0.4: Survey of High-Latency Tolerance in Future Microprocessor.. - Firas Al-Ali Chris
(Correct)
Related documents from co-citation: More All
6: A Multithreaded Massively Parallel Architecture (context) - Nikhil, Papadopoulos - 1992
6: von Neumann hybrid architecture (context) - Iannucci, Dataflow - 1988
6: An architecture of a dataflow single chip processor (context) - Sakai, Yamaguchi et al. - 1989
BibTeX entry: (Update)
D.E. Culler. Resource management for the tagged token data flow architecture. Technical Report TR-332, Laboratory for Computer Science, MIT, January 1985. http://citeseer.ist.psu.edu/culler85resource.html More
@techreport{ culler85resource,
author = "D. E. Culler",
title = "{RESOURCE} {MANAGEMENT} {FOR} {THE} {TAGGED} {TOKEN} {DATAFLOW} {ARCHITECTURE}",
number = "MIT/LCS/TR-332",
pages = "116",
year = "1985",
url = "citeseer.ist.psu.edu/culler85resource.html" }
Citations (may not include all citations):
225
Some Simplified NP-Complete Graph Problems (context) - Garey, Johnson et al. - 1976
104
Combinatorial Optimization (context) - Papadimitriou, Steiglitz
14
Structures: An Efficient Data Type for Functional Languages (context) - Thomas - 1980
7
Some Relationships BetWeen Asynchronous Interpreters of a Da.. (context) - C-ostelow - 1977
7
An Abstract Implementation for a Generalized Dataflow Langua.. (context) - Weng - 1979
6
The U-interpreter (context) - Gostelow - 1982
3
Can Programming Be Liberated from the yon Neumann Style? A F.. (context) - Backus - 1978
2
To be published as an MIT Technical Report (context) - Arvind, Culler et al.
1
Why Dataflow Architectures (context) - 'Culler - 1984
1
Applied Mathematical Programming Addison Wellsley Publishing.. (context) - Hax - 1977
1
A Computer Capable of Exchanging Processors for Tune (context) - K-, Gostelow - 1977
1
Operating System Princlplea Prentice Hall (context) - Coffman, Denning - 1973
1
An Asynchronous Programmiag Language and Computing Machine (context) - Arvind, Gostelow - 1978
1
Lecture Notes in Computer Science Volume 19: F'st Version of.. (context) - Dennis - 1974
1
of the 10 th International Symposium on Computer Architectur.. (context) - Iannucci, of et al. - 1983
1
The Design and Analysis of Computer Algorithma Addison- Wesl.. (context) - HopcrofL - 1974
1
Design of a Memory Controller for the MIT Tagged Token Dataf.. (context) - Heller - 1983
1
Optimizing Synchoronous Systems (context) - Leiserson, Saxe - 1983
1
ucuitry by Retiming Third Caltech Conference on VLSI (context) - Leiserson, Rose et al. - 1983
1
Computation Structures Group (context) - Brock, Streams - 1982
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lcs.mit.edu/publications/pubs/pdf/): More
Proving Correctness of a Distributed Shared Memory Implementation - Castro (1999)
(Correct)
Experience with Fine-Grain Synchronization in MIMD Machines.. - Yeung, Agarwal (1993)
(Correct)
Write Barrier Removal by Static Analysis - Zee, Rinard (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC