Skip to main content
SpringerLink
Log in

Cache-Oblivious Sorting

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 141 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Aggarwal A, Vitter JS (1988) The input/output complexity of sorting and related problems. Commun ACM 31(9):1116–1127

    Article  MathSciNet  Google Scholar 

  2. Arge L, Bender MA, Demaine ED, Holland-Minkley B, Munro JI (2002) Cache-oblivious priority queue and graph algorithm applications. In: Proceedings of the 34th annual ACM symposium on theory of computing. ACM, New York, pp 268–276

    Google Scholar 

  3. Brodal GS, Fagerberg R (2002) Cache oblivious distribution sweeping. In: Proceedings of the 29th international colloquium on automata, languages, and programming. Lecture notes in computer science, vol 2380, pp 426–438. Springer, Berlin

    Google Scholar 

  4. Brodal GS, Fagerberg R (2003) On the limits of cache-obliviousness. In: Proceedings of the 35th annual ACM symposium on theory of computing. ACM, New York, pp 307–315

    Google Scholar 

  5. Brodal GS, Fagerberg R, Vinther K (2007) Engineering a cache-oblivious sorting algorithm. ACM J Exp Algoritmics (Special Issue of ALENEX 2004) 12(2.2):23

    Google Scholar 

  6. Department of Computer Science, Duke University. TPIE: a transparent parallel I/O environment. http://www.cs.duke.edu/TPIE/. Accessed 2002

  7. Franceschini G (2004) Proximity mergesort: optimal in-place sorting in the cache-oblivious model. In: Proceedings of the 15th annual ACM-SIAM symposium on discrete algorithms (SODA). SIAM, Philadelphia, p 291

    Google Scholar 

  8. Frigo M, Leiserson CE, Prokop H, Ramachandran S (1999) Cache-oblivious algorithms. In: Proceedings of the 40th annual symposium on foundations of computer science. IEEE Computer Society Press, Los Alamitos, pp 285–297

    Google Scholar 

  9. Hoare CAR (1962) Quicksort. Comput J 5(1):10–15

    Article  MathSciNet  MATH  Google Scholar 

  10. Williams JWJ (1964) Algorithm 232: Heapsort. Commun ACM 7(6):347–348

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Aarhus, Århus, Denmark

    Gerth Stølting

Authors
  1. Gerth Stølting
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gerth Stølting .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Stølting, G. (2016). Cache-Oblivious Sorting. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_63

Download citation

Publish with us

Policies and ethics

Search

Navigation