ACM Home Page
Please provide us with feedback. Feedback
A unified platform for data driven web applications with automatic client-server partitioning
Full text PdfPdf (307 KB)
Source
International World Wide Web Conference archive
Proceedings of the 16th international conference on World Wide Web table of contents
Banff, Alberta, Canada
SESSION: Performance engineering of web applications table of contents
Pages: 341 - 350  
Year of Publication: 2007
ISBN:978-1-59593-654-7
Authors
Fan Yang  Cornell University, Ithaca, NY
Nitin Gupta  Cornell University, Ithaca, NY
Nicholas Gerner  Cornell University, Ithaca, NY
Xin Qi  Cornell University, Ithaca, NY
Alan Demers  Cornell University, Ithaca, NY
Johannes Gehrke  Cornell University, Ithaca, NY
Jayavel Shanmugasundaram  Yahoo! Research, Sunnyvale, CA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 122,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1242572.1242619
What is a DOI?

ABSTRACT

Data-driven web applications are usually structured in three tiers with different programming models at each tier. This division forces developers to manually partition application functionality across the tiers, resulting in complex logic, suboptimal partitioning, and expensive re-partitioning of applications. In this paper, we introduce a unified platform for automatic partitioning of data-driven web applications. Our approach is based on Hilda[41, 46], a high-level declarative programming language with a unified data and programming model for all the layers of the application. Based on run-time properties of the application, Hilda's run time system automatically partitions the application between the tiers to improve response time while adhering to memory and/ or processing constraints at the clients. We evaluate our methodology with traces from a real application and with TPC-W, and our results show that automatic partitioning outperforms manual partitioning without the associated development overhead.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Adobe fash. http://en.wikipedia.org/wiki/Macromedia Flash.
 
2
Asynchronous javascript and xml. http://en.wikipedia.org/wiki/Ajax (programming).
 
3
 
4
 
5
6
7
 
8
 
9
 
10
T. W. Commerce. Tpc benchmark http://www.tpc.org/tpcw/.
 
11
E. Cooper, S. Lindley, P. Wadler, and J. Yallop. Links: Web programming without tiers. In Submitted to ESOP 2007.
12
13
14
 
15
A. Hayrapetyan, D. Kempe, M. Pál, and Z. Svitkina. Unbalanced graph cuts. In European Symposium on Algorithms (ESA), Mallorca, Spain, 2005.
 
16
 
17
 
18
M. Ozsu, K. Voruganti, and R. Unrau. An asynchronous avoidance-based cache consistency algorithm for client caching dbmss, 1998.
 
19
 
20
 
21
 
22
 
23
24
25
 
26
 
27
F. Yang et al. A unified platform for data driven web applictions with automatic client-server partitioning. Technical report, Cornell University, 2007. http://techreports.library.cornell.edu.


Collaborative Colleagues:
Fan Yang: colleagues
Nitin Gupta: colleagues
Nicholas Gerner: colleagues
Xin Qi: colleagues
Alan Demers: colleagues
Johannes Gehrke: colleagues
Jayavel Shanmugasundaram: colleagues