Imperial College London

ProfessorPeterHarrison

Faculty of EngineeringDepartment of Computing

Emeritus Professor in Mathematical Modelling
 
 
 
//

Contact

 

+44 (0)20 7594 8363p.harrison Website

 
 
//

Location

 

353Huxley BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@article{Qiu:2017:10.1109/TPDS.2017.2706268,
author = {Qiu, Z and Perez, JF and Birke, R and Chen, L and Harrison, PG},
doi = {10.1109/TPDS.2017.2706268},
journal = {IEEE Transactions on Parallel and Distributed Systems},
title = {Cutting latency tail: analyzing and validating replication without canceling},
url = {http://dx.doi.org/10.1109/TPDS.2017.2706268},
year = {2017}
}

RIS format (EndNote, RefMan)

TY  - JOUR
AB - Response time variability in software applications can severely degrade the quality of the user experience. To reduce this variability, request replication emerges as an effective solution by spawning multiple copies of each request and using the result of the first one to complete. Most previous studies have mainly focused on the mean latency for systems implementing replica cancellation, i.e., all replicas of a request are canceled once the first one finishes. Instead, we develop models to obtain the response-time distribution for systems where replica cancellation may be too expensive or infeasible to implement, as in “fast” systems, such as web services, or in legacy systems. Furthermore, we introduce a novel service model to explicitly consider correlation in the processing times of the request replicas, and design an efficient algorithm to parameterize the model from real data. Extensive evaluations on a MATLAB benchmark and a three-tier web application (MediaWiki) show remarkable accuracy, e.g., 7% (4%) average error on the 99th percentile response time for the benchmark (respectively, MediaWiki), the requests of which execute in the order of seconds (respectively, milliseconds). Insights into optimal replication levels are thereby gained from this precise quantitative analysis, under a wide variety of system scenarios.
AU - Qiu,Z
AU - Perez,JF
AU - Birke,R
AU - Chen,L
AU - Harrison,PG
DO - 10.1109/TPDS.2017.2706268
PY - 2017///
SN - 1558-2183
TI - Cutting latency tail: analyzing and validating replication without canceling
T2 - IEEE Transactions on Parallel and Distributed Systems
UR - http://dx.doi.org/10.1109/TPDS.2017.2706268
UR - http://hdl.handle.net/10044/1/48358
ER -