Addendum and Erratum to "The MDS Queue: Analysing the Latency Performance of Erasure Codes"
Lists
Only you see this
Abstract
In the above article <xref ref-type="bibr" rid="ref1" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[1]</xref> , we introduced two scheduling policies and analyzed their average job latencies. With an implicit assumption that the scheduling policies provide sample-path bounds by construction, we claimed that their average job latencies serve as upper and lower bounds on that of a centralized MDS queue. In this note, we present recently discovered counterexamples, disproving the assumption. We replace the assumption with a conjecture that the average latency bounds still hold. We also provide an erratum to the original article to correct any confusing or misleading statements.
BibTeX
@article{lee2022addendum,
author = {Kangwook Lee and Nihar B. Shah and Longbo Huang and Kannan Ramchandran},
title = {{Addendum and Erratum to "The MDS Queue: Analysing the Latency Performance of Erasure Codes"}},
journal = {IEEE Trans. Information Theory},
year = {2022},
url = {https://openreview.net/forum?id=DSwduDajdT},
}Loading related content...