Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Free access

Monsoon: an explicit token-store architecture

Published: 01 May 1990 Publication History

Abstract

Dataflow architectures tolerate long unpredictable communication delays and support generation and coordination of parallel activities directly in hardware, rather than assuming that program mapping will cause these issues to disappear. However, the proposed mechanisms are complex and introduce new mapping complications. This paper presents a greatly simplified approach to 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. It may be viewed as a generalization of a fairly primitive von Neumann architecture. Although the addressing capability is restrictive, there is exactly one instruction executed for each action on the dataflow graph. Thus, the machine oriented ETS model provides new understanding of the merits and the real cost of direct execution of dataflow graphs.

References

[1]
Arvind and D. E. Culler. Managing Resources in a Parallel Machine. In PTOC. of IFIP TC-10 Working Conference on Fifth Generation Computer Architecture, Manchester, England. North-Holland Publishing Company, July 1985.
[2]
Arvind and D. E. Culler. Dataflow Architectures. In Annual Reviews in CompvterScience, volume 1, pages 225-253. Annual Reviews Inc., Palo Alto, CA, 1986. Reprinted in Dataflow and Reduction Architectures, S. S. Thakkar, editor, IEEE Computer Society Press, 1987.
[3]
Arvind, D. E. Culler, and K. Ekanadham. The Price of Asynchronous Parallelism: an Analysis of Dataflow Architectures. In Proc. of CONPAR 88, Univ. of Manchester, September 1988. British Computer Society - Parallel Processing Specialists. (also CSG Memo No. 278, MIT Lab for Computer Science).
[4]
Arvind, D. E. Culler, R. A. Iannucci, V. Kathail, K. Pingali, and R. E. Thomas. The Tagged Token Dataflow Architecture. Technical Report FLA memo, MIT Lab for Computer Science, 545 Tech. Sq, Cambridge, MA, August 1983. R.evised October, 1984.
[5]
Arvind, D. E. Culler, and G. K. Maa. Assessing the Benefits of Fine-Grain Parallelism in Dataflow Programs. The Int 'l Journal ofSupercomputer.Applications, 2(3), November 1988.
[6]
Arvind, M. L. Dertouzos, R. S. Nikhil, and G. M. Papadopoulos. PROJECT DATAFLOW, a Parallel Computing System Based on the Monsoon Architecture and the Id Programming Language. Technical Report CSG Memo 285, MIT Lab for Computer Science, 545 Tech. Sq, Cambridge, MA, 1988.
[7]
Arvind and K. Ekanadham. Future Scientific Programming on Parallel Machines. The Journal of Parallel and Distributed Computing, 5(5):460-493, October 1988.
[8]
Arvind, S. K. Heller, and R. S. Nikhil. Programming Generality and Parallel Computers. In Proc. of the Fourth Int'l Symp. on Biological and Artificial Intelligence Systems, pages 255-286, Trento, Italy, September 1988. ESCOM (Leider).
[9]
Arvind and R. A. Iannucci. Two Fundamental Issues in Multiprocessing. In Proc. of DFVLR - Conference 1987 on Parallel Processing in Science and Engineering, Bonn-Bad Godesberg, W. Germany, June 1987.
[10]
R. G. Babb II, editor. Programming Parallel Processors. Addison-Wesley Pub. Co., Reading, Mass., 1988.
[11]
L. Bit. A Process-Oriented Model for Efficient Execution of Dataflow Programs. In PTOC. ofthe 7th Intl Conference on Distribute!d Computing, Berlin, West Germany, September 1987.
[12]
G. Chaitin, M. Auslander, A., Chandra, J. Cocke, M. Hopkins, and P. Markstein. Register Allocation via Coloring. Computer Languages, 6:47-57, 1981.
[13]
D. E. Culler. Managing Parallelism and Resources in Scientific Dataflow Programs. PhD Ohesis, MIT Dept. of Electrical Engineering and Computer Science, Cambridge, MA, June 1989. To appear as MIT Lab for Computer Science TR446.
[14]
.I. Darlington and M. Reeve. ALICE - A Multi- Processor Reduction Machine for Parallel Evaluation of Applicative Languages. In Proc. of the 1981 Conference on Functional Programming and Computer Architecture, pages 65-76, 1981.
[15]
J. B. Dennis. Data Flow Supercomputers. IEEE Computer, pages 48-56, November 1980.
[16]
J. B. Dennis and D. P. Misunas. A Preliminary Architecture for a Basic Dataflow Processor. In hoc. Of the 2nd Annual Symp. on Compute2 Ar- &lecture, page 126. IEEE, January 1975.
[17]
J. B. Dennis, J. E. Stoy, and B. Guharoy. VIM: An Experimental Multi-User System Supporting Functional Programming. In Proc. of the 1984 lntl Workshop on High-Level Computer Architecture, pages 1.1-1.9, Los Angeles, CA, May 1984.
[18]
D.D. Gajski, D.A. Padua, David J. Kuck, and R.H. Kuhn. A Second Opinion of Data Flow Machines and Languages. IEEE Computer, 15(2):58- 69, February 1982.
[19]
V. G. Grafe, J. E. Hoch, and Davidson G.S. Eps'88: Combining the Best Features of von Neumann and Dataflow Computing. Technical Report SAND88-3128, Sandia National Laboratories, January 1989.
[20]
J. Gurd, CC. Kirkham, and I. Watson. The Manchester Prototype Dataflow Computer. Communications of the Association for Computing Machinery, 28(1):34-52, January 1985.
[21]
J. L. Gusatf on, G. R. Montry, and R. E. Benner. Development of Parallel Methods for a 1024 Processor Hypercube. SIAM Journal on Scientific and Statistical Computing, 9(4), July 1988.
[22]
S. K. Heller. Efficient lazy data-structures on a dataflow machine. Technical Report LCS/MIT/TR-438, MIT Lab for Computer Science, 545 Tech. Sq, Cambridge, MA, 1988. (PhD Thesis, Dept. of EECS, MIT).
[23]
R. A. Iannucci. A Dataflow/von Neumann Hybrid Architecture. Technical Report TR-418, MIT Lab for Computer Science, 545 Tech. Sq, Cambridge, MA, May 1988. (PhD Thesis, Dept. of EECS, MIT).
[24]
R. M. Keller and F. C. Lin. Simulated Performance of a Reduction-Based Multiprocessor. IEEE Computer, pages 70-82, July 1984.
[25]
R. M. Keller, G. Lindstrom, and S. Patil. A Loosely-Coupled Applicative Multi-Processing System. In Proc. of the National Computer Conference, volume 48, pages 613-622, New York, NY, June 1979.
[26]
R. S. Nikhil and Arvind. Can Dataflow Sub sume von Neumann Computing? In Proc. of the 16th Annual Int'l Symp. on Computer Architecture, Jerusalem, Israel, May 1989. To appear.
[27]
G. M. Papadopoulos. Implementation of a General Purpose Dataflow Multiprocessor. Technical Report TR432, MIT Lab for Computer Science, 545 Tech. Sq, Cambridge, MA, September 1988. (PhD Thesis, Dept. of EECS, MIT).
[28]
J. Rumbaugh. A Data Flow Multiprocessor. IEEE Transactions on Computers, C-26(2):138- 146, February 1977.
[29]
T. Shimada, K. Hiraki, and K. Nishida. An Architecture of a Data Flow Machine and its Evaluation. In Proc. of CompCon 84, pages 486-490. IEEE, 1984.
[30]
K. R. Traub. A Compiler for the MIT Tagged- Token Dataflow Architecture. Technical Report TR-370, MIT Lab for Computer Science, 545 Tech. Sq, Cambridge, MA, August 1986. (MS Thesis, Dept. of EECS, MIT).
[31]
W. Weber and A. Gupta. Exploring the Benefits of Multiple Hardware Contexts in a Multiprocessor Architecture: Preliminary Results. In Proc. of the 1989 Int'l Symp. on Computer Architecture, pages 273-280, Jerusalem, Israel, May 1989.
[32]
K. Weng. An Abstract Implementation for a Generalized Data Flow Language. Technical Report MIT/LCS/TR-228, MIT Lab for Computer Science, 545 Tech. Sq, Cambridge, MA, 1979. (PhD Thesis, Dept. of EECS, MIT).

Cited By

View all
  • (2024)UDIR: Towards a Unified Compiler Framework for Reconfigurable Dataflow ArchitecturesIEEE Computer Architecture Letters10.1109/LCA.2023.334213023:1(99-103)Online publication date: Jan-2024
  • (2024)Revet: A Language and Compiler for Dataflow Threads2024 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA57654.2024.00016(1-14)Online publication date: 2-Mar-2024
  • (2023)Improving Utilization of Dataflow Unit for Multi-Batch ProcessingACM Transactions on Architecture and Code Optimization10.1145/363790621:1(1-26)Online publication date: 18-Dec-2023
  • Show More Cited By

Index Terms

  1. Monsoon: an explicit token-store architecture

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM SIGARCH Computer Architecture News
    ACM SIGARCH Computer Architecture News  Volume 18, Issue 2SI
    Special Issue: Proceedings of the 17th annual international symposium on Computer Architecture
    June 1990
    356 pages
    ISSN:0163-5964
    DOI:10.1145/325096
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 May 1990
    Published in SIGARCH Volume 18, Issue 2SI

    Check for updates

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)174
    • Downloads (Last 6 weeks)29
    Reflects downloads up to 12 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)UDIR: Towards a Unified Compiler Framework for Reconfigurable Dataflow ArchitecturesIEEE Computer Architecture Letters10.1109/LCA.2023.334213023:1(99-103)Online publication date: Jan-2024
    • (2024)Revet: A Language and Compiler for Dataflow Threads2024 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA57654.2024.00016(1-14)Online publication date: 2-Mar-2024
    • (2023)Improving Utilization of Dataflow Unit for Multi-Batch ProcessingACM Transactions on Architecture and Code Optimization10.1145/363790621:1(1-26)Online publication date: 18-Dec-2023
    • (2022)RipTide: A Programmable, Energy-Minimal Dataflow Compiler and ArchitectureProceedings of the 55th Annual IEEE/ACM International Symposium on Microarchitecture10.1109/MICRO56248.2022.00046(546-564)Online publication date: 1-Oct-2022
    • (2021)DiAG: a dataflow-inspired architecture for general-purpose processorsProceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3445814.3446703(93-106)Online publication date: 19-Apr-2021
    • (2021)Virtual-Link: A Scalable Multi-Producer Multi-Consumer Message Queue Architecture for Cross-Core Communication2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS49936.2021.00027(182-191)Online publication date: May-2021
    • (2018)Composable building blocks to open up processor designProceedings of the 51st Annual IEEE/ACM International Symposium on Microarchitecture10.1109/MICRO.2018.00015(68-81)Online publication date: 20-Oct-2018
    • (2016)A task-uncoordinated distributed dataflow model for scalable high performance parallel program executionParallel Computing10.1016/j.parco.2015.10.01351:C(79-87)Online publication date: 1-Jan-2016
    • (2015)Performance Analysis of Data-Driven Pipelined Computer ArchitecturesInternational Journal of Modelling and Simulation10.1080/02286203.2000.1144216220:3(236-247)Online publication date: 15-Jul-2015
    • (2014)HPXProceedings of the 8th International Conference on Partitioned Global Address Space Programming Models10.1145/2676870.2676883(1-11)Online publication date: 6-Oct-2014
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media