Skip to main content

Specialization of Numerical Programs with the FSpec System

  • Chapter
  • 78 Accesses

Summary

We investigate the partial evaluation of numerical programs. Results for numerical algorithms from different subject areas are presented: linear equation solving by Gaussian elimination, polynomial approximation using the telescope algorithm, and numerical integration using the trapezoid rule. The results vary depending on the structure and specific use of the numerical algorithms. Some applications show high speedups, others only moderate improvements. All programs are written in Fortran 77, specialized using our Fortran specializer, and compiled using a commercial Fortran compiler.

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   29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   39.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.

Bibliography

  1. Collected Algorithms from ACM. Vol. I, Alg. 37; Vol. II, Alg 257.

    Google Scholar 

  2. Romana Baier, Robert Glück, and Robert Zb’ehling. Partial evaluation of numerical programs in Fortran. In: ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, University of Melbourne, Technical Report 94/9, pages 119-132, 1994.

    Google Scholar 

  3. Andrew Berlin and Daniel Weise. Compiling scientific code using partial evaluation. In: IEEE Computer, 23(12): 25–37, 1990.

    Article  Google Scholar 

  4. Walter Gander. Computer Mathematik. Birkhäuser Verlag, Basel, 1992.

    MATH  Google Scholar 

  5. Robert Glück, Ryo Nakashige, and Robert Zöchling. Binding-time analysis applied to mathematical algorithms. In: Dolezal J., Fidler J. (eds.), 17th IFIP Conference on System Modelling and Optimization, pages 137-146, Chapman & Hall 1995.

    Google Scholar 

  6. Chris Goad. Automatic construction of special purpose programs. In: Loveland D.W. (ed.), 6th Conference on Automated Deduction, Lecture Notes in Computer Science, vol. 138, 194-208, Springer-Verlag, 1982.

    Google Scholar 

  7. F.G. Gustavson, W. Liniger and A. R. Willoughby. Symbolic generation of an optimal Crout algorithm for sparse systems of linear equations. In: Journal of the ACM, 17(1): 87–109, 1970.

    Article  MATH  Google Scholar 

  8. Paul Kleinrubatscher, Albert Kriegshaber, Robert Zöchling, and Robert Glück. Fortran program specialization. SIGPLAN Notices, 30(4):61–70, 1995.

    Article  Google Scholar 

  9. Robert Metzger and Sean Stroud. Interprocedural constant propagation: an empirical study. In: ACM Letters on Programming Languages and Systems, 2(1-4): 213–32, 1993.

    Article  Google Scholar 

  10. Christoph Überhuber. Computer Numerik. Vol. I, Springer Verlag, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wolfgang Mackens Siegfried M. Rump

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Fachmedien Wiesbaden

About this chapter

Cite this chapter

Baier, R., Glück, R., Zöchling, R. (1996). Specialization of Numerical Programs with the FSpec System. In: Mackens, W., Rump, S.M. (eds) Software Engineering im Scientific Computing. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-85027-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-85027-0_11

  • Publisher Name: Vieweg+Teubner Verlag, Wiesbaden

  • Print ISBN: 978-3-322-85028-7

  • Online ISBN: 978-3-322-85027-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics