2001
DOI: 10.1007/3-540-45540-x_2
|View full text |Cite
|
Sign up to set email alerts
|

SRPT Scheduling for Web Servers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
34
0
2

Year Published

2001
2001
2018
2018

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 47 publications
(38 citation statements)
references
References 20 publications
2
34
0
2
Order By: Relevance
“…This leads to optimal response times, but with a danger of starving the largest requests, which are deferred in favor of smaller ones. However, studies show that this does not, in fact, happen to any large extent [317,47].…”
Section: Web Server Loadmentioning
confidence: 98%
“…This leads to optimal response times, but with a danger of starving the largest requests, which are deferred in favor of smaller ones. However, studies show that this does not, in fact, happen to any large extent [317,47].…”
Section: Web Server Loadmentioning
confidence: 98%
“…[1], [2], and [3] have proposed and analyzed size based process scheduling in servers to improve Weh performance by exploiting the heavy tailed property of file sizes. U sing queueing theory and measurements it has been shown that the performance of overloaded Web servers can be improved by a factor four and more if Shortest Remaining Processing Time (SRPT) scheduling is employed.…”
Section: Related Workmentioning
confidence: 99%
“…If the objective is to minimize the number of file transfers in progress (equivalently, the mean holding cost or mean sojourn time) and the amount remaining to be transferred is known, then a simple interchange argument shows that the optimal policy is to give priority to the file with shortest remaining processing time (SRPT). This policy has been proposed in the context of Web servers [12,1]. However, it is not suited to our problem for a couple of reasons.…”
Section: Bandwidth Sharing Between Transient Flowsmentioning
confidence: 99%