Paper Info
Title
The twin measure for queueing system predictability
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.
Year
DOI
Venue
2007
10.5555/1345263.1345323
VALUETOOLS
Keywords
Field
DocType
system thirty second,novel measure,call center,predictable system,twin measure,queueing system predictability,identical job,common scheduling policy,deterministically identical processing time,queueing system,modern day networking system,web server,job scheduling,predictability
Predictability,Scheduling (computing),Computer science,Real-time computing,Processor sharing,Queueing theory,Job scheduler,Queueing system,Web server,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-963-9799-00-4
0
0.34
References 
Authors
5
3
Name
Order
Citations
PageRank
David Raz1234.97
Hanoch Levy255969.67
Benjamin Avi-Itzhak3569.41