Research Article
The Twin Measure for Queueing System Predictability
@INPROCEEDINGS{10.4108/valuetools.2007.1803, author={David Raz and Hanoch Levy and Benjamin Avi-Itzhak}, title={The Twin Measure for Queueing System Predictability}, proceedings={2nd International ICST Conference on Performance Evaluation Methodologies and Tools}, proceedings_a={VALUETOOLS}, year={2010}, month={5}, keywords={predictability FCFS LCFS SJF LJF LAS SRPT LRPT round robin job scheduling processor sharing PS queue disciplines twin measure}, doi={10.4108/valuetools.2007.1803} }- David Raz
Hanoch Levy
Benjamin Avi-Itzhak
Year: 2010
The Twin Measure for Queueing System Predictability
VALUETOOLS
ICST
DOI: 10.4108/valuetools.2007.1803
Abstract
Two identical jobs with deterministically identical processing times arrive at a Web server simultaneously (Twins), but leave the system thirty seconds apart. Is the service predictable? Is their sojourn time predictable? This issue arises in modern day networking systems such as call centers and Web servers as well as in other queueing systems. We propose a novel measure based on the principle that in a predictable system, "twin" jobs should not depart the system very far apart. We analyze this measure for a number of common scheduling policies and compare the results. We compare the results to those of other predictability approaches proposed recently and discuss its usefulness.
Copyright © 2007–2024 ICST
