This paper uses trace-driven simulations to evaluate two novel Web server scheduling
policies called K-SRPT and T-SRPT. K-SRPT is a multi-threaded version of SRPT (shortest …

Recently, size-based policies such as SRPT and FSP have been proposed for scheduling
requests in Web servers. SRPT and FSP are superior to policies that ignore request size …

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 …

Abstract The Shortest-Remaining-Processing-Time (SRPT) scheduling policy is known to be
the optimal policy for minimizing mean response time, but it is rarely employed in computing …

Size-based scheduling policies, such as shortest remaining processing time (SRPT), have
been studied since the 1960s and have been applied in various areas, including packet …

This paper proposes a method for improving the performance of Web servers servicing static
HTTP requests. The idea is to give preference to those requests which are quick, or have …

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 request …

The Shortest-Remaining-Processing-Time (SRPT) scheduling policy has long been known
to be optimal for minimizing mean response time (sojourn time). Despite this fact, SRPT …

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 …

Most well-managed web servers perform well most of the time. Occasionally, however, every
popular web server experiences transient overload. An overloaded web server typically …