Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Practical analysis of replication-based systems

Tools
- Tools
+ Tools

Ciucu, Florin, Poloczek, Felix, Chen, Lydia and Chan, Martin (2021) Practical analysis of replication-based systems. In: IEEE International Conference on Computer Communications, Virtual Conference, 10-13 May 2021. Published in: IEEE INFOCOM 2021 - IEEE Conference on Computer Communications doi:10.1109/INFOCOM42981.2021.9488829 ISSN 0743-166X.

[img]
Preview
PDF
WRAP-Practical-analysis-replication-based-systems-2021.pdf - Accepted Version - Requires a PDF viewer.

Download (968Kb) | Preview
Official URL: https://doi.org/10.1109/INFOCOM42981.2021.9488829

Request Changes to record.

Abstract

Task replication has been advocated as a practical solution to reduce response times in parallel systems. The analysis of replication-based systems typically rests on some strong assumptions: Poisson arrivals, exponential service times, or independent service times of the replicas. This study is motivated not only by several studies which indicate that these assumptions are unrealistic, but also by some elementary observations highlighting some contriving behaviour. For instance, when service times are not exponential, adding a replication factor can stabilize an unstable system, i.e., having infinite delays, but a tempting higher replication factor can push the system back in a perilous unstable state. This behaviour disappears however if the replicas are sufficiently correlated, in which case any replication factor would even be detrimental.Motivated by the need to dispense with such common yet unrealistic and misleading assumptions, we provide a robust theoretical framework to compute stochastic bounds on response time distributions in general replication systems subject to Markovian arrivals, quite general service times, and correlated replicas. Numerical results show that our bounds are accurate and improve state-of-the-art bounds in the case of Markovian arrivals by as much as three orders of magnitude. We apply our results to a practical application and highlight that correctly setting the replication factor crucially depends on both the service time distributions of the replicas and the degree of correlation amongst.

Item Type: Conference Item (Paper)
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Exponential sums , Markov processes , Electronic data processing -- Distributed processing, Operations research
Journal or Publication Title: IEEE INFOCOM 2021 - IEEE Conference on Computer Communications
Publisher: IEEE
ISSN: 0743-166X
Official Date: 26 July 2021
Dates:
DateEvent
26 July 2021Published
5 December 2020Accepted
DOI: 10.1109/INFOCOM42981.2021.9488829
Status: Peer Reviewed
Publication Status: Published
Reuse Statement (publisher, data, author rights): © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Access rights to Published version: Restricted or Subscription Access
Date of first compliant deposit: 15 January 2021
Date of first compliant Open Access: 18 January 2021
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
EP/T031115/1[EPSRC] Engineering and Physical Sciences Research Councilhttp://dx.doi.org/10.13039/501100000266
Is Part Of: 1
Conference Paper Type: Paper
Title of Event: IEEE International Conference on Computer Communications
Type of Event: Conference
Location of Event: Virtual Conference
Date(s) of Event: 10-13 May 2021

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us