标题： 通过组合多接入模型的通信高效分布式计算 显示英文标题

标题： Communication-Efficient Distributed Computing Through Combinatorial Multi-Access Models

摘要： 本文探讨了多接入分布式计算（MADC）模型，这是一种新型的分布式计算框架，其中映射器和归收器节点是不同的实体。 与传统的MapReduce框架不同，MADC利用编码理论技术来最小化通信开销，而无需在映射器节点之间进行文件复制。 我们引入了一种新方法，利用组合设计，特别是t设计，来构建高效的编码方案，实现计算负载为1。 通过建立t设计与MapReduce数组之间的联系，我们描述了可实现的通信负载，并展示了我们的方法在选择归收器节点数量方面的灵活性。 所提出的方案相对于现有的组合拓扑方案显著减少了归收器节点的数量，但以增加通信成本为代价。 显示英文摘要

摘要： This paper explores the multi-access distributed computing (MADC) model, a novel distributed computing framework where mapper and reducer nodes are distinct entities. Unlike traditional MapReduce frameworks, MADC leverages coding-theoretic techniques to minimize communication overhead without necessitating file replication across mapper nodes. We introduce a new approach utilizing combinatorial designs, specifically t-designs, to construct efficient coding schemes that achieve a computation load of 1. By establishing a connection between t-designs and MapReduce Arrays, we characterize the achievable communication loads and demonstrate the flexibility of our method in selecting the number of reducer nodes. The proposed scheme significantly reduces the number of reducer nodes relative to existing combinatorial topology schemes, at the expense of increased communication cost.