Scheduling Strategy to improve Response Time for Web Applications

We propose a tunable scheduling strategy that lies between FIFO and shortest- rst, based on the value of a coe cient Alpha. If Alpha is set to zero then this strategy is just FIFO. Larger Alpha gets us closer to shortest- rst strategy which is known to provide optimal response time. However, unlike the shortest- rst, proposed scheduling strategy is starvation free. This scheduling strategy, called Alpha scheduling with no preemption, allows to improve overall response time per HTTP request more than 3 times under heavy load. We demonstrate our results with a simple simulation model using SpecWeb96 to generate representative WWW workload.

• Type: Conference
• Year: 1998
• Where: HPCN
• Authors: Ludmila Cherkasova
• Keywords: HPCN 1998, HPCN 1999, Response Time, Scheduling Strategy, Tunable Scheduling Strategy