Preference-Aware Query and Update Scheduling in Web-databases Huiming Qu Department of Computer Science University of Pittsburgh Joint work with Prof.

Slides:



Advertisements
Similar presentations
L3S Research Center University of Hanover Germany
Advertisements

On Scheduling Vehicle-Roadside Data Access Yang Zhang Jing Zhao and Guohong Cao The Pennsylvania State University.
Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms Chenyang Lu, John A. Stankovic, Gang Tao, Sang H. Son Presented by Josh Carl.
Hadi Goudarzi and Massoud Pedram
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Winter 2004 UCSC CMPE252B1 CMPE 257: Wireless and Mobile Networking SET 3f: Medium Access Control Protocols.
Fast Algorithms For Hierarchical Range Histogram Constructions
1 Enhanced EDF Scheduling Algorithms for Orchestrating Network-wide Active Measurements Prasad Calyam, Chang-Gun Lee Phani Kumar Arava, Dima Krymskiy OARnet,
DEXA 2005 Control-based Quality Adaptation in Data Stream Management Systems (DSMS) Yicheng Tu†, Mohamed Hefeeda‡, Yuni Xia†, Sunil Prabhakar†, and Song.
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.
All Hands Meeting, 2006 Title: Grid Workflow Scheduling in WOSE (Workflow Optimisation Services for e- Science Applications) Authors: Yash Patel, Andrew.
Efficient Autoscaling in the Cloud using Predictive Models for Workload Forecasting Roy, N., A. Dubey, and A. Gokhale 4th IEEE International Conference.
Towards Feasibility Region Calculus: An End-to-end Schedulability Analysis of Real- Time Multistage Execution William Hawkins and Tarek Abdelzaher Presented.
A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.
Performance Analysis of the IEEE Wireless Metropolitan Area Network nmgmt.cs.nchu.edu.tw 系統暨網路管理實驗室 Systems & Network Management Lab Reporter :黃文帥.
WIC: A General-Purpose Algorithm for Monitoring Web Information Sources Sandeep Pandey (speaker) Kedar Dhamdhere Christopher Olston Carnegie Mellon University.
Fair Scheduling in Web Servers CS 213 Lecture 17 L.N. Bhuyan.
1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.
Grid Load Balancing Scheduling Algorithm Based on Statistics Thinking The 9th International Conference for Young Computer Scientists Bin Lu, Hongbin Zhang.
An Adaptive Multi-Objective Scheduling Selection Framework For Continuous Query Processing Timothy M. Sutherland Bradford Pielech Yali Zhu Luping Ding.
Adaptive Content Delivery for Scalable Web Servers Authors: Rahul Pradhan and Mark Claypool Presented by: David Finkel Computer Science Department Worcester.
Wide Web Load Balancing Algorithm Design Yingfang Zhang.
Bandwidth Allocation in a Self-Managing Multimedia File Server Vijay Sundaram and Prashant Shenoy Department of Computer Science University of Massachusetts.
On Fairness, Optimizing Replica Selection in Data Grids Husni Hamad E. AL-Mistarihi and Chan Huah Yong IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
1 Incentive-Based Scheduling for Market-Like Computational Grids Lijuan Xiao, Yanmin Zhu, Member, IEEE, Lionel M. Ni, Fellow, IEEE, and Zhiwei Xu, Senior.
Seyed Mohamad Alavi, Chi Zhou, Yu Cheng Department of Electrical and Computer Engineering Illinois Institute of Technology, Chicago, IL, USA ICC 2009.
MobSched: An Optimizable Scheduler for Mobile Cloud Computing S. SindiaS. GaoB. Black A.LimV. D. AgrawalP. Agrawal Auburn University, Auburn, AL 45 th.
Dynamic and Decentralized Approaches for Optimal Allocation of Multiple Resources in Virtualized Data Centers Wei Chen, Samuel Hargrove, Heh Miao, Liang.
Efficient Scheduling of Heterogeneous Continuous Queries Mohamed A. Sharaf Panos K. Chrysanthis Alexandros Labrinidis Kirk Pruhs Advanced Data Management.
Freshness-Aware Scheduling of Continuous Queries in the Dynamic Web Mohamed A. Sharaf Alexandros Labrinidis Panos K. Chrysanthis Kirk Pruhs Advanced Data.
A Unified Modeling Framework for Distributed Resource Allocation of General Fork and Join Processing Networks in ACM SIGMETRICS
Computer Science Department University of Pittsburgh 1 Evaluating a DVS Scheme for Real-Time Embedded Systems Ruibin Xu, Daniel Mossé and Rami Melhem.
An Integration Framework for Sensor Networks and Data Stream Management Systems.
1 Maintaining Logical and Temporal Consistency in RT Embedded Database Systems Krithi Ramamritham.
« Performance of Compressed Inverted List Caching in Search Engines » Proceedings of the International World Wide Web Conference Commitee, Beijing 2008)
Budget-based Control for Interactive Services with Partial Execution 1 Yuxiong He, Zihao Ye, Qiang Fu, Sameh Elnikety Microsoft Research.
Towards Robust Indexing for Ranked Queries Dong Xin, Chen Chen, Jiawei Han Department of Computer Science University of Illinois at Urbana-Champaign VLDB.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
Euro-Par, A Resource Allocation Approach for Supporting Time-Critical Applications in Grid Environments Qian Zhu and Gagan Agrawal Department of.
Advanced Spectrum Management in Multicell OFDMA Networks enabling Cognitive Radio Usage F. Bernardo, J. Pérez-Romero, O. Sallent, R. Agustí Radio Communications.
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
Survey of Real Time Databases Telvis Calhoun CSc 6710.
Load Shedding in Stream Databases – A Control-Based Approach Yicheng Tu, Song Liu, Sunil Prabhakar, and Bin Yao Department of Computer Science, Purdue.
A Utility-based Approach to Scheduling Multimedia Streams in P2P Systems Fang Chen Computer Science Dept. University of California, Riverside
X. Li, W. LiuICC May 11, 2003A Joint Layer Design Smart Contention Resolution Random Access Wireless Networks With Unknown Multiple Users: A Joint.
Secure In-Network Aggregation for Wireless Sensor Networks
Real-Time Support for Mobile Robotics K. Ramamritham (+ Li Huan, Prashant Shenoy, Rod Grupen)
Improving Disk Throughput in Data-Intensive Servers Enrique V. Carrera and Ricardo Bianchini Department of Computer Science Rutgers University.
Active Queue Management in Internet and Wireless Networks X. Deng, S. Yi, G. Kesidis and C. R. Das The Pennsylvania State University Stabilized queue size.
Control-Based Load Shedding in Data Stream Management Systems Yicheng Tu and Sunil Prabhakar Department of Computer Sciences, Purdue University April 3,
UNIT: User-ceNtrIc Transaction Management in Web-Database Systems Huiming Qu, Alexandros Labrinidis, Daniel Mosse Advanced Data Management Technologies.
Improving QoS in BitTorrent-like VoD Systems Yan Yang Alix L.H. Chow Leana Golubchik Dannielle Bragg Univ. of Southern California Harvard University InfoCom.
Zeta: Scheduling Interactive Services with Partial Execution Yuxiong He, Sameh Elnikety, James Larus, Chenyu Yan Microsoft Research and Microsoft Bing.
Control-based Quality Adaptation in Data Stream Management Systems (DSMS) Yicheng Tu†, Song Liu‡, Sunil Prabhakar†, and Bin Yao‡ † Department of Computer.
Control-Based Load Shedding in Data Stream Management Systems Yicheng Tu and Sunil Prabhakar Department of Computer Sciences, Purdue University April 3,
Information Systems in Organizations Managing the business: decision-making Growing the business: knowledge management, R&D, and social business.
Architecture for Resource Allocation Services Supporting Interactive Remote Desktop Sessions in Utility Grids Vanish Talwar, HP Labs Bikash Agarwalla,
Dynamic Resource Allocation for Shared Data Centers Using Online Measurements By- Abhishek Chandra, Weibo Gong and Prashant Shenoy.
15/02/2006CHEP 061 Measuring Quality of Service on Worker Node in Cluster Rohitashva Sharma, R S Mundada, Sonika Sachdeva, P S Dhekne, Computer Division,
Introduction to Load Balancing:
Liang Chen Advisor: Gagan Agrawal Computer Science & Engineering
A Framework for Automatic Resource and Accuracy Management in A Cloud Environment Smita Vijayakumar.
Load Shedding in Stream Databases – A Control-Based Approach
CPU Scheduling G.Anuradha
Jason Neih and Monica.S.Lam
Smita Vijayakumar Qian Zhu Gagan Agrawal
Feifei Li, Ching Chang, George Kollios, Azer Bestavros
Lecture 2 Part 3 CPU Scheduling
Dissemination of Dynamic Data on the Internet
IIS Progress Report 2016/01/18.
Presentation transcript:

Preference-Aware Query and Update Scheduling in Web-databases Huiming Qu Department of Computer Science University of Pittsburgh Joint work with Prof. Alex Labrinidis

Huiming Qu, University of 12/18/ Applications  Applications Online stock info. Weather, news… Inventory monitoring Network monitoring  Web-DB workloads Real-only queries Write-only updates Intensive and/or bursty  We focus on scheduling queries and updates to enhance Web- Database performance WWW Browser WWW Server Web-database Data Warehouse Queries Updates

Huiming Qu, University of 12/18/ Why scheduling?  Users care about Timeliness and Staleness  Impact of scheduling A simple test  FIFO  FIFO-UH (Update High)  FIFO-QH (Query High) 2PL-HP [Abbott92] No best for both dimensions  Combining performance metrics Set constraint on one metric and optimize another [Kang04] Construct a single metric based on weighted aggregation [Abadi05]

Huiming Qu, University of 12/18/ Outline  Introduction  Quality Contracts Framework for unifying timeliness and staleness metrics through user preferences  QUTS Query Update Time Share Scheduling according to Quality Contract framework  Experiments  Related work  Conclusions

Huiming Qu, University of 12/18/ Quality Contracts (QC)  Captures user preference Between quality metrics Among different queries  Quality Contract Convert performance on individual metric to the “worth” to users

Huiming Qu, University of 12/18/ Quality Contract (QC) – cont.  Each Query is attached with a QC monotonically non- increasing positive QC functions QC  Optimization goal system profit, P  More details in [Labrinidis06] [Qu07] QoS function QoD function Step QC QoS function QoD function Linear QC

Huiming Qu, University of 12/18/ Outline  Introduction  Quality Contracts  QUTS: Query Update Time Share Scheduling  Experiments  Related work  Conclusions

Huiming Qu, University of 12/18/ Profit guided scheduling  Considers both value and constraint Scheduling according to utility function in real time systems VRD [haritsa93] Value/constraint inflated priorities for queries and updates valueconstraint Queriesqos max rt max Updatesqod max uu max OK Incomparable V RD

Huiming Qu, University of 12/18/ Baseline algorithms  Single priority queue FIFO w/ incomparable priorities, queries and updates cannot be put together  Dual priority queue [adelberg95] Separate update queue & query queue Prioritize queries and updates correspondingly UH (Update High) QH (Query High)  Eliminate hard-wired preference for either QoS or QoD! Profit-guided resource allocation (which queue to execute)

Huiming Qu, University of 12/18/ QUTS (Query Update Time Share)  Dual priority queue with dynamic concatenation  Two-level scheduling scheme (meta-scheduling) Q1: how much CPU should be allocated to queries? Q2: how to deploy CPU allocation?

Huiming Qu, University of 12/18/  Query CPU percentage ρ (0 ≤ ρ ≤ 1)  Approximate system profit P using ρ Q1 - how much CPU to assign?  Optimal solution to maximize P QoS max profit QoS QoD Query share QoD max profit Update shareQuery share  Quadratic function with linear constraints

Huiming Qu, University of 12/18/ Q2 - how to deploy CPU allocation?  Periodically compute ρ and alleviate random variation  With in a single adaptation period, the percentage of CPU assigned to queries should be ρ. time

Huiming Qu, University of 12/18/ Q2 - how to deploy CPU allocation?  Adaptation period ω is divided to N atom time  For each, the system refreshes the system state according to ρ Query High: Update High:  Length of atom time Too small → too many interruptions Too large → miss opportunities time … ρ = 0.5

Huiming Qu, University of 12/18/ Outline  Introduction  Quality Contracts  QUTS: Query Update Time Share Scheduling  Experiments  Related work  Conclusions

Huiming Qu, University of 12/18/ Experiment Setup  Real stock web site traces on April 24, 2000 # queries: # updates: # stocks: 4602 Query execution time5~9ms Update execution time1~5ms Default atom time10ms Default adaptation time1000ms AlgorithmsFIFOUHQHQUTS Meta SchedulingFIFOUpdate highQuery highProfit guided Query prioritiesFIFOVRD (Value over Relative Deadline) Update prioritiesFIFOVRD (Value over Relative Deadline)  Scheduling algorithms compared through simulation

Huiming Qu, University of 12/18/ Experiment Design 1. Performance Compare QUTS with FIFO, UH, and QH under the entire spectrum of QC; 2. Adaptability Evaluate the adaptability of QUTS to changing workloads (QCs); 3. Sensitivity Evaluate the sensitivity of QUTS to its two parameters (ω and ).

Huiming Qu, University of 12/18/ Performance – QC setup  QC  Performance metric Profit Percentage QOD max %0.10.2…0.9 QOS max %0.90.8…0.1 qod max $10 ~ $19$20 ~ $29…$90 ~ $99 qos max $90 ~ $99$80 ~ $89…$10 ~ $19 rt max 50ms ~ 100ms uu max 1 9 sets of QC groups

Huiming Qu, University of 12/18/ Performance – All QC groups Linear QCs Step QCs QUTS gives near maximal profit from both QoS and QoD. Step QCs and linear QCs follow the same trend.

Huiming Qu, University of 12/18/ Performance – Various QC groups FIFO QH UH QUTS QUTS consistently achieves near maximal profit under the whole spectrum of QC

Huiming Qu, University of 12/18/ QUTS Adaptability  Time is divided into four segments.  In odd segments, each QC has qod max = 5 x qos max  In even segments, each QC has qos max = 5 x qod max QUTS adapts to QC changes fast!

Huiming Qu, University of 12/18/ QUTS Sensitivity  Adaptation Period ω Performance varies little for a wide range of ω  Atom Time Better when ≥ transaction execution time ( = 10ms) (ω = 1000ms)

Huiming Qu, University of 12/18/ Outline  Introduction  Quality Contracts  QUTS: Query Update Time Share Scheduling  Experiments  Related work  Conclusions

Huiming Qu, University of 12/18/ Related work  Web-databases [Adelberg et al. 1995] [Challenger et al. 2000] [Luo et al. 2002] [Datta et al. 2002] [Labrinidis et al. 2004] [Qu et al. 2006] [Labrinidis et al. 2006] [Xu et al. 2006] …  Real time databases [Abbott et al., 1988] [Sha et al., 1991] [Haritsa et al., 1993] [Ramamritham et al., 1994] [Burns et al., 2000] …  Stream Processing [Carney et al., 2002] [Das et al., 2003] [Babcock et al., 2004] [Sharaf et al., 2005] [Abadi et al., 2005] …  Economic Models [Ferguson et al., 1996] [Stonebraker et al., 1996] …

Huiming Qu, University of 12/18/ Conclusions  We proposed a Quality Contract framework to capture user preferences in web-database systems, and a meta schedule scheme, QUTS, to dynamically concatenate query queue and update queue according to user queries.  We showed with extensive simulation study on real data traces that QUTS outperforms the baseline algorithms in the whole spectrum of Quality Contract setup, QUTS adapts fast to the changing workloads, and QUTS has little sensitivity to its two parameters.

Huiming Qu, University of 12/18/ Future work  Quality Contract generation strategies Synthetic workload Provide suggestions to users to select QCs I/O scheduling for disk-based Web databases

Huiming Qu, University of 12/18/ Thanks!  Comments & Questions? Huiming Qu

Huiming Qu, University of 12/18/ UNIT System (User-ceNtrIc Trans- action Management)  Web-databases Dual priority queue  Updates > queries  EDF for queries  FIFO for updates 2PL-HP  UNIT: load control Load Balancing Controller Query Admission Control Update Frequency Modulation USM Load Balancing Controller Queries Data Reject Failure Deadline Missed Failure Success Data Stale Failure UNIT +/- queries Admission Control Frequency Modulation Updates Statistics +/- updates

Huiming Qu, University of 12/18/ Sensitivity (atom time)  Profit drops slowly while atom time increases.  Extra versions need to be maintained increase while atom time decreases. Sweet spot

Huiming Qu, University of 12/18/ Workload characteristics

Huiming Qu, University of 12/18/ Questions  Skewed queries  Atom time -> number of tran.  Why restarts  Network delay comparable to database delay when facing high loads of updates Scalability point of view  Plot the correlation on time (U vs. Q)