Competitive algorithms for the dynamic selection of component implementations D M Yellin.

Slides:



Advertisements
Similar presentations
Fast Data at Massive Scale Lessons Learned at Facebook Bobby Johnson.
Advertisements

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.
Managing Web server performance with AutoTune agents by Y. Diao, J. L. Hellerstein, S. Parekh, J. P. Bigu Jangwon Han Seongwon Park
Chapter 23 Minimum Spanning Tree
Introduction to Algorithms Quicksort
OOPSLA 2005 Workshop on Library-Centric Software Design The Diary of a Datum: An Approach to Modeling Runtime Complexity in Framework-Based Applications.
Panasonic Singapore Labs – Network Team QoS and Delivery Context in Rule-Based Edge Services Prepared for IWCW2002 By Ng Chan Wah
Efficient Event-based Resource Discovery Wei Yan*, Songlin Hu*, Vinod Muthusamy +, Hans-Arno Jacobsen +, Li Zha* * Chinese Academy of Sciences, Beijing.
Hopkins Storage Systems Lab, Department of Computer Science Automated Physical Design in Database Caches T. Malik, X. Wang, R. Burns Johns Hopkins University.
Building Cloud-ready Video Transcoding System for Content Delivery Networks(CDNs) Zhenyun Zhuang and Chun Guo Speaker: 饒展榕.
Serverless Network File Systems. Network File Systems Allow sharing among independent file systems in a transparent manner Mounting a remote directory.
What’s the Problem Web Server 1 Web Server N Web system played an essential role in Proving and Retrieve information. Cause Overloaded Status and Longer.
MIS 385/MBA 664 Systems Implementation with DBMS/ Database Management Dave Salisbury ( )
Scalable Content-aware Request Distribution in Cluster-based Network Servers Jianbin Wei 10/4/2001.
Achieving Adaptivity for OLAP-XML Federations Torben Bach Pedersen Aalborg University Joint work with Dennis Pedersen, TARGIT.
Toolbox Mirror -Overview Effective Distributed Learning.
Dynamic Internet Congestion with Bursts Stefan Schmid Roger Wattenhofer Distributed Computing Group, ETH Zurich 13th International Conference On High Performance.
DT211/3 Internet Application Development JSP: Processing User input.
Chapter 6: Database Evolution Title: AutoAdmin “What-if” Index Analysis Utility Authors: Surajit Chaudhuri, Vivek Narasayya ACM SIGMOD 1998.
OSMOSIS Final Presentation. Introduction Osmosis System Scalable, distributed system. Many-to-many publisher-subscriber real time sensor data streams,
Multi-server Optimal Bandwidth Monitoring for QoS based Multimedia Delivery Anup Basu, Irene Cheng and Yinzhe Yu Department of Computing Science U. of.
Multiple Tiers in Action
Wide Web Load Balancing Algorithm Design Yingfang Zhang.
Definition of terms Definition of terms Explain business conditions driving distributed databases Explain business conditions driving distributed databases.
Admission Control and Dynamic Adaptation for a Proportional-Delay DiffServ-Enabled Web Server Yu Cai.
Web Application Architecture: multi-tier (2-tier, 3-tier) & mvc
Wireless security & privacy Authors: M. Borsc and H. Shinde Source: IEEE International Conference on Personal Wireless Communications 2005 (ICPWC 2005),
©Ian Sommerville 2006Software Engineering, 8th edition. Chapter 12 Slide 1 Distributed Systems Architectures.
1 Design and Performance of a Web Server Accelerator Eric Levy-Abegnoli, Arun Iyengar, Junehwa Song, and Daniel Dias INFOCOM ‘99.
Physical Database Design & Performance. Optimizing for Query Performance For DBs with high retrieval traffic as compared to maintenance traffic, optimizing.
AUTHORS: STIJN POLFLIET ET. AL. BY: ALI NIKRAVESH Studying Hardware and Software Trade-Offs for a Real-Life Web 2.0 Workload.
Overlay Network Physical LayerR : router Overlay Layer N R R R R R N.
OSG Area Coordinator’s Report: Workload Management February 9 th, 2011 Maxim Potekhin BNL
Real Time Monitor of Grid Job Executions Janusz Martyniak Imperial College London.
Software Performance Testing Based on Workload Characterization Elaine Weyuker Alberto Avritzer Joe Kondek Danielle Liu AT&T Labs.
1 Scheduling The part of the OS that makes the choice of which process to run next is called the scheduler and the algorithm it uses is called the scheduling.
Index Interactions in Physical Design Tuning Modeling, Analysis, and Applications Karl Schnaitter, UC Santa Cruz Neoklis Polyzotis, UC Santa Cruz Lise.
Distributed Information Systems. Motivation ● To understand the problems that Web services try to solve it is helpful to understand how distributed information.
Data Sharing. Data Sharing in a Sysplex Connecting a large number of systems together brings with it special considerations, such as how the large number.
Location Application for Clients in a Mobile-IP Environment Project team: Rinat Gotsulsky Oz Barzilay Vitaly Khait Guy Alster.
To Tune or not to Tune? A Lightweight Physical Design Alerter Nico Bruno, Surajit Chaudhuri DMX Group, Microsoft Research VLDB’06.
Database Server Concepts and Possibilities Lee Lueking D0 Data Browser Workshop April 8, 2002.
Multi-Query Optimization and Applications Prasan Roy Indian Institute of Technology - Bombay.
CAP Theorem Justin DeBrabant CIS Advanced Systems - Fall 2013.
Virtualization and Databases Ashraf Aboulnaga University of Waterloo.
By Sandeep Gadi 12/20/  Design choices for securing a system affect performance, scalability and usability. There is usually a tradeoff between.
Session Information Goals CTAs Customer Evidence TBD
FP6−2004−Infrastructures−6-SSA E-infrastructure shared between Europe and Latin America gLite Information System Claudio Cherubino.
1 University of Maryland Runtime Program Evolution Jeff Hollingsworth © Copyright 2000, Jeffrey K. Hollingsworth, All Rights Reserved. University of Maryland.
Query Processing CS 405G Introduction to Database Systems.
Storage Systems CSE 598d, Spring 2007 OS Support for DB Management DB File System April 3, 2007 Mark Johnson.
November 1, 2004 ElizabethGallas -- D0 Luminosity Db 1 D0 Luminosity Database: Checklist for Production Elizabeth Gallas Fermilab Computing Division /
Dynamically Computing Fastest Paths for Intelligent Transportation Systems - ADITI BHAUMICK ab3585.
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
/ Fast Web Content Delivery An Introduction to Related Techniques by Paper Survey B Li, Chien-chang R Sung, Chih-kuei.
OSG Area Coordinator’s Report: Workload Management February 9 th, 2011 Maxim Potekhin BNL
E-Store: Fine-Grained Elastic Partitioning for Distributed Transaction Processing Systems Jihui Yang CS525 Advanced Distributed System March 1, 2016.
Added Value to XForms by Web Services Supporting XML Protocols Elina Vartiainen Timo-Pekka Viljamaa T Research Seminar on Digital Media Autumn.
Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.
SysPlex -What’s the problem Problems are growing faster than uni-processor….1980’s Leads to SMP and loosely coupled Even faster than SMP and loosely coupled.
Presented by Kristen Carlson Accardi
New developments on the LHCb Bookkeeping
Enterprise Java Bean. Overview of EJB View of EJB Conversation Roles in EJB, Types of Enterprise Beans Lifecycle of Beans Developing Applications using.
Navneet Kumar Pandey1 Stéphane Weiss1 Roman Vitenberg1
Please thank our sponsors!
Two Patterns in Adaptive, Distributed Real-Time, Embedded Middleware
CS122B: Projects in Databases and Web Applications Winter 2019
CS122B: Projects in Databases and Web Applications Spring 2018
CS122B: Projects in Databases and Web Applications Winter 2018
Information Services Claudio Cherubino INFN Catania Bologna
Presentation transcript:

Competitive algorithms for the dynamic selection of component implementations D M Yellin

Mix-n-match Many current apps built by integrating existing components Java Beans and Web services Component programming models = component based development However, all is not well Performance is not optimized Association is loose (different vendors etc)

The problem The adaptive component problem Heavy costs to switch Algorithm needed at run time Applicability to 2 problems Pub/sub – loosely related components read/write shared db Data structure selection – best way for representation for faster access?

Delta Algorithm 2 choice algorithm – assumes that there are two valid choices for each situation Given that impl. is active, it scans the requests, and looks at the costs of that. If the alternative implementation is lower, change impl. Overly simplistic? Bursty traffic?

What Delta should do Based on current workloads Obtained by monitoring Switch models adaptively when needed Hence optimize the workload

Example: The pub/sub problem Pub/sub problem: Database with many accessing nodes Writes goto server, caches on read Application by monitoring each client Switch to sub mode when cost is lower than nonsub mode

How does client know about writes peformed by other clients? No increase in traffic Piggyback write data counts on transmissions Still more data

Adapative Component Problem Requests can be catergorized into using key 1 and key 2 Delta can be used to convert this into impl using key 1 and key 2, and switching between them dynamically Alternative: 2 index tables implemented as dictionary – not always feasible (res overheads)

Competitiveness Apparently this is to justify the existance of Delta Theorem 1: Algorithm Delta is (3+ e)- competitive for any two-implementation- component problem (Proof. Lots of it)

Limitations Only can choose from two components Is there an algorithm for choosing from arbitrary number of impls? One shot switch required Expensive! Better: switch incrementally Competitiveness only Other models can be considered Periodical activity can be used as metric instead?

Comments? Too much math involved. No real examples (framework only) Very dry