Implementation of SRPT Scheduling in Web Servers

Abstract

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 small remaining processing requirements, in accordance with the SRPT (Shortest-Remaining-Processing-Time) scheduling policy. The implementation is at the kernel level and involves controlling the order in which socket buffers are drained into the network. Experiments use the Linux operating system and the Flash web server. All experiments are repeated under a range of server loads and under both trace-based workloads and those generated by a Web workload generator. Results indicate that SRPT-based scheduling of connections yields significant reductions in mean response time, mean slowdown, and variance in response time at the Web server. Most significantly, and counter to intuition, the large requests are only negligibly penalized (or not at all penalized) as a result of SRPT-based scheduling.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 2000
Accession Number
ADA385123

Entities

People

  • Bianca Schroeder
  • Mor Harchol-balter
  • Nikhil Bansal

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Bandwidth
  • Coefficients
  • Computer Communications
  • Computer Science
  • Computers
  • Internet
  • Measurement
  • Models
  • Network Protocols
  • Networks
  • Operating Systems
  • Standards
  • Throughput
  • Websites
  • Workload
  • World Wide Web

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Mathematics or Statistics
  • Parallel and Distributed Computing.