Dynamic Partitioning

Dynamic Partitioning is a data partitioning method that dynamically adjusts the division of data during runtime based on workload characteristics, system conditions, or access patterns, distinguishing it from static partitioning approaches by enabling adaptive and fine-grained resource allocation in response to evolving computational demands.

264

Publications

14.7K

Citations

867

Authors

353

Institutions

Publications per year

2017–2026

51

Authors

867

  1. SD
    Srinivas Devadas

    Massachusetts Institute of Technology, United States

    5 publications · 610 citations

    5

    h-index

  2. FV
    Frank Vahid

    University of California, Riverside, United States

    4 publications · 284 citations

    4

    h-index

  3. RL
    Roman Lysecky

    University of Arizona, United States

    4 publications · 284 citations

    4

    h-index

  4. LC
    L. Codrescu

    Georgia Institute of Technology, United States

    4 publications · 126 citations

    4

    h-index

  5. YL
    Yunjie Li

    Northeastern University, China

    4 publications · 143 citations

    4

    h-index

1–5 of 867

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 8 publications · 580 citations

    8

    h-index

  2. IEEE Transactions on Computers

    5 publications · 181 citations

    5

    h-index

  3. Materials Science and Engineering A

    4 publications · 181 citations

    4

    h-index

  4. 3

    h-index

  5. ACM SIGPLAN Notices

    3 publications · 85 citations

    3

    h-index

1–5