Sorting On Shared-memory Multiprocessors

Sorting On Shared-Memory Multiprocessors is a parallel sorting paradigm that organizes the arrangement of data elements through concurrent processes executing on multiple processors sharing a common memory space, distinguished by its reliance on fine-grained synchronization and load balancing to exploit memory coherence and reduce communication overhead in comparison to distributed-memory approaches.

28

Publications

1.9K

Citations

55

Authors

31

Institutions

Publications per year

2017–2026

0

Authors

55

  1. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    2 publications · 179 citations

    2

    h-index

  2. CN
    Chris Nyberg

    Digital Wave (United States), United States

    2 publications · 145 citations

    2

    h-index

  3. JG
    Jim Gray

    Microsoft (United States), United States

    2 publications · 145 citations

    2

    h-index

  4. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    2 publications · 48 citations

    2

    h-index

  5. HI
    Hiroshi Inoue

    IBM Research - Tokyo, Japan

    2 publications · 162 citations

    2

    h-index

1–5 of 55

Venues

  1. IEEE Transactions on Computers

    2 publications · 212 citations

    2

    h-index

  2. SIAM Journal on Computing

    2 publications · 149 citations

    2

    h-index

  3. Software Practice and Experience

    1 publications · 19 citations

    1

    h-index

  4. ACM SIGMOD Record

    1 publications · 15 citations

    1

    h-index

  5. UC Berkeley

    Repository · 1 publications · 322 citations

    1

    h-index

1–5