Web traffic modeling and Web server performance analysis
ACM SIGMETRICS Performance Evaluation Review
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Self-Similar Network Traffic and Performance Evaluation
Self-Similar Network Traffic and Performance Evaluation
Scheduling strategies and long-range dependence
Queueing Systems: Theory and Applications
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Classifying scheduling policies with respect to unfairness in an M/GI/1
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
SWIFT: Scheduling in Web Servers for Fast Response Time
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
The impact of the service discipline on delay asymptotics
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
Mathematics of Operations Research
Performance analysis of LAS-based scheduling disciplines in a packet switched network
Proceedings of the joint international conference on Measurement and modeling of computer systems
Nearly insensitive bounds on SMART scheduling
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Sojourn time asymptotics in processor-sharing queues
Queueing Systems: Theory and Applications
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Handling load with less stress
Queueing Systems: Theory and Applications
A large-deviations analysis of the GI/GI/1 SRPT queue
Queueing Systems: Theory and Applications
On the average sojourn time under M/M/1/SRPT
Operations Research Letters
Size-based scheduling to improve the performance of short TCP flows
IEEE Network: The Magazine of Global Internetworking
Dynamic packet fragmentation for wireless channels with failures
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
MapReduce optimization using regulated dynamic prioritization
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
CWS: a model-driven scheduling policy for correlated workloads
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Is Tail-Optimal Scheduling Possible?
Operations Research
| Hi-index | 0.00 |
The Shortest Remaining Processing Time (SRPT) scheduling disciplineis optimal and its superior performance, compared with the policies that do not use the knowledge of job sizes, can be quantified using mean-value analysis as well as our new a symptotic distribution allimits for the relatively smaller heavy-tailed jobs. However, the main difficulty in implementing SRPT in large practical systems, e.g., Web servers, is that its complexity grows with the number of jobs in the queue. Hence, in order to lower the complexity, it is natural to approximate SRPT by grouping the arrivals into a fixed (small) number of classes containing jobs of approximately equal size and then serve the classes of smaller jobs with higher priorities. In this paper, we design a novel adaptive grouping mechanism based on relative size comparison of a newly arriving job to the preceding m arrivals. Specifically, if the newly arriving job is smallerthan k and larger than m-k of the previous m jobs, it isrouted into class k. The excellent performance of this mechanism,even for a small number of classes m+1, is demonstrated using both the asymptotic queueing analysis under heavy tails and extensive simulations. We also discuss refinements of the comparison grouping mechanism that improve the accuracy of job classification at the expense of a small additional complexity.