Warp Scheduling

Warp Scheduling is a thread-level instruction scheduling mechanism in GPU architectures that organizes and manages the execution of groups of threads, called warps, by dispatching them to streaming multiprocessors in a manner that maximizes resource utilization and hides memory latency.

64

Publications

3.7K

Citations

185

Authors

78

Institutions

Publications per year

2017–2026

15

Authors

185

  1. MA
    Murali Annavaram

    University of Southern California, United States

    8 publications · 319 citations

    8

    h-index

  2. TM
    Tor M. Aamodt

    University of British Columbia, Canada

    5 publications · 1K citations

    5

    h-index

  3. OM
    Onur Mutlu

    Carnegie Mellon University, United States

    5 publications · 711 citations

    5

    h-index

  4. MK
    Myung Kuk Yoon

    Yonsei University, South Korea

    4 publications · 108 citations

    4

    h-index

  5. WW
    Won Woo Ro

    Yonsei University, South Korea

    4 publications · 108 citations

    4

    h-index

1–5 of 185

Venues

  1. ACM SIGARCH Computer Architecture News

    3 publications · 103 citations

    3

    h-index

  2. IEEE Transactions on Computers

    2 publications · 35 citations

    2

    h-index

  3. Future Generation Computer Systems

    FGCS · 1 publications · 17 citations

    2

    h-index

  4. afips

    1 publications · 18 citations

    1

    h-index

  5. Parallel Computing

    1 publications · 20 citations

    1

    h-index

1–5