Map–Shuffle–Reduce Arrays for Cascaded Coded Distributed Computing: Bounds and Constructions

Cascaded coded distributed computing (CDC) reduces Shuffle communication through redundant Map computations and replicated output assignments. We propose Map–Shuffle–Reduce arrays (MSRAs), a unified framework for describing file placement, output assignment, transmitter selection, and one-shot XOR delivery. For fixed placement, assignment, and equal-length packetization, minimizing communication load is equivalent to minimizing the number of distinct array labels. We establish communication lower bounds for two settings: coded transmissions involving different file–output pairs, and the case where every output function is assigned to all nodes. We develop two cyclic MSRA constructions that attain the corresponding bounds under their respective conditions. In particular, the packetized construction achieves a communication load of Lcomm=(K−r)/(K−1) when 2≤r<K and K−r divides K−1, using only N=K files and Q=1 output function. For partial output assignment, we introduce a group–helper construction that delivers complete intermediate values without splitting them into smaller packets. Under regular file storage and direct one-shot decoding using locally computed intermediate values, this construction attains a receiver-gain lower bound for its parameter family. Finally, we demonstrate how existing CDC schemes can be represented within the MSRA framework and compare their communication and implementation tradeoffs.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2026-11-12
DOI
https://doi.org/10.3390/e28111247
Primary Topic
Advanced Data Storage Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Map–Shuffle–Reduce Arrays for Cascaded Coded Distributed Computing: Bounds and Constructions

Minquan Cheng, Guolin Wu, Yifei Huang, Mingming Zhang et al.
Entropy
Advanced Data Storage Technologies
article

Map–Shuffle–Reduce Arrays for Cascaded Coded Distributed Computing: Bounds and Constructions

Minquan Cheng, Guolin Wu, Yifei Huang, Mingming Zhang, Jiaqi Fang
article en

Abstract

Cascaded coded distributed computing (CDC) reduces Shuffle communication through redundant Map computations and replicated output assignments. We propose Map–Shuffle–Reduce arrays (MSRAs), a unified framework for describing file placement, output assignment, transmitter selection, and one-shot XOR delivery. For fixed placement, assignment, and equal-length packetization, minimizing communication load is equivalent to minimizing the number of distinct array labels. We establish communication lower bounds for two settings: coded transmissions involving different file–output pairs, and the case where every output function is assigned to all nodes. We develop two cyclic MSRA constructions that attain the corresponding bounds under their respective conditions. In particular, the packetized construction achieves a communication load of Lcomm=(K−r)/(K−1) when 2≤r<K and K−r divides K−1, using only N=K files and Q=1 output function. For partial output assignment, we introduce a group–helper construction that delivers complete intermediate values without splitting them into smaller packets. Under regular file storage and direct one-shot decoding using locally computed intermediate values, this construction attains a receiver-gain lower bound for its parameter family. Finally, we demonstrate how existing CDC schemes can be represented within the MSRA framework and compare their communication and implementation tradeoffs.

EntropyVol. 28(11)
Guangxi Normal University (CN), Guilin University of Aerospace Technology (CN)
Advanced Data Storage Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon