Modern operating systems
IEEE/ACM Transactions on Networking (TON)
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling Strategy to improve Response Time for Web Applications
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Scheduling with Opting Out: Improving upon Random Priority
Operations Research
Scheduling with Opting Out: Improving upon Random Priority
Operations Research
Scheduling packet transmissions in a multi-hop packet switched network based on message length
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
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
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
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
Stability of size-based scheduling disciplines in resource-sharing networks
Performance Evaluation - Performance 2005
Web servers under overload: How scheduling can help
ACM Transactions on Internet Technology (TOIT)
Revisiting unfairness in web server scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM SIGMETRICS Performance Evaluation Review
Scheduling despite inexact job-size information
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fair, effective, efficient and differentiated scheduling in an enterprise data warehouse
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Performance estimation of M/DK/1 queue under fair sojourn protocol in heavy traffic
Probability in the Engineering and Informational Sciences
CWS: a model-driven scheduling policy for correlated workloads
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Ratio between average sojourn times under processor sharing and fair sojourn protocol
Probability in the Engineering and Informational Sciences
Decoupled speed scaling: Analysis and evaluation
Performance Evaluation
| Hi-index | 0.00 |
We consider the problem of designing a preemptive protocol that is both fair and efficient when one is only concerned with the sojourn time of the job and not intermediate results. Our Fair Sojourn Protocol (FSP) is both efficient, in a strong sense (similar to the shortest remaining processing time protocol: SRPT), and fair, in the sense of guaranteeing that it weakly outperforms processor sharing (PS) for every job on any sample path.Our primary motivation is web serving in which the standard protocol is PS, while recent work proposes using SRPT or variants. Our work suggests both a framework in which to evaluate proposed protocols and an attractive new protocol, FSP.