We present a new scheduling protocol that we call the “starvation avoidance protocol ” (SAP). SAP is designed for situations in which users primarily care about the completion time of a job, such as web serving. SAP is similar to the shortest remaining processing time (SRPT) protocol in that small jobs typically receive priority. However, unlike SRPT, SAP has a safeguarding feature that ensures that large jobs cannot be starved indefinitely. In particular, SAP guarantees that every job completes at least as early as it would under processor sharing (PS), a common web serving protocol. Indeed, SAP is strictly better than PS for every nonterminal job during a busy period. Thus, SAP provides an attractive protocol for web servers.
International audienceRequests scheduling in Web servers is a hot research topic. Many works aim at ...
We consider the problem of designing a preemptive protocol that is both fair and efficient when one ...
Under high loads, a Web server may be servicing many hundreds of connections concurrently. In tradi...
We present a new scheduling protocol that we call the “starvation avoidance protocol ” (SAP). SAP is...
This paper proposes a method for improving the performance of Web servers servicing static HTTP requ...
This paper proposes a method for improving the performance of Web servers servicing static HTTP re-q...
This paper provides a detailed implementation study of the behavior of web servers serving static r...
This paper proposes a method for improving the performance of Web servers servicing static HTTP re-q...
Is it possible to reduce the expected response time of every request at a web server, simply by chan...
This note briefly summarizes some results from two papers: [4] and [23]. These papers pose the follo...
Since traditional process schedulers control the sharing of the processor resources among processes ...
This paper provides a detailed implementation study of the behavior of web servers serving static re...
Recently, the Shortest-Remaining-Processing-Time (SRPT) has been proposed for scheduling static HTTP...
This paper proposes a method for improving the performance of Web servers servicing static HTTP requ...
Recently, size-based policies such as SRPT and FSP have been proposed for scheduling requests in web...
International audienceRequests scheduling in Web servers is a hot research topic. Many works aim at ...
We consider the problem of designing a preemptive protocol that is both fair and efficient when one ...
Under high loads, a Web server may be servicing many hundreds of connections concurrently. In tradi...
We present a new scheduling protocol that we call the “starvation avoidance protocol ” (SAP). SAP is...
This paper proposes a method for improving the performance of Web servers servicing static HTTP requ...
This paper proposes a method for improving the performance of Web servers servicing static HTTP re-q...
This paper provides a detailed implementation study of the behavior of web servers serving static r...
This paper proposes a method for improving the performance of Web servers servicing static HTTP re-q...
Is it possible to reduce the expected response time of every request at a web server, simply by chan...
This note briefly summarizes some results from two papers: [4] and [23]. These papers pose the follo...
Since traditional process schedulers control the sharing of the processor resources among processes ...
This paper provides a detailed implementation study of the behavior of web servers serving static re...
Recently, the Shortest-Remaining-Processing-Time (SRPT) has been proposed for scheduling static HTTP...
This paper proposes a method for improving the performance of Web servers servicing static HTTP requ...
Recently, size-based policies such as SRPT and FSP have been proposed for scheduling requests in web...
International audienceRequests scheduling in Web servers is a hot research topic. Many works aim at ...
We consider the problem of designing a preemptive protocol that is both fair and efficient when one ...
Under high loads, a Web server may be servicing many hundreds of connections concurrently. In tradi...