Performance Enhancement of Read-only Transactions Using Speculative Locking Protocol T. Ragunathan and Dr. P. K. Reddy  Problems in Processing Read-only.

Slides:



Advertisements
Similar presentations
Remus: High Availability via Asynchronous Virtual Machine Replication
Advertisements

Concurrency Control III. General Overview Relational model - SQL Formal & commercial query languages Functional Dependencies Normalization Physical Design.
Optimistic Methods for Concurrency Control By : H.T. Kung & John T. Robinson Presenters: Munawer Saeed.
Unit 9 Concurrency Control. 9-2 Wei-Pang Yang, Information Management, NDHU Content  9.1 Introduction  9.2 Locking Technique  9.3 Optimistic Concurrency.
1 Concurrency Control Chapter Conflict Serializable Schedules  Two actions are in conflict if  they operate on the same DB item,  they belong.
Transaction Management: Concurrency Control CS634 Class 17, Apr 7, 2014 Slides based on “Database Management Systems” 3 rd ed, Ramakrishnan and Gehrke.
Principles of Transaction Management. Outline Transaction concepts & protocols Performance impact of concurrency control Performance tuning.
Concurrency Control Enforcing Serializability by Locks
Presented by Dr. Greg Speegle.  Concurrency Control  Multiple Versions  Version number timestamp of writing transaction  Read last committed value.
CSIS 7102 Spring 2004 Lecture 5 : Non-locking based concurrency control (and some more lock-based ones, too) Dr. King-Ip Lin.
HANA database lectures March ©2013 SAP AG or an SAP affiliate company. All rights reserved.2 Outline Part 1 Motivation - Why main memory processing.
Database Management Systems, 3ed, R. Ramakrishnan and J. Gehrke 1 Crash Recovery Chapter 18.
Loose-Ordering Consistency for Persistent Memory
Introduction to Database Systems1 Logging and Recovery CC Lecture 2.
COMP9315: Database System Implementation 1 Crash Recovery Chapter 18 (3 rd Edition)
Chapter 6 Process Synchronization: Part 2. Problems with Semaphores Correct use of semaphore operations may not be easy: –Suppose semaphore variable called.
1 Database Replication Using Generalized Snapshot Isolation Sameh Elnikety, EPFL Fernando Pedone, USI Willy Zwaenepoel, EPFL.
Transactional Memory Overview Olatunji Ruwase Fall 2007 Oct
Database Replication techniques: a Three Parameter Classification Authors : Database Replication techniques: a Three Parameter Classification Authors :
Transactions – T4.3 Title: Concurrency Control Performance Modeling: Alternatives and Implications Authors: R. Agarwal, M. J. Carey, M. Livny ACM TODS,
1 Transaction Management Overview Yanlei Diao UMass Amherst March 15, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
Database Management Systems 1 Logging and Recovery If you are going to be in the logging business, one of the things that you have to do is to learn about.
ACS-4902 R. McFadyen 1 Chapter 18 Database Concurrency Control Locking 18.1 Shared/Exclusive (aka Read/Write) Locks Lock Operations Read_lock(X) Write_lock(X)
Session – 16 RECOVERY CONTROL - 1 Matakuliah: M0184 / Pengolahan Data Distribusi Tahun: 2005 Versi:
Quick Review of Apr 24 material Sorting (Sections 13.4) Sort-merge Algorithm for external sorting Join Operation implementations (sect. 13.5) –Size estimation.
Academic Year 2014 Spring Academic Year 2014 Spring.
AN OPTIMISTIC CONCURRENCY CONTROL ALGORITHM FOR MOBILE AD-HOC NETWORK DATABASES Brendan Walker.
Concurrency Control in Distributed Databases. By :- Rishikesh Mandvikar rmandvik[at]engr.smu.edu May 1, 2004.
Orbe: Scalable Causal Consistency Using Dependency Matrices & Physical Clocks Jiaqing Du, EPFL Sameh Elnikety, Microsoft Research Amitabha Roy, EPFL Willy.
DURABILITY OF TRANSACTIONS AND CRASH RECOVERY These are mostly the slides of your textbook !
Solution to Dining Philosophers. Each philosopher I invokes the operations pickup() and putdown() in the following sequence: dp.pickup(i) EAT dp.putdown(i)
© Pearson Education Limited, Chapter 16 Physical Database Design – Step 7 (Monitor and Tune the Operational System) Transparencies.
Presented by Dr. Greg Speegle April 12,  Two-phase commit slow relative to local transaction processing  CAP Theorem  Option 1: Reduce availability.
Powered by 3PILLAR LABS HAILSTORM 4.0 TM PERFORMANCE REPORT.
School of Information Technologies Michael Cahill 1, Uwe Röhm and Alan Fekete School of IT, University of Sydney {mjc, roehm, Serializable.
Scaling Dynamic Content Applications through Data Replication - Opportunities for Compiler Optimizations Cristiana Amza UofT.
By Phani Gowthami Tammineni. Overview This presentation is about the issues in real-time database systems and presents an overview of the state of the.
Module Coordinator Tan Szu Tak School of Information and Communication Technology, Politeknik Brunei Semester
WG5: Applications & Performance Evaluation Pascal Felber
II.I Selected Database Issues: 2 - Transaction ManagementSlide 1/20 1 II. Selected Database Issues Part 2: Transaction Management Lecture 4 Lecturer: Chris.
Jason Wong Applications Manager DBA/Developer Programmer …. 20+ years IS&T, DEV,
Parametric Optimization Of Some Critical Operating System Functions An Alternative Approach To The Study Of Operating Systems Design.
Optimistic Methods for Concurrency Control By: H.T. Kung and John Robinson Presented by: Frederick Ramirez.
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
Chapter 20 Transaction Management Thomas Connolly, Carolyn Begg, Database System, A Practical Approach to Design Implementation and Management, 4 th Edition,
1 Concurrency control lock-base protocols timestamp-based protocols validation-based protocols Ioan Despi.
9/27/05© 2005 Microsoft Corporation1 Relaxed-Currency Serializability Philip A. Bernstein, Microsoft Research Alan Fekete, Univ. of Sydney Raghu Ramakrishnan,
Roy Ernest Database Administrator Pinnacle Sports Worldwide
Transaction Management Transparencies. ©Pearson Education 2009 Chapter 14 - Objectives Function and importance of transactions. Properties of transactions.
Performance Evaluation of Speculative Locking with unlimited resources M.Tech Presentation by G. Uday Kiran Reddy.
Timestamp-based Concurrency Control
Transaction Management Exercises I/O and CPU activities can be and are overlapped to minimize (disk and processor) idle time and to maximize throughput.
Database Isolation Levels. Reading Database Isolation Levels, lecture notes by Dr. A. Fekete, resentation/AustralianComputer.
Transactional Memory Coherence and Consistency Lance Hammond, Vicky Wong, Mike Chen, Brian D. Carlstrom, John D. Davis, Ben Hertzberg, Manohar K. Prabhu,
Don’t be lazy, be consistent: Postgres-R, A new way to implement Database Replication Paper by Bettina Kemme and Gustavo Alonso, VLDB 2000 Presentation.
Relaxed Currency Serializability for Middle-Tier Caching and Replication Philip A. Bernstein, Alan Fekete, Hongfei Guo, Raghu Ramakrishnan, Pradeep Tamma.
Speculative execution Landon Cox April 13, Making disk accesses tolerable Basic idea Remove disk accesses from critical path Transform disk latencies.
LogSI-HTM: Log Based Snapshot Isolation in
T. Ragunathan and P. Krishna Reddy
T. Ragunathan and P. Krishna Reddy
Part- A Transaction Management
EECS 498 Introduction to Distributed Systems Fall 2017
Transaction Properties
Distributed Transactions
Speculative execution and storage
Transaction management
Submitted to Dr. Badie Sartawi Submitted by Nizar Handal Course
Transation Management
Distributed Optimistic Algorithm
Presentation transcript:

Performance Enhancement of Read-only Transactions Using Speculative Locking Protocol T. Ragunathan and Dr. P. K. Reddy  Problems in Processing Read-only Transactions (ROTs) Correctness ( Serializability criteria) Data Currency ( Transactions receive old values) Performance ( Throughput)  The performance of 2PL degrades with data contention. Example:  Snapshot Isolation(SI)-based protocols violate serializability criteria and provide less data currency to ROTs. Example :  Proposed Speculation based approach (SLR) ROTs are processed with speculation. Whenever a UT produces after-image, ROTs access both before- and after-images and start speculative executions. ParametersValues # of objects in the database1000 Time to carry out CPU and I/O requests5ms and 10ms Size of the largest and smallest ROT20 and 15 objects Size of the largest and smallest UT15 and 5 objects  Simulation Parameters and Values.  Simulation Results  Throughput performance is Improved significantly over SI and 2PL.  Data currency of ROTs improved significantly over SI.  Requires manageable extra processing resources ( 1.4 times of memory is required).  Conclusions Proposed speculation based approach improves the performance of ROTs significantly over other protocols. It does not violate serializability criteria. It processes ROTs without data currency problems. The experimental results show that it requires manageable ( 1.4t imes) extra processing resources. Center for Data Engineering International Institute of Information Technology, Hyderabad Example:

Asynchronous Speculative Locking Protocol for improving the performance of Read-only Transactions - T. Ragunathan and Dr. P. K. Reddy  The performance of 2PL degrades with data contention.  Snapshot Isolation(SI)-based protocols violate serializability criteria and provide less data currency to ROTs.  Synchronous speculation based approach (SLR) Improves performance and data currency. ROTs wait for lock conversion ( EW-lock in to SPW-lock) ParametersValues # of objects in the database1000 Time to carry out CPU and I/O requests5ms and 10ms Size of the largest and smallest ROT20 and 15 objects Size of the largest and smallest UT15 and 5 objects  Requires manageable extra processing resources ( 1.5 times of memory is required).  Conclusions Proposed asynchronous speculation based approach improves the performance of ROTs significantly over other protocols. It does not violate serializability criteria. The experimental results show that it requires manageable ( 1.5 times) extra processing resources. Center for Data Engineering International Institute of Information Technology, Hyderabad Example:  Proposed Asynchronous speculative locking protocol (ASLR) ROTs do not wait for lock conversion and can start executions with the available before-images. However ROTs perform speculative executions whenever UTs produce after-images. When an ROT commits, it commits with the appropriate speculative execution. Performance is better than SLR.  Simulation Parameters and Values.  Simulation Results  Throughput performance is Improved significantly over SI, 2PL and SLR. Example: