Affiliation:
1. Cornell University, Ithaca, NY
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference16 articles.
1. Analysis of SRPT scheduling
2. Scheduling with Opting Out: Improving upon Random Priority
3. Analysis and simulation of a fair queueing algorithm;Demers A.;Journal of Internetworking,1990
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strongly Tail-Optimal Scheduling in the Light-Tailed M/G/1;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2024-05-21
2. Dynamic Priority Job Scheduling on a Hadoop YARN Platform;2023 IEEE 29th International Conference on Parallel and Distributed Systems (ICPADS);2023-12-17
3. On slots’ scheduling;Economic Theory;2023-07-28
4. A cloud weather forecasting service and its relationship with anomaly detection;Service Oriented Computing and Applications;2022-07-29
5. SPIN: BSP Job Scheduling With Placement-Sensitive Execution;IEEE/ACM Transactions on Networking;2021-10