Show simple item record

dc.contributor.advisor Zwaenepoel, Willy
dc.creatorElnikety, Sameh Mohamed
dc.date.accessioned 2009-06-04T08:37:12Z
dc.date.available 2009-06-04T08:37:12Z
dc.date.issued 2003
dc.identifier.urihttps://hdl.handle.net/1911/17589
dc.description.abstract 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.
dc.format.extent 52 p.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.subjectComputer science
dc.title Database admission control and request scheduling for dynamic content Web servers
dc.type.genre Thesis
dc.type.material Text
thesis.degree.department Computer Science
thesis.degree.discipline Engineering
thesis.degree.grantor Rice University
thesis.degree.level Masters
thesis.degree.name Master of Science
dc.identifier.citation Elnikety, Sameh Mohamed. "Database admission control and request scheduling for dynamic content Web servers." (2003) Master’s Thesis, Rice University. https://hdl.handle.net/1911/17589.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record