Analysis of linear time sorting algorithms

Computer Journal

Volumn 51, Issue 4, 2008, Pages 451-469

  Shutler, Paul M E ^a   Sim, Seok Woon ^a   Lim, Wei Yin Selina ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Bucket sort; Cache latency; Flashsort1; Linear probing sort; Linear time sorting algorithms; Quicksort; Radix sort

Indexed keywords

BOOLEAN FUNCTIONS; FUNCTION EVALUATION; SEQUENTIAL SWITCHING;

BRITISH COMPUTER SOCIETY (BCS); BUCKET SORT; COMPUTATION (CPU) TIMES; CPU TIME; LINEAR ALGORITHMS; LINEAR PROBING; LINEAR TIME; LOAD FACTORS; MOST SIGNIFICANT DIGIT (MSD); OXFORD UNIVERSITY; QUICK SORT; RADIX SORTING; RANDOM ACCESS; SIMPLE MODELING; SIMPLEST LINEAR; SORTING ALGORITHMS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 46849095882     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm097     Document Type: Article

References (46)

1. Knuth, D.E. (1973) The Art of Computer Programming, Volume 3: Sorting and Searching (1 edn, Second Printing). Addison-Wesley, Reading, MA.
2. Weiss, M.A. (1992) Data Structures and Algorithm Analysis. Benjamin Cummings, Redwood City, CA.
3. Gonnet, G.H. and Baeza-Yates, R. (1991) Handbook of Algorithms and Data Structures, In Pascal and C, (2 edn). Addison-Wesley, Reading, MA.
4. Mahmoud, H.M. (2000) Sorting: A Distribution Theory. Wiley, New York.
5. Andersson, A. and Nilsson, S. (1998) Implementing Radixsort. J. Exp. Algorithmics 3, Art. No. 7.
6. El-Aker, F. and Al-Badarneh, A. (2004) MSL: An Efficient Adaptive In-Place Radix Sort Algorithm. In Bubak, M., van Albada, G.D., Sloot, P.M.A. and Dongarra, J.J. (eds), Computational Science - ICCS 2004, 4th International Conference Proceedings, Part II, Kraków, Poland, 6-9 June 2004. Lecture Notes in Computer Science, Vol. 3037/2004, (pp. 606-609). Springer-Verlag, Berlin.
7. Neubert, K.-D. (1998) The Flashsort1 Algorithm. Dr. Dobb's J., 23, Issue 2 (February 1998), 123-125. See also: http://www. neubert.net/Flapaper/9802n.htm.
8. Dobosiewicz, W. (1978) Sorting by distributive partitioning. Inf. Process. Lett., 7, 1-6.
9. Meijer, H. and Akl, S.G. (1980) The design and analysis of a new hybrid sorting algorithm. Inf. Process. Lett., 10, 213-218.
10. Melville, R. and Gries, D. (1980) Controlled density sorting. Inf. Process. Lett., 10, 169-172.
11. Gonnet, G.H. and Munro, J.I. (1984) The analysis of linear probing sort by the use of new mathematical transform. J. Algorithms, 5, 451-470.
12. Dobosiewicz, W. (1991) Linear probing sort. Comput. J., 34, 370-372.
13. Carlsson, S., Katajainen, J. and Teuhola, J. (1992) In-place Linear Probing. In Finkel, A. and Jantzen, M. (eds), STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, 13-15 February 1992. Lecture Notes in Computer Science, Vol. 577/ 1992 (pp. 581-587). Springer-Verlag, Berlin.
14. LaMarca, A. and Ladner, R.E. (1996) The influence of caches on the performance of heaps. J. Exp. Algorithmics, 1, Art. No. 4.
15. LaMarca, A. and Ladner, R.E. (1999) The influence of caches on the performance of sorting. J. Algorithms, 31, 66-104.
16. Rahman, N. and Raman, R. (1999) Analysing Cache Effects in Distribution Sorting. In Vitter, J.S. and Zaroliagis, C.D. (eds), Proceedings of the 3rd International Workshop on Algorithm Engineering, London, UK, 19-21 July 1999. Lecture Notes in Computer Science, Vol. 1668/1999 (pp. 183-197). Springer-Verlag, Berlin.
17. Rahman, N. and Raman, R. (2000) Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms. In Paterson, M. (ed), Proceedings of the 8th Annual European Symposium on Algorithms, Saarbrücken, Germany, 5-8 September 2000. Lecture Notes in Computer Science, Vol. 1879/2000 (pp. 380-391). Springer-Verlag, Berlin.
18. Rahman, N. and Raman, R. (2000) Analysing cache effects in distribution sorting. J. Exp. Algorithmics, 5, Art. No. 14.
19. Rahman, N. and Raman, R. (2001) Adapting radix sort to the memory hierarchy. J. Exp. Algorithmics, 6, Art. No. 7.
20. Poblete, PV., Viola, A. and Munro, J.I (1997) The diagonal poisson transform and its application to the analysis of a hashing scheme. Random Struct. Algorithms, 10, 221-255.
21. Knuth, D.E. (1998) Linear probing and graphs. Algorithmica, 22 561-568.
22. Flajolet, P., Poblete, P. and Viola, A. (1998) On the analysis of linear probing hashing. Algorithmica, 22, 490-515.
23. Janson, S. (2001) Asymptotic distribution for the cost of linear probing hashing. Random Struct. Algorithms, 19, 438-471.
24. Viola, A. (2005) Exact distribution of individual displacements in linear probing hashing. ACM Trans. Algorithms, 1, 214-242.
25. Janson, S. (2005) Individual displacements for linear probing hashing with different insertion policies. ACM Trans. Algorithms, 1, 177-213.
26. 8. Random Struct. Algorithms, 19, 150-162.
27. Bertoin, J. and Miermont, G. (2006) Asymptotics in Knuth's parking problem for caravans. Random Struct. Algorithms, 29, 38-55.
28. Bunday, B.D. (1996). An Introduction to Queueing Theory. Arnold, London.
29. d/1. ORSA J. Comput., 4, 300-310.
30. The GNU FORTRAN compiler http://www.gnu.org/software/fortran/ fortran.html.
31. Taillard, E. (1993) Benchmarks for basic scheduling problems. Eur. J. Oper. Res., 64, 278-285.
32. Brey, B.B. (2003) The Intel Microprocessors (6 edn). Prentice-Hall: New Jersey.
33. Mueller, S. (1998) Upgrading and Repairing PCs (10 edn.) Que Corporation, USA.
34. Moss, L. (1986) SLAC. http://www.fortran.com/quick_sort2.f.
35. Hoare, C.A.R. (1961) Algorithm 63: Partition, and Algorithm 64: quicksort. Commun. ACM, 4, 321.
36. Hoare, C.A.R. (1962) Quicksort. Comput. J., 5, 10-16.
37. Frazer, W.D. and McKellar, A.C. (1970) Samplesort: A sampling approach to minimal storage tree sorting. J ACM, 17, 496-507.
38. Sedgewick, R. (1978) Implementing quicksort programs. Commun. ACM, 21, 847-857.
39. Hennessy, J.L. and Patterson, D.A. (2007) Computer Architecture: A Quantitative Approach (4 edn). Elsevier, San Francisco, CA.
40. Besedin, D. (2005) Two Methods for Measuring Memory Latency on Intel Pentium 4 Platform in RightMark Memory Analyzer - How to Choose the Right One. http://www.digit-life.com/articles2/cpu/ rmma-p4-latency.html.
41. ASUSTeK Computer, Inc., ASUS TX97 Pentium Motherboard User's Manual Revision 1.23, Taipei, Taiwan, 1997.
42. Intel 430TX PCIset Desktop Design Guide 1997. http://www.intel.com/ design/chipsets/designex/297739.htm.
43. Kingston KVR66X64/66 MHz 168-Pin SDRAM DIMM Memory Module Specification. (2000). http://www.valueram.com/datasheets/KVR66X64_128.pdf.
44. Anthony LaMarca Selected Publications. (1999). http:// seattleweb.intel-research.net/people/lamarea/Publications.html.
45. Sun Microsystems Ultra 2 Workstation: Hardware Specifications. (2006). http://sunsolve.sun.com/handbook_pub/Systems/U2/spec.html.
46. Sanders, P. (1998) Random permutations on distributed, external and hierarchical memory. Inf. Process. Lett., 67 305-309.