Fast sort of floating-point data for data engineering

Changsoo Kim, Sungroh Yoon, Dongseung Kim

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


In this paper, a novel external sort algorithm that improves the speedup of the sorting of floating-point numbers has been described. Our algorithm decreases the computation time significantly by applying integer arithmetic on floating-point data in the IEEE-754 standard or similar formats. We conducted experiments with synthetic data on a 32-processor Linux cluster; in the case of the internal sort alone, the Giga-byte sorting achieved approximately fivefold speedups. Furthermore, the sorting achieved twofold or greater improvements over the typical parallel sort method, network of workstations (NOW)-sort. Moreover, the sorting scheme performance is independent of the computing platform. Thus, our sorting method can be successfully applied to binary search, data mining, numerical simulations, and graphics.

Original languageEnglish
Pages (from-to)50-54
Number of pages5
JournalAdvances in Engineering Software
Issue number1-2
Publication statusPublished - 2011

Bibliographical note

Funding Information:
This research was supported by KOSEF Grant ( R01-2006-000-11167-0 ), and Korean University Grant.


  • Engineering simulation
  • External sort
  • Floating-point arithmetic
  • Message passing interface
  • Parallel sort
  • Workstation cluster

ASJC Scopus subject areas

  • Software
  • General Engineering


Dive into the research topics of 'Fast sort of floating-point data for data engineering'. Together they form a unique fingerprint.

Cite this