Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T16:56:37.862Z Has data issue: false hasContentIssue false

Heavy Tails in Queueing Systems: Impact of Parallelism on Tail Performance

Published online by Cambridge University Press:  30 January 2018

Bo Jiang*
Affiliation:
University of Massachusetts
Jian Tan*
Affiliation:
The Ohio State University and IBM T. J. Watson Research
Wei Wei*
Affiliation:
University of Massachusetts
Ness Shroff*
Affiliation:
The Ohio State University
Don Towsley*
Affiliation:
University of Massachusetts
*
∗ Postal address: School of Computer Science, University of Massachusetts, 140 Governors Drive, Amherst, MA 01003, USA.
∗∗∗ Postal address: IBM T. J. Watson Research, Yorktown Heights, NY 10598, USA. Email address: tanji@us.ibm.com
∗ Postal address: School of Computer Science, University of Massachusetts, 140 Governors Drive, Amherst, MA 01003, USA.
∗∗∗∗∗ Postal address: Department of Electrical Engineering, The Ohio State University, 2015 Neil Avenue, Columbus, OH 43210, USA. Email address: shroff@ece.osu.edu
∗ Postal address: School of Computer Science, University of Massachusetts, 140 Governors Drive, Amherst, MA 01003, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we quantify the efficiency of parallelism in systems that are prone to failures and exhibit power law processing delays. We characterize the performance of two prototype schemes of parallelism, redundant and split, in terms of both the power law exponent and exact asymptotics of the delay distribution tail. We also develop the optimal splitting scheme which ensures that split always outperforms redundant.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2013