Hint-based Acceleration of Web Proxy Cache Daniela Rosu Arun Iyengar Daniel Dias IBM T.J.Watson Research Center Unversity of Yuan Ze,Syslab Mike Tien

Slides:



Advertisements
Similar presentations
Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol Li Fan, Pei Cao and Jussara Almeida University of Wisconsin-Madison Andrei Broder Compaq/DEC.
Advertisements

Supporting Cooperative Caching in Disruption Tolerant Networks
To Include or Not to Include? Natalie Enright Dana Vantrease.
Zhongkai Chen 3/25/2010. Jinglei Wang; Yibo Xue; Haixia Wang; Dongsheng Wang Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China This paper.
Dynamic Load Balancing for VORPAL Viktor Przebinda Center for Integrated Plasma Studies.
M. Waldvogel, G. Varghese, J. Turner, B. Plattner Presenter: Shulin You UNIVERSITY OF MASSACHUSETTS, AMHERST – Department of Electrical and Computer Engineering.
Speculative Sequential Consistency with Little Custom Storage Impetus Group Computer Architecture Lab (CALCM) Carnegie Mellon University
Hash-Based IP Traceback Best Student Paper ACM SIGCOMM’01.
Cooperative Caching of Dynamic Content on a Distributed Web Server Vegard Holmedahl, Ben Smith, Tao Yang Speaker: SeungLak Choi, DB Lab., CS Dept.
Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol By Abuzafor Rasal and Vinoth Rayappan.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
CS 623 Lecture #9 Yen-Yu Chen Utku Irmak. Papers to be read Better operating system features for faster network servers.Better operating system features.
Improving Proxy Cache Performance: Analysis of Three Replacement Policies John Dilley and Martin Arlitt IEEE internet computing volume3 Nov-Dec 1999 Chun-Fu.
Collaborative Web Caching Based on Proxy Affinities Jiong Yang, Wei Wang in T. J.Watson Research Center Richard Muntz in Computer Science Department of.
Scheduling with Optimized Communication for Time-Triggered Embedded Systems Slide 1 Scheduling with Optimized Communication for Time-Triggered Embedded.
Characteristics Location Capacity Unit of transfer Access method Performance Physical type Physical characteristics Organisation.
Web-Conscious Storage Management for Web Proxies Evangelos P. Markatos, Dionisios N. Pnevmatikatos, Member, IEEE, Michail D. Flouris, and Manolis G. H.
Computer System Overview Chapter 1. Basic computer structure CPU Memory memory bus I/O bus diskNet interface.
1Bloom Filters Lookup questions: Does item “ x ” exist in a set or multiset? Data set may be very big or expensive to access. Filter lookup questions with.
Proteus: Power Proportional Memory Cache Cluster in Data Centers Shen Li, Shiguang Wang, Fan Yang, Shaohan Hu, Fatemeh Saremi, Tarek Abdelzaher.
1 The Mystery of Cooperative Web Caching 2 b b Web caching : is a process implemented by a caching proxy to improve the efficiency of the web. It reduces.
Locality-Aware Request Distribution in Cluster-based Network Servers Presented by: Kevin Boos Authors: Vivek S. Pai, Mohit Aron, et al. Rice University.
Hash, Don’t Cache: Fast Packet Forwarding for Enterprise Edge Routers Minlan Yu Princeton University Joint work with Jennifer.
Synchronization and Scheduling in Multiprocessor Operating Systems
1 Route Table Partitioning and Load Balancing for Parallel Searching with TCAMs Department of Computer Science and Information Engineering National Cheng.
Achieving Load Balance and Effective Caching in Clustered Web Servers Richard B. Bunt Derek L. Eager Gregory M. Oster Carey L. Williamson Department of.
Hybrid Prefetching for WWW Proxy Servers Yui-Wen Horng, Wen-Jou Lin, Hsing Mei Department of Computer Science and Information Engineering Fu Jen Catholic.
Tornado: Maximizing Locality and Concurrency in a Shared Memory Multiprocesor Operating System By: Ben Gamsa, Orran Krieger, Jonathan Appavoo, Michael.
1 Design and Performance of a Web Server Accelerator Eric Levy-Abegnoli, Arun Iyengar, Junehwa Song, and Daniel Dias INFOCOM ‘99.
1 Chapter 6: Proxy Server in Internet and Intranet Designs Designs That Include Proxy Server Essential Proxy Server Design Concepts Data Protection in.
EAIT, February 2006 A Pragmatic Approach towards the Improvement of Performance of Ad Hoc Routing ProtocolsOptimizations To Multipath Routing Protocols.
Computer Architecture Lecture 28 Fasih ur Rehman.
Research Interests Georgia Koloniari Computer Science Department University of Ioannina, Greece.
ETRI Bloom Filter-based Flat Name Resolution System for ICN ICNRG Interim meeting, Paris Jungha Hong, Woojik Chun, and Heeyoung Jung September 27, 2014.
Scalable Web Server on Heterogeneous Cluster CHEN Ge.
Distributed Maintenance of Cache Freshness in Opportunistic Mobile Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania.
Performance Prediction for Random Write Reductions: A Case Study in Modelling Shared Memory Programs Ruoming Jin Gagan Agrawal Department of Computer and.
Web Performance 성민영 SNU Computer Systems lab.. 2 차례 4 Modeling the Performance of HTTP Over Several Transport Protocols. 4 Summary Cache : A Scaleable.
Architecture for Caching Responses with Multiple Dynamic Dependencies in Multi-Tier Data- Centers over InfiniBand S. Narravula, P. Balaji, K. Vaidyanathan,
1 Process Scheduling in Multiprocessor and Multithreaded Systems Matt Davis CS5354/7/2003.
Performance of the Shasta distributed shared memory protocol Daniel J. Scales Kourosh Gharachorloo 創造情報学専攻 M グェン トアン ドゥク.
Kiew-Hong Chua a.k.a Francis Computer Network Presentation 12/5/00.
Dr. Yingwu Zhu Summary Cache : A Scalable Wide- Area Web Cache Sharing Protocol.
1 Route Optimization for Large Scale Network Mobility Assisted by BGP Feriel Mimoune, Farid Nait-Abdesselam, Tarik Taleb and Kazuo Hashimoto GLOBECOM 2007.
Increasing Web Server Throughput with Network Interface Data Caching October 9, 2002 Hyong-youb Kim, Vijay S. Pai, and Scott Rixner Rice Computer Architecture.
Author : Guangdeng Liao, Heeyeol Yu, Laxmi Bhuyan Publisher : Publisher : DAC'10 Presenter : Jo-Ning Yu Date : 2010/10/06.
MadCache: A PC-aware Cache Insertion Policy Andrew Nere, Mitch Hayenga, and Mikko Lipasti PHARM Research Group University of Wisconsin – Madison June 20,
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
Improving Disk Throughput in Data-Intensive Servers Enrique V. Carrera and Ricardo Bianchini Department of Computer Science Rutgers University.
Multimedia Information System Lab. Network Architecture Res. Group Cooperative Video Streaming Mechanisms with Video Quality Adjustment Naoki Wakamiya.
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
Analysis of Cache Tuner Architectural Layouts for Multicore Embedded Systems + Also Affiliated with NSF Center for High- Performance Reconfigurable Computing.
Adaptive GPU Cache Bypassing Yingying Tian *, Sooraj Puthoor†, Joseph L. Greathouse†, Bradford M. Beckmann†, Daniel A. Jiménez * Texas A&M University *,
Lazy Release Consistency for Software Distributed Shared Memory Pete Keleher Alan L. Cox Willy Z. By Nooruddin Shaik.
Bloom Filters. Lecture on Bloom Filters Not described in the textbook ! Lecture based in part on: Broder, Andrei; Mitzenmacher, Michael (2005), "Network.
Threaded Programming Lecture 1: Concepts. 2 Overview Shared memory systems Basic Concepts in Threaded Programming.
Project Summary Fair and High Throughput Cache Partitioning Scheme for CMPs Shibdas Bandyopadhyay Dept of CISE University of Florida.
GPFS: A Shared-Disk File System for Large Computing Clusters Frank Schmuck & Roger Haskin IBM Almaden Research Center.
Characteristics Location Capacity Unit of transfer Access method Performance Physical type Physical characteristics Organisation.
Taeho Kgil, Trevor Mudge Advanced Computer Architecture Laboratory The University of Michigan Ann Arbor, USA CASES’06.
EE 382 Processor DesignWinter 98/99Michael Flynn 1 EE382 Processor Design Winter 1998 Chapter 8 Lectures Multiprocessors, Part I.
Evaluating and Optimizing Indexing Schemes for a Cloud-based Elastic Key- Value Store Apeksha Shetty and Gagan Agrawal Ohio State University David Chiu.
Translation Lookaside Buffer
12.4 Memory Organization in Multiprocessor Systems
Distributed Shared Memory
Directory-based Protocol
Translation Lookaside Buffer
CS510 - Portland State University
How Yahoo! use to serve millions of videos from its video library.
Lecture 1: Bloom Filters
Presentation transcript:

Hint-based Acceleration of Web Proxy Cache Daniela Rosu Arun Iyengar Daniel Dias IBM T.J.Watson Research Center Unversity of Yuan Ze,Syslab Mike Tien

Outline 1.Accelerated Web Proxy 2.Hint Representation 3.Hint Consistency 4.Comparison 5.Proxy Accelerator Cache 6.Throughput Improvements 7.Impact of Hint Management 8.Summary 8.Conclusion

1.Accelerated Web Proxy To speed up proxy caches by reducing their cache-miss overhead. Extended content-based router called a proxy accelerator(PA). With embedded O.S optimized for communication.

Accelerated Web Proxy(cont.)

2.Hint Representation Accurate – information  directory scheme (Hash Table) Approximate-information  based on Bloom Filters --bitmap(hint space) PA(entries,hash table) WP(collision counter)

Hint Representation(cont.) --independently & interleaved

3.Hint Consistency Protocol ensure that the information at the PA site reflects the content of the WP Protocol choices --entity that identifies the updates --protocol initiator --rate of update messages --exchanged information Previously proposed --WP-only update --eager hint register

4.Comparison

5.Proxy Accelerator Cache PA should maximize the hit ratio --size, GDS(1) WP should minimize the Network- related costs

6.Throughput Improvements (PA improve WP throughput)

Throughput Improvements(cont.) (PA cpu speed affect improvement)

Throughput Improvements(cont.) (PA-level cache improve throughput)

7.Impact of Hint Management

Impact of Hint Management(cont.)

8.Summary Bloom Filter-based scheme exhibits lower computation and communication overhead WP meta-data may reduce its memory hit ratio Hint look-up overheads are small with respect to the typical request processing overhead Eagar hint registration reduces update- related overheads and prevents hit ratio reductions caused by update delay False hit ratio is more significantly affected by hint representation than by update period

9.Conclusion This miss ratios at proxy caches are often relatively high,we have developed a method to improve the performance of a cluster- based Web proxy by shifting some of its cache miss-related functionality to be executed on a proxy accelerator Eagar registration is a “ must ” and that the Bloom Filter-based scheme is more appropriate than the directory scheme for large WP clusters or when PA and WP nodes have comparable power