Cache efficient radix sort for string sorting

Waihong Ng*, Katsuhiko Kakehi

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    5 Citations (Scopus)


    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 languageEnglish
    Pages (from-to)457-466
    Number of pages10
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    Issue number2
    Publication statusPublished - 2007 Feb


    • Cache
    • High performance
    • Radix sort
    • Sorting
    • String sorting

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Hardware and Architecture
    • Information Systems


    Dive into the research topics of 'Cache efficient radix sort for string sorting'. Together they form a unique fingerprint.

    Cite this