Processor-sharing queues: some progress in analysis
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Measuring bottleneck link speed in packet-switched networks
Performance Evaluation
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
IEEE/ACM Transactions on Networking (TON)
Classifying scheduling policies with respect to higher moments of conditional response time
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analysis of multi-server systems via dimensionality reduction of markov chains
Analysis of multi-server systems via dimensionality reduction of markov chains
A survey on discriminatory processor sharing
Queueing Systems: Theory and Applications
Closed form solutions for mapping general distributions to quasi-minimal PH distributions
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Queueing Systems: Theory and Applications
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
Scheduling for today's computer systems: bridging theory and practice
Scheduling for today's computer systems: bridging theory and practice
The Foreground-Background queue: A survey
Performance Evaluation
Hi-index | 0.00 |
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 the measure's usefulness.