Topic
Internal sort
About: Internal sort is a research topic. Over the lifetime, 121 publications have been published within this topic receiving 20361 citations.
Papers published on a yearly basis
Papers
More filters
Book•
15 Jan 2000
TL;DR: Sorting and associated concepts insertion sort shellsort bubble sort bubble sort selection sort sorting by counting quick sort sample sort heap sort merge sort bucket sorts sorting non-random data epilogue answers to exercises a notation and standard results from probability theory.
Abstract: Sorting and associated concepts insertion sort shell sort bubble sort selection sort sorting by counting quick sort sample sort heap sort merge sort bucket sorts sorting non-random data epilogue answers to exercises a notation and standard results from probability theory.
120 citations
TL;DR: Tests on randomly generated lists of various combinations of list length and small sortedness ratios indicate that Straight Insertion Sort is best for small or very nearly sorted lists and that Quickersort is best otherwise.
Abstract: Straight Insertion Sort, Shellsort, Straight Merge Sort, Quickersort, and Heapsort are compared on nearly sorted lists. The ratio of the minimum number of list elements which must be removed so that the remaining portion of the list is in order to the size of the list is the authors' measure of sortedness. Tests on randomly generated lists of various combinations of list length and small sortedness ratios indicate that Straight Insertion Sort is best for small or very nearly sorted lists and that Quickersort is best otherwise. Cook and Kim also show that a combination of the Straight Insertion Sort and Quickersort with merging yields a sorting method that performs as well as or better than either Straight Insertion Sort or Quickersort on nearly sorted lists.
109 citations
13 May 2012
TL;DR: This work designs a high-performance parallel merge sort for highly parallel systems, and develops a scheme for sorting variable-length key/value pairs, with a special emphasis on string keys.
Abstract: We design a high-performance parallel merge sort for highly parallel systems. Our merge sort is designed to use more register communication (not shared memory), and does not suffer from over-segmentation as opposed to previous comparison based sorts. Using these techniques we are able to achieve a sorting rate of 250 MKeys/sec, which is about 2.5 times faster than Thrust merge sort performance, and 70% faster than non-stable state-of-the-art GPU merge sorts. Building on this sorting algorithm, we develop a scheme for sorting variable-length key/value pairs, with a special emphasis on string keys. Sorting non-uniform, unaligned data such as strings is a fundamental step in a variety of algorithms, yet it has received comparatively little attention. To our knowledge, our system is the first published description of an efficient string sort for GPUs. We are able to sort strings at a rate of 70 MStrings/s on an NVidia GTX 580 on one dataset, and up to 1.25 GB/s on another dataset.
68 citations
Proceedings Article•
13 Sep 1978
TL;DR: A new sorting scheme, called the rebound sort, implementable on a variety of technologies, e.g., magnetic bubbles and charge-coupled devices is described, which accepts as input a sequence of records, sorts them, and outputs the sorted records automatically.
Abstract: Sorting plays an increasingly important role in determining the overall performance of data base systems. Described is a new sorting scheme, called the rebound sort, implementable on a variety of technologies, e.g., magnetic bubbles and charge-coupled devices. The sort engine based on this new sorting scheme accepts as input a sequence of records, sorts them, and outputs the sorted records automatically. The actual sorting time is completely overlapped with the input/output time.
68 citations