% Generated by IEEEtran.bst, version: 1.14 (2015/08/26)
\begin{thebibliography}{10}
\providecommand{\url}[1]{#1}
\csname url@samestyle\endcsname
\providecommand{\newblock}{\relax}
\providecommand{\bibinfo}[2]{#2}
\providecommand{\BIBentrySTDinterwordspacing}{\spaceskip=0pt\relax}
\providecommand{\BIBentryALTinterwordstretchfactor}{4}
\providecommand{\BIBentryALTinterwordspacing}{\spaceskip=\fontdimen2\font plus
\BIBentryALTinterwordstretchfactor\fontdimen3\font minus
\fontdimen4\font\relax}
\providecommand{\BIBforeignlanguage}[2]{{%
\expandafter\ifx\csname l@#1\endcsname\relax
\typeout{** WARNING: IEEEtran.bst: No hyphenation pattern has been}%
\typeout{** loaded for the language `#1'. Using the pattern for}%
\typeout{** the default language instead.}%
\else
\language=\csname l@#1\endcsname
\fi
#2}}
\providecommand{\BIBdecl}{\relax}
\BIBdecl
\bibitem{10.1093/comjnl/5.1.10}
C.~A.~R. Hoare, ``Quicksort,'' \emph{The Computer Journal}, vol.~5, no.~1, pp.
10--16, Jan. 1962.
\bibitem{frigoCacheobliviousAlgorithms1999b}
M.~Frigo, C.~Leiserson, H.~Prokop, and S.~Ramachandran, ``Cache-oblivious
algorithms,'' in \emph{40th {{Annual Symposium}} on {{Foundations}} of
{{Computer Science}} ({{Cat}}. {{No}}.{{99CB37039}})}.\hskip 1em plus 0.5em
minus 0.4em\relax New York City, NY, USA: IEEE Comput. Soc, 1999, pp.
285--297.
\bibitem{wulfHittingMemoryWall1995}
{\relax Wm}.~A. Wulf and S.~A. McKee, ``Hitting the memory wall: Implications
of the obvious,'' \emph{ACM SIGARCH Computer Architecture News}, vol.~23,
no.~1, pp. 20--24, Mar. 1995.
\bibitem{cormenIntroductionAlgorithms2022}
T.~H. Cormen, C.~E. Leiserson, R.~L. Rivest, and C.~Stein, \emph{Introduction
to Algorithms}, fourth edition~ed.\hskip 1em plus 0.5em minus 0.4em\relax
Cambridge, Massachusett: The MIT Press, 2022.
\bibitem{kaligosiHowBranchMispredictions2006}
K.~Kaligosi and P.~Sanders, ``How {{Branch Mispredictions Affect Quicksort}},''
in \emph{Algorithms -- {{ESA}} 2006}, D.~Hutchison, T.~Kanade, J.~Kittler,
J.~M. Kleinberg, F.~Mattern, J.~C. Mitchell, M.~Naor, O.~Nierstrasz,
C.~Pandu~Rangan, B.~Steffen, M.~Sudan, D.~Terzopoulos, D.~Tygar, M.~Y. Vardi,
G.~Weikum, Y.~Azar, and T.~Erlebach, Eds.\hskip 1em plus 0.5em minus
0.4em\relax Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, vol. 4168,
pp. 780--791.
\bibitem{axtmannInPlaceParallelSuper2017}
M.~Axtmann, S.~Witt, D.~Ferizovic, and P.~Sanders, ``In-{{Place Parallel Super
Scalar Samplesort}} ({{IPSSSSo}}),'' \emph{LIPIcs, Volume 87, ESA 2017},
vol.~87, pp. 9:1--9:14, 2017.
\bibitem{blellochPrefixSumsTheir2018}
G.~E. Blelloch, ``Prefix sums and their applications,'' p. 1294199 Bytes, Jun.
2018.
\bibitem{blumofeSchedulingMultithreadedComputations1999}
R.~D. Blumofe and C.~E. Leiserson, ``Scheduling multithreaded computations by
work stealing,'' \emph{Journal of the ACM}, vol.~46, no.~5, pp. 720--748,
Sep. 1999.
\bibitem{devroyeNonUniformRandomVariate1986}
L.~Devroye, \emph{Non-{{Uniform Random Variate Generation}}}.\hskip 1em plus
0.5em minus 0.4em\relax New York, NY: Springer New York, 1986.
\bibitem{graefeImplementingSortingDatabase2006}
G.~Graefe, ``Implementing sorting in database systems,'' \emph{ACM Computing
Surveys}, vol.~38, no.~3, p.~10, Sep. 2006.
\bibitem{nybergAlphasortCachesensitiveParallel1995}
C.~Nyberg, T.~Barclay, Z.~Cvetanovic, J.~Gray, and D.~Lomet, ``Alphasort: {{A}}
cache-sensitive parallel external sort,'' \emph{The VLDB Journal}, vol.~4,
no.~4, pp. 603--627, Oct. 1995.
\bibitem{zahariaDiscretizedStreamsFaulttolerant2013}
M.~Zaharia, T.~Das, H.~Li, T.~Hunter, S.~Shenker, and I.~Stoica, ``Discretized
streams: Fault-tolerant streaming computation at scale,'' in
\emph{Proceedings of the {{Twenty-Fourth ACM Symposium}} on {{Operating
Systems Principles}}}.\hskip 1em plus 0.5em minus 0.4em\relax Farminton
Pennsylvania: ACM, Nov. 2013, pp. 423--438.
\bibitem{oneilLogstructuredMergetreeLSMtree1996}
P.~O'Neil, E.~Cheng, D.~Gawlick, and E.~O'Neil, ``The log-structured merge-tree
({{LSM-tree}}),'' \emph{Acta Informatica}, vol.~33, no.~4, pp. 351--385, Jun.
1996.
\bibitem{kraska2018case}
T.~Kraska, A.~Beutel, E.~H. Chi, J.~Dean, and N.~Polyzotis, ``The case for
learned index structures,'' in \emph{Proceedings of the 2018 International
Conference on Management of Data}, 2018, pp. 489--504.
\bibitem{khalifa2020learnedsort}
A.~Khalifa \emph{et~al.}, ``Learnedsort: A non-comparison-based sorting
algorithm using neural networks,'' \emph{arXiv preprint arXiv:2003.12883},
2020.
\end{thebibliography}