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

  • Authors:
  • Yen-Chun Lin

  • Affiliations:
  • -

  • Venue:
  • Parallel Computing
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

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.