Skip to main content
Log in

Implicit matrix multiplication with maximum accuracy on various transputer networks

Implizite Matrix Multiplikation mit maximaler Genauigkeit auf verschiedenen Transputer Netzwerken

  • Published:
Computing Aims and scope Submit manuscript

Abstract

The majority of numerical algorithms employs floating-point vector and matrix operations. On a parallel computer these algorithms should be solved fastand reliably in order to avoid a time-consuming error analysis. The XSC-languages (high-level language extensions for eXtended Scientific Computation) are well-suited for this purpose since they support the design of numerical algorithms delivering correct and automatically verified results. This goal is attained by an arithmetic with maximum accuracy (especially for vector and matrix operations), highly accurate standard functions, and exact evaluation of dot product expressions. Within theESPRIT Parallel Computing Action, one XSC-language, PASCAL-XSC, was implemented on a Supercluster Transputer System under the operating system HELIOS. Parallel algorithms for computationally intensive and maximally accurate matrix operations were implemented and tested on various transputer architectures. We will sketch some features of these architectures and present some benchmarks for the algorithms used. These algorithms form a parallel C runtime library of PASCAL-XSC (or any other XSC-language that uses a C runtime library) and are called automatically. This can be considered a basis for implicit parallelization in an XSC-language.

Zusammenfassung

Die meisten numerischen Algorithmen verwenden Gleitpunktoperationen für Matrizen und Vektoren. Auf Parallelrechnern sollten solche Algorithmen schnellund zuverlässig durchgeführt werden, um zeitaufwendige Fehleranalysen zu vermeiden. Die XSC-Sprachen (Spracherweiterungen für erweitertes wissenschaftliches Rechnen, englisch: eXtendedScientificComputation) sind für diesen Zweck gut geeignet, da sie den Entwurf numerischer Algorithmen unterstützen, die korrekte und automatisch verifizierte Ergebnisse liefern. Dieses Ziel wird durch eine Arithmetik mit maximaler Genauigkeit (insbesondere für Vektor- und Matrixoperationen), hochgenaue Standardfunktionen und exakte Auswertung von Skalarproduktausdrücken erreicht. Innerhalb derESPRIT Parallel Computing Action wurde eine XSC-Sprache, PASCAL-XSC, auf einem Supercluster Transputer System unter dem Betriebs-system HELIOS implementiert. Parallele Algorithmen für rechenintensive und maximal genaue Matrix-operationen wurden auf verschiedenen Transputerarchitekturen implementiert und getestet. Wir werden einige Merkmale dieser Architekturen kurz beschreiben und einige Benchmarks für die verwendeten Algorithmen angeben. Diese Algorithmen bilden eine parallele C Laufzeitbibliothek für PASCAL-XSC (oder irgend eine andere XSC-Sprache, die eine C-Laufzeitbibliothek benutzt) und werden automatisch aufgerufen. Dies kann als Grundstock für eine implizite Parallelisierung in einer XSC-Sprache angesehen werden.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Akl, S. G.: The design and analysis of parallel algorithms. New York: Prentice-Hall 1989.

    Google Scholar 

  2. Alefeld, G., Herzberger, J.: An introduction to interval computations. New York: Academic Press 1983.

    Google Scholar 

  3. Bohlender, G., Davidenkoff, A.: Accurate vector and matrix arithmetic for parallel computers In: Sendov, A. B. (ed.) Proceedings of the Third Workshop on Parallel and Distributed Processing, Sofia, Bulgaria, 16–19 April 1991. Amsterdam: Elsevier Science Publishers 1992.

    Google Scholar 

  4. Bohlender, G., Kulisch, U., Lohner, R., Walter, W.: Proposal for accurate floating-point vector arithmetic. Institut für Angewandte Mathematik, Universität Karlsruhe, 1993.

  5. Bohlender, G., Wolff v. Gudenberg, J.: Accurate matrix multiplications on the array computer AMT DAP. Talk at SCAN-90, Albena, Bulgaria, 1990, in [12], Kaucher, E., Markov, S. M., Mayer, G. (eds.): Computer arithmetic, scientific computation and mathematical modelling. IMACS annals on computing and applied mathematics. Proceedings of SCAN-90, Volume 12, Albena (Sep. 24–28, 1990), Baltzer, Basel, 1991, 133–150.

  6. Perihelion Software Ltd.: The CDL guide. Distributed Software Limited, 670 Aztec West, Bristol BS12 4SD, UK, part number H09014, 1990.

  7. Davidenkoff, A.: High accuracy arithmetic on transputers. Talk at SCAN-90, Albena, Bulgaria, 1990, in [12], Kaucher, E., Markov, S. M., Mayer, G. (eds.): Computer arithmetic, scientific computation and mathematical modelling. IMACS annals on computing and applied mathematics. Proceedings of SCAN-90, Volume 12, Albena (Sep. 24–28, 1990), Baltzer, Basel, 1991, 45–61.

  8. Perihelion Software Ltd.: HELIOS technical reports. Technical Report No. 22, Distributed Software Limited, 1990.

  9. Hockney, R. W., Jesshope, C. V. R. Parallel computers 2. Bristol Philadelphia: Adam Hilger 1988.

    Google Scholar 

  10. American National Standards Institute/Institute of Electrical and Electronics Engineers: IEEE standard for binary floating-point arithmetic. ANSI/IEEE Std 754-1985, New York, 1985.

  11. IMACS, GAMM: Resolution on computer arithmetic. Math. Comput. Simul.31, 297–298 (1989).

    Google Scholar 

  12. Kaucher, E., Markov, S. M., Mayer, G. (eds.): Computer arithmetic, scientific computation and mathematical modelling. IMACS annals on computing and applied mathematics. Proceedings of SCAN-90, Volume 12, Albena (Sep. 24–28, 1990), Baltzer, Basel, 1991.

  13. Parsytec Computer GmbH: PARIX release 1.2. Manual pages. Parsytec Computer GmbH, Aachen, Juelicher Strasse 338, Germany 1993.

  14. Perihelion Software Ltd.: The HELIOS operating system. New York: Prentice-Hall 1989.

    Google Scholar 

  15. Klatte, R., Kulisch, U., Neaga, M., Ratz, D., Ullrich, Ch.: PASCAL-XSC, language reference with examples. Berlin Heidelberg New York Tokyo: Springer 1991.

    Google Scholar 

  16. Kulisch, U., Miranker, W. L.: Computer arithmetic in theory and practice. New York: Academic Press 1981.

    Google Scholar 

  17. Kulisch, U., Miranker, W. L. (eds.): A new approach to scientific computation. Notes and Reports in Computer Science and Applied Mathematics. Orlando: Academic Press 1983.

    Google Scholar 

  18. Leuprecht, H., Oberaigner, W.: Parallel algorithms for the rounding exact summation of floating point numbers. Computing28, 89–104 (1982).

    Article  MathSciNet  Google Scholar 

  19. Reith, R.: Verified solution of linear systems on transputer networks. Talk at SCAN-90, Albena, Bulgaria, 1990, in [12], Kaucher, E., Markov, S. M., Mayer, G. (eds.): Computer arithmetic, scientific computation and mathematical modelling. IMACS annals on computing and applied mathematics. Proceedings of SCAN-90, Volume 12, Albena (Sep. 24–28, 1990), Baltzer, Basel, 1991, 377–392.

  20. Trier, R.: Design und Implementierung der hochgenauen Matrixmultiplikation auf verschiedenen Transputerarchitekturen. Diplomarbeit, Institut für Angewandte Mathematik, Universität Karlsruhe, 1992.

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported by DFG and ESPRIT Parallel Computing Action.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bohlender, G., Kersten, T. & Trier, R. Implicit matrix multiplication with maximum accuracy on various transputer networks. Computing 53, 259–276 (1994). https://doi.org/10.1007/BF02307378

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02307378

AMS Subject Classifications

Key words

Navigation