Related papers: Multi-access Distributed Computing Models from Map…

The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of…

Consider a distributed computing system in which the worker nodes are connected over a shared wireless channel. Nodes can store a fraction of the data set over which computation needs to be carried out, and a Map-Shuffle-Reduce protocol is…

In science and engineering, intelligent processing of complex signals such as images, sound or language is often performed by a parameterized hierarchy of nonlinear processing layers, sometimes biologically inspired. Hierarchical systems…

The modular composite representation (MCR) is a computing model that represents information with high-dimensional integer vectors using modular arithmetic. Originally proposed as a generalization of the binary spatter code model, it aims to…

From natural language processing to genome sequencing, large-scale machine learning models are bringing advances to a broad range of fields. Many of these models are too large to be trained on a single machine, and instead must be…

The ever-increasing demand for high-quality and heterogeneous wireless communication services has driven extensive research on dynamic optimization strategies in wireless networks. Among several possible approaches, multi-agent deep…

To enable massive machine type communication (mMTC), data aggregation is a promising approach to reduce the congestion caused by a massive number of machine type devices (MTDs). In this work, we consider a two-phase cellular-based mMTC…

Data aggregation is a promising approach to enable massive machine-type communication (mMTC). Here, we first characterize the aggregation phase where a massive number of machine-type devices transmits to their respective aggregator. By…

The paper is devoted to the problem of erasure coding in distributed storage. We consider a model of storage that assumes that nodes are organized into equally sized groups, called racks, that within each group the nodes can communicate…

The performance of grant-free random access (GF-RA) is limited by the number of accessible random access resources (RRs) due to the absence of collision resolution. Compressive sensing (CS)-based RA schemes scale up the RRs at the expense…

This work focuses on studying the half-duplex (HD) relaying in the Multiple Access Relay Channel (MARC) and the Compound Multiple Access Channel with a Relay (cMACr). A generalized Quantize-and-Forward (GQF) has been proposed to establish…

Recent works on representation learning for graph structured data predominantly focus on learning distributed representations of graph substructures such as nodes and subgraphs. However, many graph analytics tasks such as graph…

This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our…

We consider the distributed computing framework of MapReduce, which consists of three phases, the Map phase, the Shuffle phase and the Reduce phase. For this framework, we propose the use of binary matrices (with $0,1$ entries) called…

The problem of simultaneous multicasting of multiple messages with the help of a relay terminal is considered. In particular, a model is studied in which a relay station simultaneously assists two transmitters in multicasting their…

Performance of distributed graph processing systems significantly suffers from 'communication bottleneck' as a large number of messages are exchanged among servers at each step of the computation. Motivated by graph based MapReduce, we…

A radar and communication integration (RCI) system has great flexibility in allocating antenna resources to guarantee both radar and communication performance. This paper considers the array allocation problems for multiple target…

We propose a novel application of coded computing to the problem of the nearest neighbor estimation using MatDot Codes [Fahim. et.al. 2017], that are known to be optimal for matrix multiplication in terms of recovery threshold under storage…

In modern implementations of Cloud Radio Access Network (C-RAN), the fronthaul transport network will often be packet-based and it will have a multi-hop architecture built with general-purpose switches using network function virtualization…

As a promising 6G technology, integrated sensing and communication (ISAC) gains growing interest. ISAC provides integration gain via sharing spectrum, hardware, and software. However, concerns exist regarding its sensing performance when…