Home Strategy Activities Grants Publications People Sponsors Blog Contact Us 


This shows you the differences between two versions of the page.

Link to this comparison view

publications:publi:rhanjzjlv16sarp [2019/04/25 08:49]
publications:publi:rhanjzjlv16sarp [2019/09/12 08:51] (current)
Line 1: Line 1:
 +<​html><​div id="​bib">​
 +<p> <h1> RhanJzJlv16SARP</​h1>​
 + <​p><​span class="​BibAuthor">​R. Han, J. Zhan, J.L. Vazquez-Poletti</​span>​. <span class="​BibJournalTitle">​SARP:​ Synopsis-Based Approximate Request Processing for Low Latency and Small Correctness Loss in Cloud Online Services</​span>​. <span class="​BibJournalName">​International Journal of Parallel Programming</​span>,​ 44(5):​1054-1077,​ 2016.</​P><​p>​
 +<a name="​abstract"></​a><​h2>​ Abstract ​ </h2> <​P> ​
 +Despite the importance of providing quick responsiveness to user requests for online services, such request processing is very resource expensive when dealing with large-scale service datasets. These often exceed the service providersÂ’ budget when services are deployed on a cloud, in which resources are charged in monetary terms. Providing approximate processing results in request processing is a feasible solution for such problem that trades off result correctness (e.g. prediction or query accuracy) for response time reduction. However, existing techniques in this area either use parts of datasets or skip expensive computations to produce approximate results, thus resulting in large losses in result correctness on a tight resource budget. In this paper, we propose Synopsis-based Approximate Request Processing (SARP), a SARP framework to produce approximate results with small correctness losses even using small amount of resources. To achieve this, SARP conducts computations over synopses, which aggregate the statistical information of the entire service dataset at different approximation levels, based on two key ideas: (1) offline synopsis management that generates and maintains a set of synopses that represent the aggregation information of the dataset at different approximation levels. (2) Online synopsis selection that considers both the current resource allocation and the workload status so as to select the synopsis with the maximal length that can be processed within the required response time. We demonstrate the effectiveness of our approach by testing the recommendation services in e-commerce sites using a large, real-world dataset. Using prediction accuracy as the result correctness metric, the results demonstrate:​ (i) SARP achieves significant response time reduction with very small correctness losses compared to the exact processing results; (ii) using the same processing time, SARP demonstrates a considerable reduction in correctness loss compared to existing approximation techniques<​p>​
 + <a name="​keyword"></​a>​ <​h2>​Keyword</​h2> ​ <p>[ <a href="/​doku.php?​id=publications:​keyword:​tin2015-65469-p">​Tin2015-65469-p</​a>​ ] 
 +<a name="​contact"></​a><​h2>​ Contact ​ </h2> <​P> ​
 +<a href="​mailto:​jlvazquez@fdi.ucm.es">​Jose Luis  Vazquez-Poletti</​a> ​ <a href="/​jlvazquez">​ <img src="/​lib/​exe/​fetch.php?​w=&​h=&​cache=cache&​media=html_icon.png"​ align=top border=0 alt =""></​a><​br> ​
 +<a name="​bib"></​a><​h2>​ BibTex Reference ​ </h2> <​P> ​
 +@article{RhanJzJlv16SARP,​ <​br>&​nbsp;&​nbsp;&​nbsp;​Author = {Han, R. and Zhan, J. and Vazquez-Poletti,​ J.L.},<​br>&​nbsp;&​nbsp;&​nbsp;​Title = {SARP: Synopsis-Based Approximate Request Processing for Low Latency and Small Correctness Loss in Cloud Online Services},<​br>&​nbsp;&​nbsp;&​nbsp;​Journal = {International Journal of Parallel Programming},<​br>&​nbsp;&​nbsp;&​nbsp;​Volume = {44},<​br>&​nbsp;&​nbsp;&​nbsp;​Number = {5},<​br>&​nbsp;&​nbsp;&​nbsp;​Pages = {1054--1077},<​br>&​nbsp;&​nbsp;&​nbsp;​Year = {2016}<​br>​} <​br><​p>​
Admin · Log In