1.
Brodal G, Fagerberg R, Moruz G (2008) On the adaptiveness of quicksort. J Exp Algorithm (JEA) 12:Article 3.2
MathSciNet2.
Chen J, Juang P, Ko K, Contreras G, Penry D, Rangan R, Stoler A, Peh L, Martonosi M (2005) Hardware-modulated parallelism in chip multiprocessors. ACM SIGARCH Comput Archit News Arch 33(4):54–63
CrossRef3.
Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press and McGraw-Hill, Cambridge, New York. ISBN 0-262-03293-7. Section 8.4: Bucket Sort, pp 174–177
MATH4.
DeWitt D, Naughton J, Schneider D (1992) Parallel Sorting on Shared Nothing Architectures Using Probabilistic Splitting. In: Proceedings of the 1st Intel conference on parallel and distributed info systems, 1992, pp 280–291
5.
Graefe G (2006) Implementing sorting in database systems. ACM Comput Surv (CSUR) 38(3)
6.
Hammond L, Nayfeh B, Olukotun K (1997) A single-chip multiprocessor. IEEE Comput 30(9):79–85
7.
Intel
® (2009) VTune Performance Analyzer for Linux. URL:
http://www.intel.com/software/products/vtune/
8.
9.
10.
11.
Jiménez-González D, Navarro JJ, Larriba-Pey J (1999) Communication and cache conscious radix sort. In: Proceedings of the international conference on supercomputing, 1999, pp 76–83
12.
Jiménez-González D, Navarro JJ, Larriba-Pey J (2001) Fast Parallel in-memory 64-bit Sorting. In: Proceedings of the 15th ACM international conference on supercomputing (ICS), 2001, pp 114–122
13.
Jiménez-González D, Navarro JJ, Larriba-Pey J (2003) CC-Radix: a cache conscious sorting based on radix sort. In: Proceedings of the 11th Euromicro conference on parallel distributed and network-based processing (PDP), 2003, pp 101–108
14.
Knuth D (1997) The art of computer programming, vol 3: sorting and searching, 3rd edn. Addison-Wesley, Reading
MATH15.
LaMarca A, Ladner R (1997) The influence of caches on the performance of sorting. In: Proceeding of the ACM/SIAM symposium on discrete algorithms, 1997, pp 370–379
16.
Larriba-Pey JL, Jimenez D, Navarro J (1997) An analysis of superscalar Sorting Algorithms on an R8000 Processor. In: Proceedings of the 17th international conference of the Chilean Computer Science Society (SCCC), 1997, pp 125–134
17.
Lee S, Jeon M, Kim D, Sohn A (2002) Partition parallel radix sort. J Parallel Distrib Comput 656–668
18.
Marr DT, Binns F, Hill DL, Hinton G, Koufaty DA, Miller JA, Upton M (2002) Hyper-threading technology architecture and microarchitecture. Intel Technol J (Q1):4–15
19.
20.
Rahman N, Raman R (2000) Adapting radix sort to the memory hierarchy. In: Proceedings of the 2nd workshop on algorithm engineering and experiments (ALENEX), 2000, pp 131–146
21.
Rahman N, Raman R (2000) Analysing the cache behaviour of non-uniform distribution sorting algorithms. In: Proceedings of the European symposium on algorithms (ESA), 2000, pp 380–391
22.
Sedgewick R (1978) Implementing quicksort programs. Commun ACM 21:847–857
MATHCrossRef23.
Sohn A, Kodama Y (1998) Load balanced parallel radix sort. In: Proceeding of the international conference of supercomputing, 1998, pp 305–312
24.
Tsigas P, Zhang Yi (2002) Parallel quicksort seems to outperform sample sort on cache-coherent shared memory multiprocessors: an evaluation on SUN ENTERPRISE 10000. Technical Report 2002-03, Department of Computer Science, Chalmers University of Technology
25.
Tsigas P, Zhang Yi (2003) A Simple, Fast Parallel Implementation of Quicksort and its Performance Evaluation on Sun Enterprise 10000. In: Proceedings of the 11th EUROMICRO conference on parallel distributed and network-based processing (PDP), 2003, pp 372–381
26.
Tullsen D, Eggers S, Levy H (1995) Simultaneous multithreading: maximizing on-chip parallelism. In: Proceedings of the 22nd annual international symposium on computer architecture, (ISCA), 1995
27.
Xiao L, Zhang X, Kubricht SA (2000) Improving memory performance of sorting algorithms. ACM J Exp Algorithm 5(3):1–22