Coded MapReduce Schemes Based on Placement Delivery Array

Ramkumar, V and Kumar, PV (2019) Coded MapReduce Schemes Based on Placement Delivery Array. In: 2019 IEEE International Symposium on Information Theory, ISIT 2019, 7 July 2019 - 12 July 2019, Paris, pp. 3087-3091.

PDF ISIT _2019.pdf - Published Version Restricted to Registered users only Download (11MB) | Request a copy

Abstract

The coded MapReduce framework introduced in 1 gives a method to tradeoff extra computation for reduced communication, in-order to speedup operations for which communication is the bottleneck. In 2, it has been demonstrated that reducing the number of subfiles required in coded MapReduce at the cost of a slightly higher communication load is beneficial for certain problems. The placement delivery array (PDA), introduced in 3, is a structure used to develop coded caching schemes with small sub-packetization. In the present paper, we use PDA to come up with a method to construct coded MapReduce schemes which require smaller number of subfiles. This method gives a way to tradeoff between the number of subfiles and the communication required. We also address the problem of mitigating the impact of slow servers at the map phase on the reduce operations of normal servers. © 2019 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:	Information theory, Caching scheme; Communication load; Distributed computations; Extra computations; Map-reduce; Mapreduce frameworks; Packetization; Placement Delivery Array, Computation theory
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	19 Dec 2022 06:56
Last Modified:	19 Dec 2022 06:56
URI:	https://eprints.iisc.ac.in/id/eprint/78498

Actions (login required)

View Item