Synchronization-free Sorting

Synchronization-Free Sorting is a parallel sorting algorithm that belongs to the class of distributed-memory sorting methods, distinguished by its explicit avoidance of inter-process synchronization barriers, thereby enabling asynchronous execution through the use of non-blocking communication and local progress guarantees.

4

Publications

139

Citations

11

Authors

5

Institutions

Publications per year

2017–2026

0

Authors

11

  1. OG
    Oded Green

    Georgia Institute of Technology, United States

    2 publications · 60 citations

    2

    h-index

  2. SO
    Saher Odeh

    Technion – Israel Institute of Technology, Israel

    2 publications · 60 citations

    2

    h-index

  3. YB
    Yitzhak Birk

    Technion – Israel Institute of Technology, Israel

    2 publications · 60 citations

    2

    h-index

  4. TD
    Tushar D. Rane

    Johns Hopkins University, United States

    1 publications · 60 citations

    1

    h-index

  5. ZM
    Zahi Mwassi

    Georgia Institute of Technology, United States

    1 publications · 50 citations

    1

    h-index

1–5 of 11

Venues

  1. Lab on a Chip

    1 publications · 60 citations

    1

    h-index

  2. arXiv (Cornell University)

    Repository · 1 publications · 10 citations

    1

    h-index

  3. The Journal of Supercomputing

    1 publications · 19 citations

    1

    h-index

1–3