@online{wassenberg,
  author       = {Wassenberg, Jan and Sanders, Peter},
  title        = {Faster Radix Sort via Virtual Memory and Write-Combining},
  date         = {2010-08-17},
  version      = 1,
  langid       = {english},
  langidopts   = {variant=american},
  eprinttype   = {arxiv},
  eprintclass  = {cs.DS},
  eprint       = {1008.2849v1},
  annotation   = {A recent \texttt{online} reference from arXiv using the new
                  (April 2007 onward) identifier format. Note the
                  \texttt{eprint}, \texttt{eprinttype}, and \texttt{eprintclass}
                  fields. Also note that the arXiv reference is transformed into
                  a clickable link if \texttt{hyperref} support has been
                  enabled},
  abstract     = {Sorting algorithms are the deciding factor for the performance
                  of common operations such as removal of duplicates or database
                  sort-merge joins. This work focuses on 32-bit integer keys,
                  optionally paired with a 32-bit value. We present a fast radix
                  sorting algorithm that builds upon a microarchitecture-aware
                  variant of counting sort},
}

{"_id":"fhEwkKzYjoyA2Y6Gg","bibbaseid":"wassenberg-sanders-fasterradixsortviavirtualmemoryandwritecombining","author_short":["Wassenberg, J.","Sanders, P."],"bibdata":{"bibtype":"online","type":"online","author":[{"propositions":[],"lastnames":["Wassenberg"],"firstnames":["Jan"],"suffixes":[]},{"propositions":[],"lastnames":["Sanders"],"firstnames":["Peter"],"suffixes":[]}],"title":"Faster Radix Sort via Virtual Memory and Write-Combining","date":"2010-08-17","version":"1","langid":"english","langidopts":"variant=american","eprinttype":"arxiv","eprintclass":"cs.DS","eprint":"1008.2849v1","annotation":"A recent \\textttonline reference from arXiv using the new (April 2007 onward) identifier format. Note the \\texttteprint, \\texttteprinttype, and \\texttteprintclass fields. Also note that the arXiv reference is transformed into a clickable link if \\texttthyperref support has been enabled","abstract":"Sorting algorithms are the deciding factor for the performance of common operations such as removal of duplicates or database sort-merge joins. This work focuses on 32-bit integer keys, optionally paired with a 32-bit value. We present a fast radix sorting algorithm that builds upon a microarchitecture-aware variant of counting sort","bibtex":"@online{wassenberg,\n author = {Wassenberg, Jan and Sanders, Peter},\n title = {Faster Radix Sort via Virtual Memory and Write-Combining},\n date = {2010-08-17},\n version = 1,\n langid = {english},\n langidopts = {variant=american},\n eprinttype = {arxiv},\n eprintclass = {cs.DS},\n eprint = {1008.2849v1},\n annotation = {A recent \\texttt{online} reference from arXiv using the new\n (April 2007 onward) identifier format. Note the\n \\texttt{eprint}, \\texttt{eprinttype}, and \\texttt{eprintclass}\n fields. Also note that the arXiv reference is transformed into\n a clickable link if \\texttt{hyperref} support has been\n enabled},\n abstract = {Sorting algorithms are the deciding factor for the performance\n of common operations such as removal of duplicates or database\n sort-merge joins. This work focuses on 32-bit integer keys,\n optionally paired with a 32-bit value. We present a fast radix\n sorting algorithm that builds upon a microarchitecture-aware\n variant of counting sort},\n}\n\n","author_short":["Wassenberg, J.","Sanders, P."],"key":"wassenberg","id":"wassenberg","bibbaseid":"wassenberg-sanders-fasterradixsortviavirtualmemoryandwritecombining","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"online","biburl":"https://bibbase.org/network/files/bsJQDcGvuu4QLMpME","dataSources":["8zL55m9buvrY6zRhu","cJ6LYRLJpSChhwSoy"],"keywords":[],"search_terms":["faster","radix","sort","via","virtual","memory","write","combining","wassenberg","sanders"],"title":"Faster Radix Sort via Virtual Memory and Write-Combining","year":null}