MDS coding is better than replication for job completion times

DOI10.1016/j.orl.2020.11.010OpenAlexW3108899102MaRDI QIDQ2661596

Ken R. Duffy, Vsevolod Shneer

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.11052

zbMATH Keywords

MDS codesload balancingreplicationbatch-completion times

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

A Survey of Stability Results for Redundancy Systems

Cites Work

• Unnamed Item
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Polynomial Codes Over Certain Finite Fields
• A Random Linear Network Coding Approach to Multicast
• Balanced Allocations
• Speeding Up Distributed Machine Learning Using Codes
• SCALABLE LOAD BALANCING IN NETWORKED SYSTEMS: UNIVERSALITY PROPERTIES AND STOCHASTIC COUPLING METHODS
• The Power of Slightly More than One Sample in Randomized Load Balancing
• Redundancy-d: The Power of d Choices for Redundancy
• Introduction to Coding Theory

This page was built for publication: MDS coding is better than replication for job completion times