Nearly insensitive bounds on SMART scheduling
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Web servers under overload: How scheduling can help
ACM Transactions on Internet Technology (TOIT)
Tail asymptotics for policies favoring short jobs in a many-flows regime
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
On the effect of inexact size information in size based policies
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
Adaptive and scalable comparison scheduling
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance Evaluation
Scheduling despite inexact job-size information
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The effect of local scheduling in load balancing designs
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
This paper addresses the problem of how to service webrequests quickly in order to minimize the client responsetime. Some of the recent work uses the idea of the ShortestRemaining Processing Time scheduling (SRPT) in Webservers in order to give preference to requests for short files.However, by considering only the size of the file for determiningthe priority of requests, the previous works lackin capturing potentially useful scheduling information containedin the interaction between networks and end systems.To address this, this paper proposes and implements an algorithm,SWIFT, that focuses on both server and networkcharacteristics in conjunction. Our approach prioritizes requestsbased on the size of the file requested and the distanceof the client from the server. The implementation isat the kernel level for a finer-grained control over the packetsentering the network. We present the results of the experimentsconducted in a WAN environment to test the efficacyof SWIFT. The results show that for large-sized files,SWIFT shows an improvement of 2.5% - 10% over the SRPTscheme for the tested server loads.