Advertisement

A classification of algorithms which are well suited for implementations on the DAP as a basis for further research on parallel programming

  • Klaus D. Thalhofer
  • Karl D. Reinartz
Nonnumerical Algorithms (Session 5.2)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 237)

Abstract

Considering the programs which have been written for the DAP (Distributed Array Processor) by members of our research group or other institutes we are in contact with, one sees quickly that there are a few classes of algorithms which cover nearly all the work done on the DAP.

These classes are:
  • Operations from Linear Algebra (matrix multiplication, matrix inversion, solution of large systems of linear equations)

  • Bit-algorithms for the fast computation of function values

  • Arithmetic on numbers with variable lengths of representation

  • Simulations or similar computations on two-dimensional structures taking advantage of the north-east-south-west neighbourhood facilities of the DAP

  • "Large scale"-pipelining (in contrast to: "small scale"-pipelining, i.e. pipeline architectures)

In addition to the original DAP facilities some very tricky programming techniques have been developed. With the examples of "linear routing" and "recursive doubling" we shall point out how these techniques can be made available to all users by supplying them with "algorithm patterns" at a somewhat higher language level than provided by DAP-FORTRAN.

Key Words and Phrases

Parallel programming SIMD-principle algorithm patterns preprocessors recursive doubling routing binary decomposition large scale pipelining 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    DAP: FORTRAN Language, ICL Techn. Publ. 6918, 3rd Ed., 1981Google Scholar
  2. [2]
    Erhard W.: Feldrechner DAP: Invertierung großer Matrizen, Arbeitsberichte des Instituts für Math. Maschinen und Datenverarbeitung, Erlangen, Bd. 19, Nr. 1, 1986Google Scholar
  3. [3]
    Hockney R.W., Jesshope C.R.: Parallel Computers: Architecture, Programming and Algorithms, Bristol, 1981Google Scholar
  4. [4]
    Kogge P.M., Stone H.S.: A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations, IEEE Trans. Comp., Vol. C-22, No. 8, 1973, pp. 786–793Google Scholar
  5. [5]
    Kuck D.J.: The Structure of Computers and Computations, John Wiley & Sons, New York, 1978Google Scholar
  6. [6]
    Reinartz K.D.: Bitalgorithmen zur schnellen Berechnung transzendenter Funktionen auf Parallelrechnern, in: Proceedings of "Parallel Computing 83", Elsevier, North-Holland, 1984, pp. 217–224Google Scholar
  7. [7]
    UNIX Programmer's Manual, Vol. 2: Supplementary Documents, 7th Ed. (1979) in: ICL PERQ Manual, No. RP10126, 1983Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Klaus D. Thalhofer
    • 1
  • Karl D. Reinartz
    • 1
  1. 1.Institut für Mathematische Maschinen und DatenverarbeitungUniversität Erlangen-NürnbergErlangen

Personalised recommendations