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
264
Lin Jiang, Qingda Lu, Xiaoning Ding et al. · Proceedings - International Symposium on High-Performance Computer Architecture/Proceedings · 2008 · 346 citations
1–5 of 264
867
5
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 867
353
Georgia Institute of Technology
Atlanta, United States
8 h-index
14 publications
652 citations
Carnegie Mellon University
Pittsburgh, United States
8 h-index
17 publications
1.2K citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
16 publications
2.1K citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
12 publications
950 citations

The University of Texas at El Paso
El Paso, United States
5 h-index
5 publications
163 citations
Purdue University West Lafayette
West Lafayette, United States
5 h-index
8 publications
182 citations
Stanford University
Stanford, United States
5 h-index
13 publications
419 citations
University of California, Riverside
Riverside, United States
4 h-index
10 publications
758 citations
1–8 of 353
TPDS · 8 publications · 580 citations
8
h-index
5 publications · 181 citations
5
h-index
4 publications · 181 citations
4
h-index
3 publications · 96 citations
3
h-index
3 publications · 85 citations
3
h-index
1–5