Skip to main content

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

Despite recent advances, predicting the performance of functional programs on real machines remains something of a black art. This paper reports on one particularly unexpected set of results where small variations in the dynamic heap settings occasionally gave rise to significant differences in CPU performance. These performance spikes can be traced to the direct-mapped cache of the machine being benchmarked, the widely-used Sun Sparcstation 1.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sansom PM, “Time Profiling in a Lazy Functional Language”, This Proceedings.

    Google Scholar 

  2. Hartel P, and Vree WG, “Benchmarking Lazy Functional Languages”, Proc. FPCA 93, Copenhagen, Denmark, (June 1993).

    Google Scholar 

  3. Wakeling D and Runciman C, “Heap Profiling a Lazy Functional Compiler”, Proc. 1992 Glasgow Workshop on Functional Programming, (1992), pp. 203–214.

    Google Scholar 

  4. Clayman S, Parrott D and Clack C, “A profiling technique for lazy higher-order functional programs”, Internal Report, Department of Computing Science, University College London, (November 1991).

    Google Scholar 

  5. Peyton Jones SL, Hall CV, Hammond K, Partain WD, and Wadler PL, “The Glasgow Haskell compiler: a technical overview”, Proc. JFIT Conference, Keele, UK, (March 1993).

    Google Scholar 

  6. Sun Microcomputers Inc., Sun Performance Tuning Overview, (December 1992).

    Google Scholar 

  7. Irlam G, “The Low Level Computational Performance of Sparcstations: a Guide for Compiler Writers”, Internal Report, Dept. of Computing Science, Adelaide University.

    Google Scholar 

  8. Stone HS, High-Performance Computer Architecture, Addison-Wesley, Reading Mass., (1987).

    Google Scholar 

  9. Hammond K, “Functional Programming Languages and a Computer Architecture”, Internal Report, Dept. of Comp. Sci., Glasgow University, (June 1993).

    Google Scholar 

  10. Sansom PM, “Generational Garbage Collection for Haskell”, Proc. FPCA 93, Copenhagen, Denmark, (June 1993), pp. 106–116.

    Google Scholar 

  11. Hammond K, and Peyton Jones SL, “Profiling Scheduling Strategies on the GRIP Parallel Reducer”, Proc 4th Intl Workshop on Parallel Implementation of Functional Languages, Kuchen H and Loogen R (Eds), RWTH, Aachen, (1992).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 British Computer Society

About this chapter

Cite this chapter

Hammond, K., Burn, G.L., Howe, D.B. (1994). Spiking Your Caches. In: O’Donnell, J.T., Hammond, K. (eds) Functional Programming, Glasgow 1993. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3236-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3236-3_5

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19879-6

  • Online ISBN: 978-1-4471-3236-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics