Data Shuffling
Data Shuffling is a distributed data processing operation that redistributes intermediate data across computing nodes according to key-based partitioning to enable parallel aggregation and transformation in batch processing systems.
268
Publications
15.1K
Citations
785
Authors
349
Institutions
Publications per year
2017–2026
96
Variants
Data Shuffle
268
Parallel Processing with the Perfect Shuffle
Harold S. Stone · IEEE Transactions on Computers · 1971 · 1.3K citations
Speeding Up Distributed Machine Learning Using Codes
Kangwook Lee, Maximilian Lam, Ramtin Pedarsani et al. · IEEE Transactions on Information Theory · 2017 · 866 citations · Full text
1–5 of 268
785
University of Southern California, United States
6 publications · 481 citations
6
h-index
6
h-index
5
h-index
4
h-index
3
h-index
1–5 of 785
349
University of Southern California
Los Angeles, United States
10 h-index
23 publications
1.5K citations
Stanford University
Stanford, United States
9 h-index
20 publications
1.9K citations
University of California, Berkeley
Berkeley, United States
6 h-index
12 publications
2.6K citations
University of California, Los Angeles
Los Angeles, United States
6 h-index
10 publications
536 citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
8 publications
1.5K citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
11 publications
254 citations

Shanghai Jiao Tong University
Shanghai, China
5 h-index
10 publications
246 citations
Auburn University
Auburn, United States
4 h-index
14 publications
634 citations
1–8 of 349
Repository · 8 publications · 176 citations
8
h-index
6 publications · 2.6K citations
6
h-index
4 publications · 514 citations
4
h-index
TPDS · 4 publications · 121 citations
4
h-index
3 publications · 905 citations
3
h-index
1–5