R. C. Agarwal, A super scalar sort algorithm for RISC processors, SIGMOD Record (ACM Special Interest Group on Management of Data), vol.25, issue.2, pp.240-246, 1996.

S. Akl, Parallel Sorting Algorithms, 1985.

L. Arge, J. Chase, J. S. Vitter, and R. Wickremesinghe, Efficient sorting using registers and caches, Lecture Notes in Computer Science, pp.51-61, 1982.

S. Bentley, Fast algorithms for sorting and searching strings, SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1997.

C. Cérin and J. Gaudiot, Evaluation of two bsp libraries through parallel sorting on clusters, Proceedings of WCBC'00 (The Second International Workshop on Cluster-Based Computing) in conjuction with ICS'00 (International Conference on Supercomputing, sponsored by ACM/SIGARCH), pp.21-26, 2000.

C. Cérin and J. Gaudiot, An over-partitioning scheme for parallel sorting on clusters running at different speeds, Cluster 2000. IEEE International Conference on Cluster Computing, pp.28-30, 2000.

C. Cérin and J. Gaudiot, Parallel sorting algorithms with sampling techniques on clusters with processors running at different speeds, HiPC'2000. 7th International Conference on High Performance Computing, pp.17-20, 2000.

C. Cérin and J. Gaudiot, On a scheme for parallel sorting on heterogeneous clusters. FGCS (Future Generation Computer Systems 18 (issue 4), the special issue is preliminary scheduled for publication in future, 2002.

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran, Cacheoblivious algorithms, 40th Annual Symposium on Foundations of Computer Science: October 17-19, vol.300, pp.285-297, 1999.

J. L. Hennessy and D. Patterson, Computer Architecture, A Quantitative Approach, 2002.

D. E. Knuth, of The Art of Computer Programming, vol.3, 1998.

M. Koskas, A hierarchical database management algorithm, 2003.

A. Lamarca and R. E. Ladner, The influence of caches on the performance of sorting, Journal of Algorithms, vol.31, issue.1, pp.66-104, 1999.

J. Larriba-pey, D. Jimenez, and J. Navarro, An analysis of superscalar sorting algorithms on an r8000 processor, Proceedings of the 17th International Conference of the Chilean Computer Science Society (SCCC '97), 1997.

A. A. Nilsson and R. Raman, Sorting in linear time, Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC), pp.427-436, 1995.

S. Nilsson, The fastest sorting algorithm? Dr, Dobb's Journal of Software Tools, vol.25, issue.4, pp.44-45, 2000.

C. Nyberg, T. Barclay, Z. Cvetanovic, J. Gray, and D. B. Lomet, AlphaSort: A RISC machine sort, SIGMOD Record (ACM Special Interest Group on Management of Data), vol.23, issue.2, pp.233-242, 1994.

N. Rahman and R. Raman, Adapting radix sort to the memory hierarchy, 2000.

A. Ranade, S. Kothari, and R. Udupa, Register efficient mergesorting, HiPC'2000. 7th International Conference on High Performance Computing, pp.96-103, 2000.

S. Chatterjee and S. , Towards a theory of cache efficient algorithms, Proceedings of the Eleventh Annual ACM/SIAM Symposium on Discrete Algorithms (SODA'00), pp.829-838, 2000.

R. Sedgewick, The analysis of quicksort programs, Acta Informatica, vol.7, issue.25, pp.327-355, 1977.

B. Shriver and B. Smith, The anatomy of a High-Performance Microprocessor -A Systems Perspective, 1998.

A. Srivastava and A. Eustace, Atom: a system for building customized program analysis tools, Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation, pp.196-205, 1994.