Managing Response Time Tails by Sharding

P. G. Harrison, N. M. Patel, J. F. Pérez, Z. Qiu

Research output: Contribution to journalArticlepeer-review

Abstract

Matrix analytic methods are developed to compute the probability distribution of response times (i.e., data access times) in distributed storage systems protected by erasure coding, which is implemented by sharding a data object into N fragments, only K < N of which are required to reconstruct the object. This leads to a partial-fork-join model with a choice of canceling policies for the redundant N - K tasks. The accuracy of the analytical model is supported by tests against simulation in a broad range of setups. At increasing workload intensities, numerical results show the extent to which increasing the redundancy level reduces the mean response time of storage reads and significantly flattens the tail of their distribution; this is demonstrated at medium-high quantiles, up to the 99th. The quantitative reduction in response time achieved by two policies for canceling redundant tasks is also shown: For cancel-at-finish and cancel-at-start, which limits the additional load introduced whilst losing the benefit of selectivity amongst fragment service times.

Original languageEnglish (US)
Article number5
JournalACM Transactions on Modeling and Performance Evaluation of Computing Systems
Volume4
Issue number1
DOIs
StatePublished - Mar 2019

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems
  • Software
  • Safety, Risk, Reliability and Quality
  • Media Technology

Fingerprint Dive into the research topics of 'Managing Response Time Tails by Sharding'. Together they form a unique fingerprint.

Cite this