Concepedia

Communication-avoiding Sorting

Communication-Avoiding Sorting is a parallel sorting algorithm designed to minimize data movement and interprocessor communication by optimizing memory access patterns and computational locality, thereby distinguishing itself from traditional parallel sorting methods that do not explicitly reduce communication costs.

4

Publications

130

Citations

9

Authors

6

Institutions

Publications per year

2017–2026

0

Parents

Publications

4

1–4 of 4

Authors

9

  1. MT
    Michael T. Goodrich

    Johns Hopkins University, United States

    1 publications · 40 citations

    1

    h-index

  2. AS
    Andrew Sohn

    New Jersey Institute of Technology, United States

    1 publications · 20 citations

    1

    h-index

  3. YK
    Yong Kim

    Sungkyunkwan University, South Korea

    1 publications · 20 citations

    1

    h-index

  4. MI
    Mihai Ionescu

    Universitat Rovira i Virgili, Spain

    1 publications · 54 citations

    1

    h-index

  5. MJ
    Minsoo Jeon

    Korea University, South Korea

    1 publications · 20 citations

    1

    h-index

1–5 of 9

Institutions

6

  1. New Jersey Institute of Technology

    Newark, United States

    1 h-index

    1 publications

    20 citations

  2. Princeton University

    Princeton, United States

    1 h-index

    1 publications

    16 citations

  3. University of California, Santa Barbara

    Santa Barbara, United States

    1 h-index

    2 publications

    108 citations

  4. University of California, Davis

    Davis, United States

    1 h-index

    1 publications

    16 citations

  5. Korea University

    Seoul, South Korea

    1 h-index

    3 publications

    60 citations

  6. Johns Hopkins University

    Baltimore, United States

    1 h-index

    1 publications

    40 citations

1–6 of 6

Venues

  1. Journal of Parallel and Distributed Computing

    1 publications · 16 citations

    1

    h-index

1–1