Cache Storage For the Next Billion Students: Anirudh Badam, Sunghwan Ihm Research Scientist: KyoungSoo Park Presenter: Vivek Pai Collaborator: Larry Peterson.

Slides:



Advertisements
Similar presentations
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Advertisements

Personal Computers and Applications
Network Aware Forward Caching Presenter: Alexandre Gerber Jeffrey Erman, Mohammad T. Hajiaghayi, Dan Pei, Oliver Spatscheck AT&T Labs Research April 24.
1 Senn, Information Technology, 3 rd Edition © 2004 Pearson Prentice Hall James A. Senns Information Technology, 3 rd Edition Chapter 7 Enterprise Databases.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 3 CPUs.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
UNITED NATIONS Shipment Details Report – January 2006.
Evaluating Caching and Storage Options on the Amazon Web Services Cloud Gagan Agrawal, Ohio State University - Columbus, OH David Chiu, Washington State.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
DCV: A Causality Detection Approach for Large- scale Dynamic Collaboration Environments Jiang-Ming Yang Microsoft Research Asia Ning Gu, Qi-Wei Zhang,
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
ZMQS ZMQS
VARUN GUPTA Carnegie Mellon University 1 Partly based on joint work with: Anshul Gandhi Mor Harchol-Balter Mike Kozuch (CMU) (CMU) (Intel Research)
Introduction Lesson 1 Microsoft Office 2010 and the Internet
Report Card P Only 4 files are exported in SAMS, but there are at least 7 tables could be exported in WebSAMS. Report Card P contains 4 functions: Extract,
SE-292 High Performance Computing
1 RAID Overview n Computing speeds double every 3 years n Disk speeds cant keep up n Data needs higher MTBF than any component in system n IO.
Conserving Disk Energy in Network Servers ACM 17th annual international conference on Supercomputing Presented by Hsu Hao Chen.
Fast Crash Recovery in RAMCloud
The IP Revolution. Page 2 The IP Revolution IP Revolution Why now? The 3 Pillars of the IP Revolution How IP changes everything.
Chapter 4 Memory Management Basic memory management Swapping
FIFO Queues CSE 2320 – Algorithms and Data Structures Vassilis Athitsos University of Texas at Arlington 1.
ABC Technology Project
1 Overview Assignment 4: hints Memory management Assignment 3: solution.
Cache and Virtual Memory Replacement Algorithms
Chapter 10: Virtual Memory
A Survey of Web Cache Replacement Strategies Stefan Podlipnig, Laszlo Boszormenyl University Klagenfurt ACM Computing Surveys, December 2003 Presenter:
Virtual Memory 1 Computer Organization II © McQuain Virtual Memory Use main memory as a cache for secondary (disk) storage – Managed jointly.
1 Sizing the Streaming Media Cluster Solution for a Given Workload Lucy Cherkasova and Wenting Tang HPLabs.
Spring 2014 RMS/EOC Proctor Caching Training. Agenda 2 Proctor caching overview Downloading & installing Cache test content.
2 |SharePoint Saturday New York City
IP Multicast Information management 2 Groep T Leuven – Information department 2/14 Agenda •Why IP Multicast ? •Multicast fundamentals •Intradomain.
Scale Free Networks.
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
1 Displaying Open Purchase Orders (F/Y 11). 2  At the end of this course, you should be able to: –Run a Location specific report of all Open Purchase.
Virtual Memory In this lecture, slides from lecture 16 from the course Computer Architecture ECE 201 by Professor Mike Schulte are used with permission.
© 2012 National Heart Foundation of Australia. Slide 2.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
Model and Relationships 6 M 1 M M M M M M M M M M M M M M M M
25 seconds left…...
Test B, 100 Subtraction Facts
1. 2 CST-092 Beginning Computer Windows Concepts Lecture 1: Computer Concepts Computer Concepts Getting Started.
Performance Tuning for Informer PRESENTER: Jason Vorenkamp| | October 11, 2010.
11 = This is the fact family. You say: 8+3=11 and 3+8=11
Week 1.
SE-292 High Performance Computing
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
A SMALL TRUTH TO MAKE LIFE 100%
SE-292 High Performance Computing Memory Hierarchy R. Govindarajan
A SMALL TRUTH TO MAKE LIFE 100%
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
VM Design Issues Vivek Pai / Kai Li Princeton University.
Wide-area Network Acceleration for the Developing World Sunghwan Ihm (Princeton) KyoungSoo Park (KAIST) Vivek S. Pai (Princeton)
CoDeeN,Large Files, & CoDeploy KyoungSoo Park, Vivek Pai, Larry Peterson Princeton University.
Wide-area Network Acceleration for the Developing World
Presentation transcript:

Cache Storage For the Next Billion Students: Anirudh Badam, Sunghwan Ihm Research Scientist: KyoungSoo Park Presenter: Vivek Pai Collaborator: Larry Peterson

Cache Storage for the Next Billion 2 The Next Billion Developing regions are not all alike Many people have stable food, clean water, reasonable power Connectivity, however, is bad Growing middle class with desire for education & technology These people are the next billion

Cache Storage for the Next Billion 3 Bad Networking & Options Africa often backhauled through Europe Satellite latency not fun Ghana: 2Mbps, $6000/month! Emerging option: disk 1TB disk now $200 Even latency better than satellite

Cache Storage for the Next Billion 4 Enter the Tiny Laptops Problem – memory in 256MB range

Cache Storage for the Next Billion 5 Making Storage Work Populate disk with content Preloaded HTTP cache Preloaded WAN accelerator cache Preloaded Web sites – Wikipedia, etc Ship disk to schools Update as needed Pull update caches on-demand during peak Push updates off peak, overnight

Cache Storage for the Next Billion 6 Deployment Scenarios Special servers per school 2 for redundancy Average school size: /laptop, $10K/school Problems 2 $5K doubles per-school cost Servers dont ride laptop commodity curves Solution: no servers, just laptops

Cache Storage for the Next Billion 7 Goal: 1 TB Cache Store on a 256MB Laptop Why caching? Improves Web access Improves WAN access Problem Large disks are really slow Disk storage requires index In-memory indices optimize disk access

Cache Storage for the Next Billion 8 Memory Index Sizing Squid: popular HTTP cache 72 bytes/object Web objects average 8KB each 1TB = 125M objects 125M objects = 9GB RAM just for index Commercial caches: better RAM usage 32 bytes/object 1TB disk = 4GB RAM

Cache Storage for the Next Billion 9 Revisiting Cache Indexing Seek reduction important Most objects small Access largely random High insert rate Assume hit rate is 50% Assume cachable rate is 50% Insert rate = 25% of request rate High delete rate Caches largely full If insert rate = 25%, delete rate = 25% Deletion using LRU, etc

Cache Storage for the Next Billion 10 Restarting the Design Eliminate in-memory index Treat disk like memory Optimize data structures for locality Use location-sensitive algorithms Measure performance Now consider what to add For each addition, measure performance

Cache Storage for the Next Billion 11 What This Yields HashCache family One basic storage engine Pluggable algorithms & indexing HashCache proxy Web proxy using HashCache engine

Cache Storage for the Next Billion 12 Performance Comparison

Cache Storage for the Next Billion 13 Index Bits Per Object

Cache Storage for the Next Billion 14 Index Bits Per Object

Cache Storage for the Next Billion 15 HashCache Memory

Cache Storage for the Next Billion 16 Storage Limits w/2GB Index

Cache Storage for the Next Billion 17 Beyond Diminishing Returns HTTP cachability has upper limit Beyond that, items revalidated helps Revalidation on demand, or background Uncached content still cachable Wide-area accelerators Must still contact servers, though

Cache Storage for the Next Billion 18 Why WAN Acceleration? Lots of slowly-changing data Wikipedia News sites Customized sites WAN acceleration middleboxes Custom protocol between boxes Standard protocols to rest of net Less desirable than caches for Web

Cache Storage for the Next Billion 19 WAN Acceleration Dilemma WAN accelerators use chunks Transit stream broken into chunks Small chunks = high compression Also lots of small objects Large chunks = high performance But worse for compression Memory & disk important

Cache Storage for the Next Billion 20 Merging WAN Acc & HashCache Easily index huge # chunks Small chunks OK Large chunks better Store chunks redundantly Optimize for performance & compression Communicate tradeoffs to cache layer

Cache Storage for the Next Billion 21 Deployments Two cache instances deployed Both in Africa Shared machines, multiple services Working with OLPC on deployment Working on licensing Hopefully resolved this year Goal: all-in-one server for schools

Cache Storage for the Next Billion 22 Longer Term Goals Effort started around server consolidation Virtualization nice, except for memory Many apps very page-fault sensitive Extracting & sharing components desirable More work in developing regions Even within the US: poor, rural, etc Customization for school-like workloads More work on peak/off-peak behavior