Skip to main content

Isolating the Reasons for the Performance of Parallel Machines on Numerical Programs

  • Chapter

Abstract

In this paper we present a nontrivial set of modules which measure performance parameters of node processors and interconnection networks. With the help of these parameters we explain the mu time of the following algorithms conjugate gradient method, one-dimensional partial differential equation solver and two-dimensional partial differential equation solver on the parallel machine Ncube-2. The iPSC/860 Hypercube and the vector machine VP100 are analyzed in an other paper (see [3]). Our explanations are sometimes within 0.5% and almost always within 5% of the measured run times.

This research is part of the PARANUSS—project, which is funded by BMFT and DLR.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.T. Feo. An Analysis of the Computational and Parallel Complexity of the Livermore Loops. In Parallel Computing, volume 7, pages 163–185, 1988.

    Google Scholar 

  2. A. Formella, S.M. Müller, W.J. Paul, and A. Bingen. Isolating the Reasons for the Performance of Parallel Machines on Numerical Programs I I. In A.J.G. Hey, editor, Portability and Performance for Parallel Processors. John Wiley & Sons, Ltd., 1993.

    Google Scholar 

  3. [4] R. Hockney. Performance parameters and benchmarking of supercomputers. Parallel Computing, 17:1111–1130, 1991.

    Google Scholar 

  4. R. W. Hockney and C. R. Jesshope. Parallel Computers 2. Adam Hilger, Bristol, 2nd edition, 1988.

    Google Scholar 

  5. F.H. McMahon. The Livermore Fortran Kernels Test of the Numerical Performance Range. Technical report, Livermore National Liboratory, 1988.

    Google Scholar 

  6. [7] W.J. Paul and D. Scheerer. The DATIS—P parallel machine. In Proceedings of H/CSS-24, volume I, pages 560–571, 1991.

    Google Scholar 

  7. [8] J. Stoer and A. Bulirsch. Einführung in die Numerische Mathematik, volume I/II of Heidelberger Taschenbücher, chapter 2, Das CG—Verfahren. Springer, 1972.

    Google Scholar 

  8. A.J. Van der Steen. The benchmark of the EuroBen group. Parallel Computing, 17: 1211 1221, 1991.

    Google Scholar 

  9. [10] R. Weicker. Dhrystone — a synthetic systems programming benchmark. In Communications of the ACM 27, volume 10, pages 1013–1030, Oct. 1984.

    Google Scholar 

  10. R.P. Weicker. A detailed look at some popular benchmarks. Parallel Computing, 17: 1153 1172, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Christoph W. Keßler

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden

About this chapter

Cite this chapter

Formella, A., Müller, S.M., Paul, W.J., Bingert, A. (1994). Isolating the Reasons for the Performance of Parallel Machines on Numerical Programs. In: Keßler, C.W. (eds) Automatic Parallelization. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-87865-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-87865-6_3

  • Publisher Name: Vieweg+Teubner Verlag

  • Print ISBN: 978-3-528-05401-4

  • Online ISBN: 978-3-322-87865-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics