Measuring data locality in internal sorting algorithms

Seth Bergmann

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A method for measuring data locality in four common sorting algorithms is investigated. A modification of the heap data structure exhibiting improved locality is also introduced.

Original languageEnglish (US)
Title of host publicationACM Eighteenth Annual Computer Science Conference (CSC90)
PublisherPubl by ACM
Pages293-297
Number of pages5
ISBN (Print)0897913485, 9780897913485
DOIs
StatePublished - 1990
EventCooperation 1990 ACM 18th Annual Computer Science Conference Proceedings - Washington, DC, USA
Duration: Feb 20 1990Feb 22 1990

Publication series

NameACM Eighteenth Annual Computer Science Conference (CSC90)

Conference

ConferenceCooperation 1990 ACM 18th Annual Computer Science Conference Proceedings
CityWashington, DC, USA
Period2/20/902/22/90

All Science Journal Classification (ASJC) codes

  • General Engineering

Fingerprint

Dive into the research topics of 'Measuring data locality in internal sorting algorithms'. Together they form a unique fingerprint.

Cite this