This paper uses trace-driven simulations to evaluate two novel Web server scheduling policies called KSRPT and T-SRPT. K-SRPT is a multi-threaded version of SRPT (Shortest Remaini...
Size-based scheduling policies such as SRPT have been studied since 1960s and have been applied in various arenas including packet networks and web server scheduling. SRPT has bee...
This note briefly summarizes some results from two papers: [4] and [23]. These papers pose the following question: Is it possible to reduce the expected response time of every req...
Mor Harchol-Balter, Nikhil Bansal, Bianca Schroede...
This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Proc...
This paper addresses the problem of how to service web requests quickly in order to minimize the client response time. Some of the recent work uses the idea of the Shortest Remain...