Partial computation with a dataflow machine

  • Satoshi Ono
  • Naohisa Takahashi
  • Makoto Amamiya
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 220)


This paper presents a new dataflow computation model, named the Generation Bridging Operator (GBO) model. The model uses a partially ordered color set as well as newly defined firing rules extended from those of the colored token (CT) model.

This paper focuses discussion on one category of the GBO model, named the dynamic coloring static bridging (DCSB) model. It is shown that the DCSB model is able to process a closure as well as a restricted class of partial computation. This paper also clarifies a dataflow graph generation method for the DCSB model by describing the main differences in code generation between the DCSB model and the CT model.

The proposed dataflow models are promising for applicative programing language machine architectures.

Key words

functional programming data flow parallel processing higher-order function closure code generation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Turner, D.A.: "A New Implementation Technique for Applicative Languages," Software Practice and Experience, Vol. 9, 1979, pp. 31–49.Google Scholar
  2. [2]
    Keller,R.M.: "FEL (Function-Equation Language) Programmer's Guide," AMPS Technical Memorandum No. 7, University of Utah, April 1982.Google Scholar
  3. [3]
    Amamiya,M., Hasegawa,R. and Ono,S.: "Valid, A High-Level Functional Programming Language for Data Flow Machines," Review of ECL, Vol.32, No.5, 1984.Google Scholar
  4. [4]
    Arvind and Kathail,V.: "A Multiple Processor Dataflow Machine That Supports Generalized Procedures," Proceedings of the 8th Annual Symposium on Computer Architecture, May 1981, pp. 291–302.Google Scholar
  5. [5]
    Gurd, J. and Watson, I.: "Data Driven System for High Speed Parallel Computing (1 & 2)," Computer Design, Vol. 9, No. 6 & 7, June & July 1980, pp. 91–100 & 97–106.Google Scholar
  6. [6]
    Takahashi,N. and Amamiya,M.: "A Data Flow Processor Array System: Design and Analysis," Proceedings of the 10th Annual Symposium on Computer Architecture, June 1983, pp. 243–250.Google Scholar
  7. [7]
    Amamiya,M., Hasegawa,R., Nakamura,O. and Mikami,H.: " A list-processing-oriented data flow machine architecture," Proceedings of the 1982 National Computer Conference, AFIPS, 1982, pp. 143–151.Google Scholar
  8. [8]
    Keller, R.M., Lindstrom, G. and Patil, S.: "A Loosely Coupled Applicative Multiprocessing System," Proceedings of the 1979 National Computer Conference, AFIPS, Vol. 49, 1979, pp. 613–622.Google Scholar
  9. [9]
    Darlington,J. and Reeve,M.: "ALICE: A Multi-Processor Reduction Machine for the Parallel Evaluation of Applicative Languages," Proceedings of the 1981 ACM/MIT Conference on Functional Programming Language and Computer Architecture, 1981, pp. 65–75.Google Scholar
  10. [10]
    Henderson,P.: "Functional Programming, Application and Implementation," Prentice-Hall, 1980.Google Scholar
  11. [11]
    Allen,J.: "Anatomy of LISP," McGraw-Hill, 1978.Google Scholar
  12. [12]
    Ershov, A.P.: "Mixed Computation: Potential Application and Problems for Study," Theoretical Computer Science 18, 1982, pp. 41–67.CrossRefGoogle Scholar
  13. [13]
    Backus, J.: "Can Programming be Liberated from the von Neumann Style? A Functional Style and its Algebra of Programs," Comm. ACM, Vol. 21, No. 8, 1978, pp.613–641.CrossRefGoogle Scholar
  14. [14]
    Aho,A.V.: "Principles of Compiler Design", Addison-Wesley, 1977Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Satoshi Ono
    • 1
  • Naohisa Takahashi
    • 1
  • Makoto Amamiya
    • 1
  1. 1.Musashino Electrical Communication LaboratoryNippon Telegraph and Telephone Public CorporationTokyoJapan

Personalised recommendations