Cache efficient radix sort for string sorting

Waihong Ng, Katsuhiko Kakehi

    Research output: Contribution to journalArticle

    5 Citations (Scopus)

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

      Fingerprint

    Keywords

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

    ASJC Scopus subject areas

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

    Cite this