Load-balanced Sorting

Load-Balanced Sorting is a parallel sorting methodology that distributes data and computational work evenly across processing units to minimize idle time and maximize throughput, distinguished from other parallel sorting techniques by its explicit optimization of workload partitioning to achieve uniform processor utilization.

14

Publications

413

Citations

39

Authors

19

Institutions

Publications per year

2017–2026

2

Authors

39

  1. LP
    Luis Pastor

    Universidad Rey Juan Carlos, Spain

    1 publications · 18 citations

    1

    h-index

  2. WL
    Weiguo Liu

    Shandong University, China

    1 publications · 16 citations

    1

    h-index

  3. YK
    Yuetsu Kodama

    National Institute of Advanced Industrial Science and Technology, Japan

    1 publications · 47 citations

    1

    h-index

  4. JL
    João L. E. Campos

    Pontifícia Universidade Católica do Rio de Janeiro, Brazil

    1 publications · 36 citations

    1

    h-index

  5. MA
    Moustafa A. Hammad

    Purdue University West Lafayette, United States

    1 publications · 19 citations

    1

    h-index

1–5 of 39

Venues

  1. Very Large Data Bases

    Conference · 1 publications · 37 citations

    1

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 1 publications · 26 citations

    1

    h-index

  3. International Journal of Advanced Science and Technology

    IJAST · 1 publications · 17 citations

    1

    h-index

  4. Parallel algorithms and applications

    1 publications · 10 citations

    1

    h-index

  5. Computer Physics Communications

    1 publications · 17 citations

    1

    h-index

1–5