Dissemination-based Data Delivery Using Broadcast Disks

Slides:



Advertisements
Similar presentations
Dynamic Generation of Data Broadcasting Programs for Dynamic Generation of Data Broadcasting Programs for a Broadcast Disk Array in a Mobile Computing.
Advertisements

Dissemination-based Data Delivery Using Broadcast Disks.
Study of Hurricane and Tornado Operating Systems By Shubhanan Bakre.
Caching Strategies in Transcoding-Enabled Proxy System for Streaming Media Distribution Networks Bo Shen Sung-Ju Lee Sujoy Basu IEEE Transactions On Multimedia,
PZ13B Programming Language design and Implementation -4th Edition Copyright©Prentice Hall, PZ13B - Client server computing Programming Language.
Data Broadcast in Asymmetric Wireless Environments Nitin H. Vaidya Sohail Hameed.
Improving Proxy Cache Performance: Analysis of Three Replacement Policies Dilley, J.; Arlitt, M. A journal paper of IEEE Internet Computing, Volume: 3.
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Department of Computer Science Stony Brook University.
Loopback: Exploiting Collaborative Caches for Large-Scale Streaming Ewa Kusmierek, Yingfei Dong, Member, IEEE, and David H. C. Du, Fellow, IEEE.
Client Cache Management Improving the broadcast for one probability access distribution will hurt the performance of other clients with different access.
1 CSE SUNY New Paltz Chapter Seven Exploiting Memory Hierarchy.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 34 – Media Server (Part 3) Klara Nahrstedt Spring 2012.
Client-Server Computing in Mobile Environments
Introduction to Database Systems 1 The Storage Hierarchy and Magnetic Disks Storage Technology: Topic 1.
Construction of efficient PDP scheme for Distributed Cloud Storage. By Manognya Reddy Kondam.
Massively Distributed Database Systems Broadcasting - Data on air Spring 2014 Ki-Joune Li Pusan National University.
Web Cache Replacement Policies: Properties, Limitations and Implications Fabrício Benevenuto, Fernando Duarte, Virgílio Almeida, Jussara Almeida Computer.
Segment-Based Proxy Caching of Multimedia Streams Authors: Kun-Lung Wu, Philip S. Yu, and Joel L. Wolf IBM T.J. Watson Research Center Proceedings of The.
Scalable Web Server on Heterogeneous Cluster CHEN Ge.
Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.
Design of Flash-Based DBMS: An In-Page Logging Approach Sang-Won Lee and Bongki Moon Presented by Chris Homan.
Latency Reduction Techniques for Remote Memory Access in ANEMONE Mark Lewandowski Department of Computer Science Florida State University.
Feb 5, ECET 581/CPET/ECET 499 Mobile Computing Technologies & Apps Data Dissemination and Management 2 of 3 Lecture 7 Paul I-Hai Lin, Professor Electrical.
Energy-Efficient Data Caching and Prefetching for Mobile Devices Based on Utility Huaping Shen, Mohan Kumar, Sajal K. Das, and Zhijun Wang P 邱仁傑.
Client Cache Management Improving the broadcast for one probability access distribution will hurt the performance of other clients with different access.
Introduction: Memory Management 2 Ideally programmers want memory that is large fast non volatile Memory hierarchy small amount of fast, expensive memory.
CPET 565 Mobile Computing Systems Data Dissemination and Management (2) Lecture 8 Hongli Luo Indiana University-Purdue University Fort Wayne.
Massively Distributed Database Systems Broadcasting - Data on air Spring 2015 Ki-Joune Li Pusan National University.
Storage Systems CSE 598d, Spring 2007 OS Support for DB Management DB File System April 3, 2007 Mark Johnson.
Feb 5, ECET 581/CPET/ECET 499 Mobile Computing Technologies & Apps Data Dissemination and Management 3 of 4 Lecture 8 Paul I-Hai Lin, Professor Electrical.
System Models Advanced Operating Systems Nael Abu-halaweh.
A Practical Performance Analysis of Stream Reuse Techniques in Peer-to-Peer VoD Systems Leonardo B. Pinho and Claudio L. Amorim Parallel Computing Laboratory.
These slides are based on the book:
CMSC 611: Advanced Computer Architecture
Chapter 12: Architecture
Chapter 2 Memory and process management
Memory COMPUTER ARCHITECTURE
Distributed Processors
Chapter 1: Introduction
Semantic Data Caching and Replacement
Qiyuan Xing, Jing Wang, Yue Li, Yanbo Han
CS 704 Advanced Computer Architecture
Software Design and Architecture
Data Dissemination and Management (2) Lecture 10
Broadcast Information Dissemination
Naming A name in a distributed system is a string of bits or characters used to refer to an entity. To resolve name a naming system is needed.
Memory Management for Scalable Web Data Servers
Virtual LANs.
CSI 400/500 Operating Systems Spring 2009
Cache memory Direct Cache Memory Associate Cache Memory
Advanced Operating Systems
Advanced Topics in Data Management
Outline Midterm results summary Distributed file systems – continued
Lecture: Cache Innovations, Virtual Memory
Chapter 12: Physical Architecture Layer Design
CSE 4340/5349 Mobile Systems Engineering
Chap. 7 Regularization for Deep Learning (7.8~7.12 )
COT 4600 Operating Systems Spring 2011
/ Computer Architecture and Design
Section 13.1 – Secondary storage management (Former Student’s Note)
Internet Protocols IP: Internet Protocol
Group Based Management of Distributed File Caches
File-System Interface
Data Transformations targeted at minimizing experimental variance
Ch 17 - Binding Protocol Addresses
Database System Architectures
Page Cache and Page Writeback
Lecture 4: File-System Interface
Student : Yan Wang student ID:
Data Dissemination and Management (2) Lecture 10
Presentation transcript:

Dissemination-based Data Delivery Using Broadcast Disks Swarup Acharya Michael Franklin Stanley Zdonik

Introduction Proposes a mechanism called Broadcast Disks to provide database access to mobile clients. Server continuously and repeatedly broadcasts data to a mobile client as it goes by. Multiple disks of different sizes are superimposed on the broadcast medium. Exploits the client storage resources for caching data.

Topics of Discussion Server Broadcast Programs Client Cache Management Prefetching Read/Write Case

Server Broadcast Programs Data server must construct a broadcast “program” to meet the needs of the client population. Server would take the union of required items and broadcast the resulting set cyclically. Single additional layer in a client’s memory hierarchy - flat broadcast. In a flat broadcast the expected wait for an item on the broadcast is the same for all items.

Server Broadcast Programs

Server Broadcast Programs Broadcast Disks are an alternative to flat broadcasts. Broadcast is structured as multiple disks of varying sizes, each spinning at different rates.

Server Broadcast Programs 9/13/2018 Server Broadcast Programs Flat Broadcast Skewed Broadcast Multi-disk Broadcast

Server Broadcast Programs For uniform access probabilities a flat disk has the best expected performance. For increasingly skewed access probabilities, non-flat disk programs perform better. Multi-disk programs perform better than the skewed programs.

Server Broadcast Programs Generating a multi-disk broadcast Number of disks (num_disks) determine the number of different frequencies with which pages will be broadcast. For each disk, the number of pages and the relative frequency of broadcast (rel_freq(i)) are specified.

Server Broadcast Programs

Client Cache Management Improving the broadcast for one probability access distribution will hurt the performance of other clients with different access distributions. Therefore the client machines need to cache pages obtained from the broadcast.

Client Cache Management With traditional caching clients cache the data most likely to be accessed in the future. With Broadcast Disks, traditional caching may lead to poor performance if the server’s broadcast is poorly matched to the clients access distribution.

Client Cache Management In the Broadcast Disk system, clients cache the pages for which the local probability of access is higher than the frequency of broadcast. This leads to the need for cost-based page replacement.

Client Cache Management One cost-based page replacement strategy replaces the page that has the lowest ratio between its probability of access (P) and its frequency of broadcast (X) - PIX PIX requires the following: 1 Perfect knowledge of access probabilities. 2 Comparison of PIX values for all cache resident pages at cache replacement time.

Client Cache Management Another page replacement strategy adds the frequency of broadcast to an LRU style policy. This policy is known as LIX. LIX maintains a separate list of cache-resident pages for each logical disk Each list is ordered based on an approximation of the access probability (L) for each page. A LIX value is computed by dividing L by X, the frequency of broadcast. The page with the lowest LIX value is replaced.

Client Cache Management

Prefetching An alternative approach to obtaining pages from the broadcast. Goal is to improve the response time of clients that access data from the broadcast. Methods of Prefetching: Tag Team Caching Prefetching Heuristic

Prefetching Tag Team Caching - Pages continually replace each other in the cache. For example two pages x and y, being broadcast, the client caches x as it arrives on the broadcast. Client drops x and caches y when y arrives on the broadcast.

Prefetching Simple Prefetching Heuristic Performs a calculation for each page that arrives on the broadcast based on the probability of access for the page (P) and the amount of time that will elapse before the page will come around again (T). If the PT value of the page being broadcast is higher than the page in cache with the lowest PT value, then the page in cache is replaced.

Prefetching

Read/Write Case With dynamic broadcast there are three different changes that have to be handled. 1 Changes to the value of the objects being broadcast. 2 Reorganization of the broadcast. 3 Changes to the contents of the broadcast.

Conclusion Broadcast Disks project investigates the use of data broadcast and client storage resources to provide improved performance, scalability and availability in networked applications with asymmetric capabilities.