Skip to main content
Springer Nature Link
Log in

Parallelism control scheme in a dataflow architecture

  • Conference paper
  • First Online:
Parallel Processing: CONPAR 92—VAPP V (VAPP 1992, CONPAR 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 634))

  • 134 Accesses

Abstract

We propose execution control scheme to realize an efficient multi-processing environment in dataflow architecture. With a unified software and hardware mechanism, we can detect states of processes at run time, which are treated as control information. We control the process level parallelism according to the hardware capacity, and virtualize high speed memory in dynamic data-driven computation where context changes in every instruction execution. We apply this scheme to the Datarol architecture, an optimized version of dynamic dataflow architecture, and evaluate them through software simulation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M.Amamiya, and R.Taniguchi: “Datarol: A Massively Parallel Architecture for Functional Language”, Proc. IEEE 2nd SPDP, pp.726–735 (Dec. 1990).

    Google Scholar 

  2. V.G.Grafe and J.E. Hoch: “The Epsilon-2 Multi-Processor System”, Journal of Parallel and Distributed Computing, 10, pp.309–318 (Oct. 1990).

    Google Scholar 

  3. G.M.Papadopoulos and E.C.Culler: “Monsoon: an Explicit Token-Store Architecture”, Proc. 17th ISCA, pp.82–91 (June 1990).

    Google Scholar 

  4. C.A.Ruggiero and J.Sargeant: “Control of Parallelism in the Manchester Dataflow Machine”, Proc. FPCA (Lecture Notes in Computer Science 274, Springer-Verlag), pp.1–15, (Sep. 1987).

    Google Scholar 

  5. S.Sakai, Y.Yamaguchi, K.Hiraki, Y.Kodama and T.Yuba: “An Architecture of a Dataflow Single Chip Processor”, Proc. 16th ISCA, pp.46–53 (May 1989).

    Google Scholar 

  6. T.Tachibana, R.Taniguchi and Amamiya,M.: “Compiling Method of Functional Programming Language Valid by Data Flow Analysis-Extraction of Datarol Program-”, Journal of Information Processing(in Japanese), Vol.30, No.12, pp.1628–1638 (Dec. 1989).

    Google Scholar 

  7. M.Takesue: “A Unified Resource Management and Execution Control Mechanism for Data Flow Machines”, Proc. 14th ISCA, pp.90–97 (Jun. 1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems, Kyushu University, Kasuga, 816, Fukuoka, Japan

    Shigeru Kusakabe, Takahide Hoshide, Rin-ichiro Taniguchi & Makoto Amamiya

Authors
  1. Shigeru Kusakabe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takahide Hoshide
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rin-ichiro Taniguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Makoto Amamiya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luc Bougé Michel Cosnard Yves Robert Denis Trystram

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kusakabe, S., Hoshide, T., Taniguchi, Ri., Amamiya, M. (1992). Parallelism control scheme in a dataflow architecture. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_478

Download citation

  • DOI: https://doi.org/10.1007/3-540-55895-0_478

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55895-8

  • Online ISBN: 978-3-540-47306-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation