Abstract
In this paper, we propose CRadix sort, a new string sorting algorithm based on MSD radix sort. CRadix sort causes fewer cache misses than MSD radix sort by uniquely associating a small block of main memory called the key buffer to each key and temporarily storing a portion of each key into its corresponding key buffer. Experimental results in running time comparisons with other string sorting algorithms are provided for showing the effectiveness of CRadix sort.
Original language | English |
---|---|
Pages (from-to) | 457-466 |
Number of pages | 10 |
Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
Volume | E90-A |
Issue number | 2 |
DOIs | |
Publication status | Published - 2007 Feb |
Keywords
- Cache
- High performance
- Radix sort
- Sorting
- String sorting
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Hardware and Architecture
- Information Systems