Bandwidth-aware Scheduling

Bandwidth-Aware Scheduling is a memory hierarchy optimization technique that allocates and orders memory accesses according to available bandwidth resources to maximize data throughput and minimize latency in memory-intensive computing workloads.

112

Publications

4.4K

Citations

323

Authors

160

Institutions

Publications per year

2017–2026

22

Authors

323

  1. LZ
    Liudong Zuo

    California State University, Dominguez Hills, United States

    4 publications · 83 citations

    4

    h-index

  2. RP
    Rodolfo Pellizzoni

    University of Waterloo, Canada

    4 publications · 114 citations

    4

    h-index

  3. JF
    Jeanne Ferrante

    University of California San Diego, United States

    3 publications · 244 citations

    3

    h-index

  4. XG
    Xu Guan

    Huazhong University of Science and Technology, China

    3 publications · 129 citations

    3

    h-index

  5. BH
    Benxiong Huang

    Huazhong University of Science and Technology, China

    3 publications · 129 citations

    3

    h-index

1–5 of 323

Venues

  1. IEEE Transactions on Network and Service Management

    TNSM · 3 publications · 81 citations

    3

    h-index

  2. arXiv (Cornell University)

    Repository · 3 publications · 44 citations

    3

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 3 publications · 229 citations

    3

    h-index

  4. IEEE/ACM Transactions on Networking

    TON · 2 publications · 89 citations

    2

    h-index

  5. IEEE Transactions on Computers

    2 publications · 73 citations

    2

    h-index

1–5