Jügen Sauermann
ABSTRACT
The suitability of APL as a programming language for parallel computers seems to be obvious. Nevertheless, integral concepts of parallel APL machines are rare. Some ideas published so far are either not feasible with today's technology (e.g. needing large crossbar switches, which are expensive) or not detailed enough to prove their feasibility
At SaarbrUcken university, we developed a 32-processor prototype of a parallel APL machine along with a high performance network designed for up to 256 processors. Besides building the prototype (which shows the feasibility with today's technology), we specified in detail, in which way the parallel APL machine is operating.
In this paper, we present the basic principles of the parallel APL machine together with the efficiency of the machine for the most important APL functions. The details are described in [Sa].
- ACM.Association for Computing Machinery: Draft proposed standard programming language APL ML Quote Quad , Vol. I4 , No. 2Google Scholar
- Ba.KE. Batcher: Sorting networks and their applications Proc. MIPS 1968 SJCC , Vol. 32Google Scholar
- Ka.R. Kanner: The Use Aad Disuse Of APL: An Empirical Study APL 82 Conference Proceedings, APL Quote Quad Vol. 13 Google ScholarDigital Library
- Sa.J. Sauermann: Ein paralleler APLdechner Dissertation, Universitlt des Saarloodes, 1989Google Scholar
- SaWe.HJ Saal, Z. Weiss: An Empirical Study Of APL Programs Computer Languages, Vol. 2, 1977Google Scholar
- Va.L.G.Valiant: A scheme for fast parallel communication SIAhf Journal on Computation. Nd. II, 1982Google Scholar
- Wa.A Waksman: A permutation network Journal ACAi , Vol. 15 , No. I , 1968 Google ScholarDigital Library
Index Terms
- A parallel APL machine
Recommendations
A parallel APL machine
APL 90: for the future conference proceedings (Copenhagen, Denmark, Aug. 13–17, 1990)The suitability of APL as a programming language for parallel computers seems to be obvious. Nevertheless, integral concepts of parallel APL machines are rare. Some ideas published so far are either not feasible with today's technology (e.g. needing ...
An experimental APL compiler for a distributed memory parallel machine
Supercomputing '94: Proceedings of the 1994 ACM/IEEE conference on SupercomputingWe developed an experimental APL compiler for the IBM SP1 distributed memory parallel machine. It accepts classical APL programs, without additional directives, and generates parallelized C code for execution on the SP1 machine. The compiler exploits ...
Compiling APL for parallel execution on an FFP machine
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 ...
Comments