Cache efficient radix sort for string sorting

Waihong Ng, Katsuhiko Kakehi

    研究成果: Article

    5 引用 (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.

    元の言語English
    ページ(範囲)457-466
    ページ数10
    ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    E90-A
    発行部数2
    DOI
    出版物ステータスPublished - 2007 2

    ASJC Scopus subject areas

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

    フィンガープリント Cache efficient radix sort for string sorting' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用