Paper
An FP-based tool for the synthesis of regular array algorithms*

https://doi.org/10.1016/S0167-8191(05)80148-6Get rights and content

Abstract

Regular array algorithms achieve high performance by using identical processing elements and are suitable for VLSI implementation. FP is a functional language that supports parallel thinking naturally. We have implemented a tool to automatically synthesize regular array algorithms from programs written in a dialect of FP called aFP. The tool avoids human errors and ensures that all the derivable algorithms from a single aFP program can be obtained. It also generates tables for another tool to produce parallel Occam programs running on a transputer multiprocessing system.

References (19)

  • A.C. Fleck

    Structuring FP-style functional programs

    Comput. Languages

    (1986)
  • J. Annevelink et al.

    HIFI: A functional design system for VLSI processing arrays

  • J. Backus

    Can programming be liberated from the von Neumann style? A functional style and its algebra of programs

    CACM

    (1978)
  • J. Backus

    From function level semantics to program transformation and optimization

  • J.A.B. Fortes et al.

    Systematic design approaches for algorithmically specified systolic arrays

  • J.Y. Halpern et al.

    Completeness of rewrite rules and rewrite strategies for FP

    J. ACM

    (1990)
  • R.W. Hartenstein et al.

    A CHDL-based CAD system for the synthesis of systolic architectures

  • C.H. Huang et al.

    The derivation of systolic implementations of programs

    Acta Inform

    (1987)
  • H.T. Kung et al.

    Systolic arrays (for VLSI)

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

Cited by (0)

*

This research was supported in part by the National Science Council of ROC under contract NSC-79-0408-E011-05.

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