Sample Sort

Sample Sort is a parallel sorting algorithm that partitions data by selecting a sample of elements, sorting them to determine approximate splitters, and then distributing the remaining elements into buckets based on these splitters, thereby enabling efficient load balancing across processors.

23

Publications

1.6K

Citations

80

Authors

42

Institutions

Publications per year

2017–2026

2

Authors

80

  1. FT
    Felix T.S. Chan

    Hong Kong Polytechnic University, Hong Kong SAR China

    2 publications · 52 citations

    2

    h-index

  2. PS
    Peter Sanders

    Karlsruhe Institute of Technology, Germany

    2 publications · 151 citations

    2

    h-index

  3. VR
    Vijaya Ramachandran

    The University of Texas at Austin, United States

    2 publications · 38 citations

    2

    h-index

  4. SM
    Sydney M. Gordon

    Battelle, United States

    1 publications · 208 citations

    1

    h-index

  5. VO
    Vitaly Osipov

    Karlsruhe Institute of Technology, Germany

    1 publications · 106 citations

    1

    h-index

1–5 of 80

Venues

  1. International Journal of Production Research

    2 publications · 52 citations

    2

    h-index

  2. Computers & Geosciences

    CAGEO · 1 publications · 10 citations

    1

    h-index

  3. 1

    h-index

  4. ACM Transactions on Parallel Computing

    TOPC · 1 publications · 25 citations

    1

    h-index

  5. Food Quality and Preference

    1 publications · 25 citations

    1

    h-index

1–5