Duffy, Ken R. and Shneer, Seva (2021) MDS coding is better than replication for job completion times. Operations Research Letters, 49 (1). pp. 91-95. ISSN 01676377

Download (0B)

Abstract

If queue-states are unknown to a dispatcher, a replication strategy has been proposed where jobcopies are sent randomly to servers. When the service of any copy is completed, redundant copies areremoved. For jobs that can be algebraically manipulated and have linear servers, to get the response-time performance of sendingdcopies ofnjobs via the replication strategy, with Maximum DistanceSeparable (MDS) codes we show thatn+djobs suffice. That is, while replication is multiplicative,MDS is linear.

Item Type:	Article
Keywords:	Load balancing; Replication; MDS codes; Batch-completion times;
Academic Unit:	Faculty of Science and Engineering > Research Institutes > Hamilton Institute
Item ID:	15198
Identification Number:	https://doi.org/10.1016/j.orl.2020.11.010
Depositing User:	Dr Ken Duffy
Date Deposited:	07 Jan 2022 12:41
Journal or Publication Title:	Operations Research Letters
Publisher:	Elsevier
Refereed:	Yes
URI:	Publisher
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

Repository Staff Only(login required)

Item control page

Downloads

Origin of downloads