Skip to main content
SpringerLink
Log in

Auburn: A kit for benchmarking functional data structures

  • Conference paper
  • First Online:
Book cover Implementation of Functional Languages (IFL 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1467))

Included in the following conference series:

Abstract

Benchmarking competing implementations of a data structure can be both tricky and time consuming. The efficiency of an implementation may depend critically on how it is used. This problem is compounded by persistence. All purely functional data structures are persistent. We present a kit that can generate benchmarks for a given data structure. A benchmark is made from a description of how it should use an implementation of the data structure. The kit will improve the speed, ease and power of the process of benchmarking functional data structures.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The Auburn Home Page. http://www.cs.york.ac.uk/~gem/auburn/.

    Google Scholar 

  2. James R. Driscoll, Neil Sarnak, Daniel D. Sleator, and Robert E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1): 86–124, February 1989.

    Article  MATH  MathSciNet  Google Scholar 

  3. Graphviz: Tools for viewing and interacting with graph diagrams, http://www.research.att.com/sw/tools/graphviz/.

    Google Scholar 

  4. Robert Hood and Robert Melville. Real-time queue operations in pure Lisp. Information Processing Letters, 13(2): 50–54, November 1981.

    Article  Google Scholar 

  5. Chris Okasaki. Simple and efficient purely functional queues and deques. Journal of Functional Programming, 5(4): 583–592, October 1995.

    Article  Google Scholar 

  6. Chris Okasaki. Purely Functional Data Structures. PhD thesis, School of Computer Science, Carnegie Mellon University, September 1996.

    Google Scholar 

  7. Chris Okasaki. The role of lazy evaluation in amortized data structures. In Proceedings of the International Conference on Functional Programming, pages 62–72. ACM Press, May 1996.

    Google Scholar 

  8. Simon Peyton Jones, Thomas Nordin, and Alastair Reid. Green Card: A foreign-language interface for Haskell. In Haskell Workshop, Amsterdam, June 1997. Published by Oregon Graduate Institute of Science & Technology.

    Google Scholar 

  9. D. L. Shell. A high-speed sorting procedure. Communications of the ACM, 2(7): 30–32, 1959.

    Article  Google Scholar 

  10. York Functional Programming Group. http://www.cs.york.ac.uk/fp/.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of York, UK

    Graeme E. Moss & Colin Runciman

Authors
  1. Graeme E. Moss
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Colin Runciman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Chris Clack Kevin Hammond Tony Davie

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moss, G.E., Runciman, C. (1998). Auburn: A kit for benchmarking functional data structures. In: Clack, C., Hammond, K., Davie, T. (eds) Implementation of Functional Languages. IFL 1997. Lecture Notes in Computer Science, vol 1467. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055429

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64849-9

  • Online ISBN: 978-3-540-68528-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation