Publications

BibTex format

@inproceedings{Harrison:2015:10.1007/978-3-319-23267-6_6,
author = {Harrison, PG and Chis, T},
doi = {10.1007/978-3-319-23267-6_6},
pages = {80--95},
publisher = {Springer},
title = {Moment-Generating Algorithm for Response Time in Processor Sharing Queueing Systems},
url = {http://dx.doi.org/10.1007/978-3-319-23267-6_6},
year = {2015}
}

Download

RIS format (EndNote, RefMan)

TY  - CPAPER
AB  - Response times are arguably the most representative and important metric for measuring the performance of modern computer systems. Further, service level agreements (SLAs), ranging from data centres to smartphone users, demand quick and, equally important, predictable response times. Hence, it is necessary to calculate moments, at least, and ideally response time distributions, which is not straightforward. A new moment-generating algorithm for calculating response times analytically is obtained, based on M/M/1 processor sharing (PS) queueing models. This algorithm is compared against existing work on response times in M/M/1-PS queues and extended to M/M/1 discriminatory PS queues. Two real-world case studies are evaluated.
AU  - Harrison,PG
AU  - Chis,T
DO  - 10.1007/978-3-319-23267-6_6
EP  - 95
PB  - Springer
PY  - 2015///
SN  - 0302-9743
SP  - 80
TI  - Moment-Generating Algorithm for Response Time in Processor Sharing Queueing Systems
UR  - http://dx.doi.org/10.1007/978-3-319-23267-6_6
UR  - http://hdl.handle.net/10044/1/29903
ER  -

Download

ProfessorPeterHarrison

Contact

Location

Summary

Citation

BibTex format

RIS format (EndNote, RefMan)