Database admission control and request scheduling for dynamic content Web servers

This thesis presents a method to do admission control and request scheduling for database-bound dynamic content Web servers. Our method is both transparent, requiring no modification to the software components, and external, permitting an implementation in a separate proxy. Admission control prevent...

Full description

Bibliographic Details
Main Author: Elnikety, Sameh Mohamed
Other Authors: Zwaenepoel, Willy
Format: Others
Language:English
Published: 2009
Subjects:
Online Access:http://hdl.handle.net/1911/17589
id ndltd-RICE-oai-scholarship.rice.edu-1911-17589
record_format oai_dc
spelling ndltd-RICE-oai-scholarship.rice.edu-1911-175892013-10-23T04:14:14ZDatabase admission control and request scheduling for dynamic content Web serversElnikety, Sameh MohamedComputer ScienceThis thesis presents a method to do admission control and request scheduling for database-bound dynamic content Web servers. Our method is both transparent, requiring no modification to the software components, and external, permitting an implementation in a separate proxy. Admission control prevents overloading the database server. We implement admission control by estimating the amount of work that each request imposes on the system. A request is admitted only when it does not drive the system into overload. Request scheduling improves average response time. We exploit the variability in the workload by using shortest job first scheduling, which reorders the pending requests to reduce the average response time. We evaluate these techniques experimentally using the TPC-W benchmark. We show consistent performance during overload. Moreover, the average response time improves by up to a factor of 14, and peak throughput increases up to 10 percent.Zwaenepoel, Willy2009-06-04T08:37:12Z2009-06-04T08:37:12Z2003ThesisText52 p.application/pdfhttp://hdl.handle.net/1911/17589eng
collection NDLTD
language English
format Others
sources NDLTD
topic Computer Science
spellingShingle Computer Science
Elnikety, Sameh Mohamed
Database admission control and request scheduling for dynamic content Web servers
description This thesis presents a method to do admission control and request scheduling for database-bound dynamic content Web servers. Our method is both transparent, requiring no modification to the software components, and external, permitting an implementation in a separate proxy. Admission control prevents overloading the database server. We implement admission control by estimating the amount of work that each request imposes on the system. A request is admitted only when it does not drive the system into overload. Request scheduling improves average response time. We exploit the variability in the workload by using shortest job first scheduling, which reorders the pending requests to reduce the average response time. We evaluate these techniques experimentally using the TPC-W benchmark. We show consistent performance during overload. Moreover, the average response time improves by up to a factor of 14, and peak throughput increases up to 10 percent.
author2 Zwaenepoel, Willy
author_facet Zwaenepoel, Willy
Elnikety, Sameh Mohamed
author Elnikety, Sameh Mohamed
author_sort Elnikety, Sameh Mohamed
title Database admission control and request scheduling for dynamic content Web servers
title_short Database admission control and request scheduling for dynamic content Web servers
title_full Database admission control and request scheduling for dynamic content Web servers
title_fullStr Database admission control and request scheduling for dynamic content Web servers
title_full_unstemmed Database admission control and request scheduling for dynamic content Web servers
title_sort database admission control and request scheduling for dynamic content web servers
publishDate 2009
url http://hdl.handle.net/1911/17589
work_keys_str_mv AT elniketysamehmohamed databaseadmissioncontrolandrequestschedulingfordynamiccontentwebservers
_version_ 1716610836616708096