Static Partitioning
Static Partitioning is a data partitioning strategy that belongs to the class of partitioning methods in which the division of data into subsets is predetermined and remains fixed throughout the execution or application, without dynamic adjustments based on runtime conditions or data changes.
84
Publications
3.4K
Citations
247
Authors
101
Institutions
Publications per year
2017–2026
12
84
Additive Pattern Database Heuristics
Ariel Felner, Richard E. Korf, S. Hanan · Journal of Artificial Intelligence Research · 2004 · 205 citations · Full text
Parallel symbolic execution for structural test generation
Matt Staats, Corina S. Păsăreanu · 2010 · 151 citations · Full text
Demand-driven service differentiation in cluster-based network servers
Huican Zhu, Hong Tang, Tao Yang · 2002 · 114 citations
Locality aware dynamic load management for massively multiplayer games
Jin Chen, WU Bao-hua, Margaret DeLap et al. · 2005 · 114 citations · Full text
1–5 of 84
247
5
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 247
101

University of Minnesota
Minneapolis, United States
5 h-index
12 publications
436 citations
Argonne National Laboratory
Lemont, United States
4 h-index
8 publications
119 citations

University of North Texas
Denton, United States
3 h-index
6 publications
296 citations
Duke University
Durham, United States
3 h-index
10 publications
187 citations
University of Michigan
Ann Arbor, United States
3 h-index
5 publications
182 citations

University of Toronto
Toronto, Canada
2 h-index
3 publications
252 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
2 h-index
7 publications
372 citations
Stanford University
Stanford, United States
2 h-index
5 publications
106 citations
1–8 of 101
PVLDB · 3 publications · 126 citations
3
h-index
TECS · 1 publications · 32 citations
1
h-index
Repository · 1 publications · 12 citations
1
h-index
1 publications · 50 citations
1
h-index
Conference · 1 publications · 10 citations
1
h-index
1–5