Parallel associative combinator evaluation II

https://doi.org/10.1016/0167-739X(92)90065-JGet rights and content

Abstract

A new evaluation model for SK combinator expressions is presented and used as a basis for the design of a novel processor. The resulting machine architecture resembles a dataflow ring, but executions are constrained to be fully lazy. An automatic dynamic load sharing mechanism for a distributed multiprocessor architecture is suggested, and initial simulation results are presented.

References (16)

  • Arvind et al.

    Two fundamental issues in multiprocessing

  • Arvind et al.

    Executing a program on the tagged-token dataflow architecture

  • L Augustsson et al.

    Version 0.99 of LML

    (1990)
  • D.J Bevan et al.

    Principles for the design of a distributed memory architecture for parallel graph reduction

    Comput. J.

    (1989)
  • T.J Clarke et al.

    SKIM - the S K I reduction machine

  • P.H Hartel et al.

    Statistics on graph reduction of SASL programs

    Software - Practice and Experience

    (March 1988)
  • M.J Heaton

    Pacetool: A monitoring tool for PACE

    (September 1990)
  • J Hughes

    The design and implementation of programming languages

    (1983)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 1992 Published by Elsevier B.V.