Distributed Data Partitioning
Distributed Data Partitioning is a method in distributed memory programming that divides a large dataset into disjoint subsets allocated across multiple processing nodes, distinguished by its design to minimize inter-node communication while ensuring computational load balance and data locality.
163
Publications
5.4K
Citations
504
Authors
208
Institutions
Publications per year
2017–2026
49
163
Nissim Francez · ACM Transactions on Programming Languages and Systems · 1980 · 240 citations
Steve Zdancewic, Lantian Zheng, Nathaniel Nystrom et al. · ACM Transactions on Computer Systems · 2002 · 172 citations
Balanced label propagation for partitioning massive graphs
Johan Ugander, Lars Bäckström · 2013 · 169 citations
1–5 of 163
504
5
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 504
208

Cornell University
Ithaca, United States
5 h-index
14 publications
1.3K citations
Google (United States)
Mountain View, United States
5 h-index
11 publications
350 citations
Georgia Institute of Technology
Atlanta, United States
4 h-index
9 publications
303 citations
Tsinghua University
Beijing, China
4 h-index
9 publications
143 citations

Shanghai Jiao Tong University
Shanghai, China
4 h-index
15 publications
246 citations
Microsoft (United States)
Redmond, United States
4 h-index
7 publications
481 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
5 publications
97 citations

University of Waterloo
Waterloo, Canada
3 h-index
7 publications
182 citations
1–8 of 208
PVLDB · 10 publications · 371 citations
10
h-index
Repository · 6 publications · 194 citations
7
h-index
TKDE · 5 publications · 176 citations
5
h-index
3 publications · 61 citations
3
h-index
2 publications · 31 citations
2
h-index
1–5