Compiling APL for parallel execution on an FFP machine

  • Authors:
  • Alexis Koster

  • Affiliations:
  • Information Systems Department, San Diego State University

  • Venue:
  • APL '85 Proceedings of the international conference on APL: APL and the future
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper investigates the features of an APL compiler designed for a cellular computer (the FFP machine). This machine directly executes Formal Functional Programming (FFP) code. The APL compiler generates parallel FFP code. Techniques for parallel implementation of many APL array processing operators and functions are described. The implicit parallelism between different operations in a given APL program is also exploited. The FFP machine can accommodate the almost unbounded parallelism of FFP programs. Execution time analysis shows potential for highly efficient execution of APL programs on this machine.