Evaluation of graph representations with active nodes

  • Masayuki Numao
  • Masamichi Shimura
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 220)


In recent years, the reduction scheme is widely recognized as a good implementing method of functional languages. In most parallel reduction methods, it is required to inspect and update a program graph in a common store. However, this results in memory conflictions and makes a trouble in constructing a correct reducer. This paper presents a method for reducing a graph by each active node. In our method, the graph is divided and distributed to each local memory of a processing unit, and is reduced by a process assigned to each node. Since reduction is performed in each node, parallel reduction is realized without a common store.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Amamiya 82]
    Amamiya,M., Hasegawa,R., Nakamura,O. and Mikami,H.: A list-processing-oriented data flow machine architecture. AFIPS NCC, pp.143–151(1982).Google Scholar
  2. [Berkling 75]
    Berkling, K.: Reduction languages for reduction machines, Proc. 2nd Int. Symp. Computer Architecture, IEEE, New York, pp.133–140(1975).Google Scholar
  3. [Bernstein 80]
    Bernstein, A.J.: Output guards and nondeterminism in "Communicating sequential processes", ACM Trans. Prog. Lang. Syst., Vol.2, No.2, pp.234–238(1980).Google Scholar
  4. [Clarke 80]
    Clarke,T.J.W., Gladstone,P.J.S., Maclean,C.D. and Norman,A.C.: SKIM — The S.K.I. reduction machine, Proc. LISP-80 Conf., pp.128–135(1980).Google Scholar
  5. [Darlington 81]
    Darlington,J. and Reeve,M.: ALICE:A multi-processor reduction machine for the parallel evaluation of applicative languages, Proc. Functional Programming Languages and Computer Architecture, pp.65–75(1981).Google Scholar
  6. [Futamura 82]
    Futamura, Y.: Partial computation of programs, Lecture Notes in Computer Science, No.147, RIMS Symposia on Software Science and Engineering, Kyoto, Springer-Verlag(1982).Google Scholar
  7. [Hoare 78]
    Hoare, C.A.R.: Communicating sequential processes, Comm. ACM, Vol.21, No.8, pp.666–677(1978).CrossRefGoogle Scholar
  8. [Hughes 82]
    Hughes,R.J.M.: Super-combinators — A new implementation method for applicative languages, Record of the 1982 ACM symposium on LISP and Functional Programming, Pittsburgh, pp.1–10(1982).Google Scholar
  9. [Keller 78]
    Keller, R.M., Lindstrom, G. and Patil, S.: A loosely-coupled applicative multi-processing system, AFIPS Conf. Proc., Vol.48, pp.613–622(1979).Google Scholar
  10. [Keller 79]
    Keller,R.M., Lindstrom,G. and Patil,S.: An architecture for a loosely-coupled parallel processor, UUCS-78-105, Univ. of Utah(1978).Google Scholar
  11. [Mago 79]
    Mago, G.A.: A network of microprocessors to execute reduction languages, Two parts, Int. J. Comput. Inf. Sci., Vol.8, No.5, pp.349–385 and No.6, pp.435–471(1979).CrossRefGoogle Scholar
  12. [Numao 85]
    Numao, M. and Shimura, M.: Evaluation of the functional symbol manipulation language in distributed systems, Transactions of Information Processing Society of Japan, Vol.26, No.2(1985) (in Japanese).Google Scholar
  13. [Ritchie 74]
    Ritchie, D.M. and Thompson, K.: The UNIX Time-Sharing System, Comm. ACM, Vol.17, No.7, pp.365–375(1974).CrossRefGoogle Scholar
  14. [Turner 79]
    Turner, D.A.: A new implementation technique for applicative languages, Softw. Pract. Exper., Vol.9, pp.31–49(1979).Google Scholar
  15. [Wadsworth 71]
    Wadsworth,C.P.: Semantics and pragmatics of the lambda-calculus, Oxford University: DPhil. Thesis, Chapter 4(1971).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Masayuki Numao
    • 1
  • Masamichi Shimura
    • 1
  1. 1.Department of Computer ScienceTokyo Institute of TechnologyTokyoJapan

Personalised recommendations