{"title":"High Availability and Scalability Support for Web Applications","authors":"Louis Rilling, S. Sivasubramanian, G. Pierre","doi":"10.1109/SAINT.2007.14","DOIUrl":null,"url":null,"abstract":"A database query caching technique, GlobeCBC, can be used to improve the scalability of Web applications. This paper addresses the availability issues in GlobeCBC. Even though high availability is achieved by adding more resources, proper algorithms must be designed to ensure that the clients receive consistent responses amidst failures of the edge and origin servers. We present lightweight algorithms to detect and correct server failures while providing read-your-writes consistency. They exploit the fact that the query workload of Web applications is based on a fixed set of read and write templates. We show that these algorithms incur very low overhead using several microbenchmarks and a complete Web application benchmark","PeriodicalId":440345,"journal":{"name":"2007 International Symposium on Applications and the Internet","volume":"03 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Applications and the Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAINT.2007.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
A database query caching technique, GlobeCBC, can be used to improve the scalability of Web applications. This paper addresses the availability issues in GlobeCBC. Even though high availability is achieved by adding more resources, proper algorithms must be designed to ensure that the clients receive consistent responses amidst failures of the edge and origin servers. We present lightweight algorithms to detect and correct server failures while providing read-your-writes consistency. They exploit the fact that the query workload of Web applications is based on a fixed set of read and write templates. We show that these algorithms incur very low overhead using several microbenchmarks and a complete Web application benchmark