A Request Handling Mechanism with the Shortest Processing-Time First in Web Servers

A request handling mechanism with the short processing-time first called SPTF is proposed based on requests classified according to their processing time in this paper. The SPTF is the kind of scheduling method between the first-come first-served and the shortest job first. Unlike the shortest job first, the SPTF is not preemption scheduling method and it do not happen this situation in which a request is waited for long time or happens overtime for its responded by Web server. The SPTF improves overall response time per request under Web server heavy load. Finally, this paper shows a series of simulating experiments via comparing the first-come first-service scheduling method with the SPTF. The data obtained from the simulating experiments show that the proposed SPTF is an effective and feasible method to improve the traditional Web server performance and quality of service.