Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Traffic model and performance evaluation of Web servers
Performance Evaluation
Operating Systems Theory
Measuring the capacity of a Web server under realistic loads
World Wide Web
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Analysis of LAS scheduling for job size distributions with high variance
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Priority Mechanisms for OLTP and Transactional Web Applications
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Enhancing both network and user performance for networks supporting best effort traffic
IEEE/ACM Transactions on Networking (TON)
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
A resource-allocation queueing fairness measure
Proceedings of the joint international conference on Measurement and modeling of computer systems
Size-Based Scheduling Policies with Inaccurate Scheduling Information
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Simulation Evaluation of Hybrid SRPT Scheduling Policies
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
The Impact of Multihop Wireless Channel on TCP Performance
IEEE Transactions on Mobile Computing
Improving Preemptive Prioritization via Statistical Characterization of OLTP Locking
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
Resource allocation between persistent and transient flows
IEEE/ACM Transactions on Networking (TON)
Experimental investigations into TCP performance over wireless multihop networks
Proceedings of the 2005 ACM SIGCOMM workshop on Experimental approaches to wireless network design and analysis
Web servers under overload: How scheduling can help
ACM Transactions on Internet Technology (TOIT)
How to Determine a Good Multi-Programming Level for External Scheduling
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Achieving Class-Based QoS for Transactional Workloads
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Selective early request termination for busy internet services
Proceedings of the 15th international conference on World Wide Web
Comparing FB and PS scheduling policies
ACM SIGMETRICS Performance Evaluation Review
Open versus closed: a cautionary tale
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
The capacity of wireless networks
IEEE Transactions on Information Theory
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues
Operations Research Letters
Size-based scheduling to improve the performance of short TCP flows
IEEE Network: The Magazine of Global Internetworking
TCP fairness issues in IEEE 802.11 wireless LANs
Computer Communications
Size-based and direction-based TCP fairness issues in IEEE 802.11 WLANs
EURASIP Journal on Wireless Communications and Networking
| Hi-index | 0.00 |
In queueing theory, it has been known for a long time that the scheduling policy used in a system greatly impacts user-perceived performance. For example, it has been proven in the 1960's that size-based scheduling policies that give priority to short jobs are optimal with respect to mean response time. Yet, virtually no systems today implement these policies. One reason is that real systems are significantly more complex than a theoretical M/M/1 or M/G/1 queue and it is not obvious how to implement some of these policies in practice. Another reason is that there is a fear that the big jobs will "starve", or be treated unfairly as compared to Processor-Sharing (PS). In this article we show, using two important real world applications, that size-based scheduling can be used in practice to greatly improve mean response times in real systems, without causing unfairness or starvation. The two applications we consider are connection scheduling in web servers and packet scheduling in network routers.