In the traditional $(K,L,M_T,M_U,N)$ partially connected linear network, a central server stores a library of N files and connects to $K+L-1$ transmitters, each equipped with a cache of size $M_T$. Each user is connected to L neighboring transmitters and is equipped with a local cache of size $M_U$. Motivated by practical scenarios in which users can access multiple cache nodes, this paper considers a $(K,L,r,M_T,M_C,N)$ multiaccess cache-assisted partially connected linear network, where each user can access r neighboring cache nodes under a cyclic wrap-around topology, and each cache node has a storage capacity of $M_C$. We propose a general construction framework based on placement delivery arrays (PDAs). The analysis shows that, when the Maddah-Ali and Niesen (MN) scheme is employed and r is sufficiently large, the achieved normalized delivery time (NDT) approaches that of existing schemes for the traditional partially connected linear network. Moreover, under the same aggregate cache size accessible to each user, numerical results demonstrate that, as the cache size ratio increases, the gap between the NDT achieved by the proposed scheme and that of the traditional partially connected linear network scheme gradually diminishes, while the proposed scheme requires a smaller subpacketization level.

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 $L_{\mathrm{comm}}=(K-r)/(K-1)$ when $2\le 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.