ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Multi-access Distributed Computing Models using Map-Reduce Arrays

Sasi, S and Günlü, O and Rajan, BS (2024) Multi-access Distributed Computing Models using Map-Reduce Arrays. In: International Symposium on Information Theory, ISIT 2024, 7 July 2024through 12 July 2024, Athens, pp. 1355-1360.

[img] PDF
IEEE_Int_Sym_Inf_The_Pro_2024.pdf - Published Version
Restricted to Registered users only

Download (369kB) | Request a copy
Official URL: https://doi.org/10.1109/ISIT57864.2024.10619355

Abstract

A novel distributed computing model called Multi-access Distributed Computing (MADC) was recently introduced in B. Federico and P. Elia, 'Multi-Access Distributed Computing,' June 2022, online] Available: http://www.arXiv:2206.12851]. The MADC models with Combinatorial Topology (CT) were studied, where there are � mapper nodes and K=(λα) reducer nodes with each reducer node connected to distinct α mapper nodes. In this paper, we represent MADC models via 2-layered bipartite graphs called Map-Reduce Graphs (MRGs), and a set of arrays called Map-Reduce Arrays (MRAs) inspired from the Placement Delivery Arrays (PDAs) used in the coded caching literature. The connection between MRAs and MRGs is established, thereby providing coded shuffling schemes for the MADC models using the structure of MRAs. Moreover, a set of g-regular MRAs is provided which corresponds to the existing scheme for MADC models with CT. One of the major limitations of the existing scheme for CT is that it requires an exponentially large number of reducer nodes for large �. This can be overcome by representing CT by MRAs, where coding schemes can be derived even if some of the reducer nodes are not present. © 2024 IEEE.

Item Type: Conference Paper
Publication: IEEE International Symposium on Information Theory - Proceedings
Publisher: Institute of Electrical and Electronics Engineers Inc.
Additional Information: The copyright for this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords: Bipartite graphs; Coding scheme; Combinatorial topology; Distributed computing models; Map-reduce; Multiaccess; Regular map, Distributed computer systems
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 25 Sep 2024 10:24
Last Modified: 25 Sep 2024 10:24
URI: http://eprints.iisc.ac.in/id/eprint/86290

Actions (login required)

View Item View Item