HPDCS Research Group Research Focus STM Systems Dependability of STM Performance Modelling of STM EURO-TM | 1 st Plenary.

Slides:



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

Implementation and Verification of a Cache Coherence protocol using Spin Steven Farago.
Enabling Speculative Parallelization via Merge Semantics in STMs Kaushik Ravichandran Santosh Pande College.
Chapter 15: Transactions Transaction Concept Transaction Concept Concurrent Executions Concurrent Executions Serializability Serializability Testing for.
Evaluating Database-Oriented Replication Schemes in Software Transacional Memory Systems Roberto Palmieri Francesco Quaglia (La Sapienza, University of.
Replication Management. Motivations for Replication Performance enhancement Increased availability Fault tolerance.
E-Transactions: End-to-End Reliability for Three-Tier Architectures Svend Frølund and Rachid Guerraoui.
TOWARDS A SOFTWARE TRANSACTIONAL MEMORY FOR GRAPHICS PROCESSORS Daniel Cederman, Philippas Tsigas and Muhammad Tayyab Chaudhry.
Submitted by: Omer & Ofer Kiselov Supevised by: Dmitri Perelman Networked Software Systems Lab Department of Electrical Engineering, Technion.
Transactional Memory Yujia Jin. Lock and Problems Lock is commonly used with shared data Priority Inversion –Lower priority process hold a lock needed.
Transaction Processing Lecture ACID 2 phase commit.
Database Replication techniques: a Three Parameter Classification Authors : Database Replication techniques: a Three Parameter Classification Authors :
Distributed Systems Fall 2010 Transactions and concurrency control.
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Distributed Snapshots –Termination detection Election algorithms –Bully –Ring.
CS 582 / CMPE 481 Distributed Systems
Quick Review of May 1 material Concurrent Execution and Serializability –inconsistent concurrent schedules –transaction conflicts serializable == conflict.
Transactions – T4.3 Title: Concurrency Control Performance Modeling: Alternatives and Implications Authors: R. Agarwal, M. J. Carey, M. Livny ACM TODS,
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Transaction Management and Concurrency Control.
Distributed Systems Fall 2009 Replication Fall 20095DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
CMPT 401 Summer 2007 Dr. Alexandra Fedorova Lecture XI: Distributed Transactions.
CMPT Dr. Alexandra Fedorova Lecture XI: Distributed Transactions.
CMPT Dr. Alexandra Fedorova Lecture XI: Distributed Transactions.
Commit Protocols. CS5204 – Operating Systems2 Fault Tolerance Causes of failure: process failure machine failure network failure Goals : transparent:
AN OPTIMISTIC CONCURRENCY CONTROL ALGORITHM FOR MOBILE AD-HOC NETWORK DATABASES Brendan Walker.
Solution to Dining Philosophers. Each philosopher I invokes the operations pickup() and putdown() in the following sequence: dp.pickup(i) EAT dp.putdown(i)
Roberto Palmieri – Workshop on Distributed Transactional Memory (WDTM 2012) - 22/02/2012 Lisbon Boosting STM Replication via Speculation Roberto Palmieri,
Reduced Hardware NOrec: A Safe and Scalable Hybrid Transactional Memory Alexander Matveev Nir Shavit MIT.
Consistent and Efficient Database Replication based on Group Communication Bettina Kemme School of Computer Science McGill University, Montreal.
Lecture 12 Recoverability and failure. 2 Optimistic Techniques Based on assumption that conflict is rare and more efficient to let transactions proceed.
1 Transaction Management Overview Chapter Transactions  Concurrent execution of user programs is essential for good DBMS performance.  Because.
Concurrency Server accesses data on behalf of client – series of operations is a transaction – transactions are atomic Several clients may invoke transactions.
Replicated Databases. Reading Textbook: Ch.13 Textbook: Ch.13 FarkasCSCE Spring
Introduction to Database Systems1. 2 Basic Definitions Mini-world Some part of the real world about which data is stored in a database. Data Known facts.
IM NTU Distributed Information Systems 2004 Replication Management -- 1 Replication Management Yih-Kuen Tsay Dept. of Information Management National Taiwan.
Transactions. What is it? Transaction - a logical unit of database processing Motivation - want consistent change of state in data Transactions developed.
S-Paxos: Eliminating the Leader Bottleneck
Computer Science Lecture 13, page 1 CS677: Distributed OS Last Class: Canonical Problems Election algorithms –Bully algorithm –Ring algorithm Distributed.
Commit Algorithms Hamid Al-Hamadi CS 5204 November 17, 2009.
Transactions and Concurrency Control. Concurrent Accesses to an Object Multiple threads Atomic operations Thread communication Fairness.
7c.1 Silberschatz, Galvin and Gagne ©2003 Operating System Concepts with Java Module 7c: Atomicity Atomic Transactions Log-based Recovery Checkpoints Concurrent.
A Multiversion Update-Serializable Protocol for Genuine Partial Data Replication Sebastiano Peluso, Pedro Ruivo, Paolo Romano, Francesco Quaglia and Luís.
D u k e S y s t e m s Asynchronous Replicated State Machines (Causal Multicast and All That) Jeff Chase Duke University.
Page 1 Concurrency Control Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.
Software Transactional Memory Should Not Be Obstruction-Free Robert Ennals Presented by Abdulai Sei.
IM NTU Distributed Information Systems 2004 Distributed Transactions -- 1 Distributed Transactions Yih-Kuen Tsay Dept. of Information Management National.
Transaction Management Transparencies. ©Pearson Education 2009 Chapter 14 - Objectives Function and importance of transactions. Properties of transactions.
Introduction to Distributed Databases Yiwei Wu. Introduction A distributed database is a database in which portions of the database are stored on multiple.
1 Advanced Database Concepts Transaction Management and Concurrency Control.
Multidatabase Transaction Management COP5711. Multidatabase Transaction Management Outline Review - Transaction Processing Multidatabase Transaction Management.
Antidio Viguria Ann Krueger A Nonblocking Quorum Consensus Protocol for Replicated Data Divyakant Agrawal and Arthur J. Bernstein Paper Presentation: Dependable.
Chapter Five Distributed file systems. 2 Contents Distributed file system design Distributed file system implementation Trends in distributed file systems.
Computer Science Lecture 13, page 1 CS677: Distributed OS Last Class: Canonical Problems Election algorithms –Bully algorithm –Ring algorithm Distributed.
Distributed Transactions What is a transaction? (A sequence of server operations that must be carried out atomically ) ACID properties - what are these.
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.
Maurice Herlihy and J. Eliot B. Moss,  ISCA '93
Transaction Management and Concurrency Control
Advanced Operating Systems - Fall 2009 Lecture 8 – Wednesday February 4, 2009 Dan C. Marinescu Office: HEC 439 B. Office hours: M,
Transaction Properties
Predictive Performance
RELIABILITY.
Outline Announcements Fault Tolerance.
Chapter 10 Transaction Management and Concurrency Control
Ch 22: Databases Concurrency Control
Replication and Recovery in Distributed Systems
Lecture 22: Consistency Models, TM
Introduction of Week 13 Return assignment 11-1 and 3-1-5
Distributed Transactions
Transaction management
CIS 720 Concurrency Control.
Outline Introduction Background Distributed DBMS Architecture
Presentation transcript:

HPDCS Research Group Research Focus STM Systems Dependability of STM Performance Modelling of STM EURO-TM | 1 st Plenary Meeting | Paris 2011 Roberto Palmieri (PhD Student) “Sapienza” University of Rome Italy Pierangelo Di Sanzo (PhD Student) “Sapienza” University of Rome Italy

HPDCS Research Group Dependability Issues of STMs  In STM systems, manipulated data and related statements are not natively logged on stable storage  Data-audit loss in case of crashes  Periodic logging (check-pointing) could be employed, however with time-granularity not adequate to the proper operation grain EURO-TM | 1 st Plenary Meeting | Paris 2011 REPLICATION

HPDCS Research Group Active Replication + OAB  Active Replication (AR) is a common replication scheme  In AR each replica keeps the entire shared data-set and executes the same transactions in the same order  Optimistic Atomic Broadcast protocol (OAB) is a group communication system involved EURO-TM | 1 st Plenary Meeting | Paris 2011 (example of software architecture replica)

HPDCS Research Group High delays (1/2msec) is in conflict with the growth of available resources in each nodes and with small transaction execution time (typical of STMs) Solution could be optimistically overlap local processing with replica coordination's: COORDINATION PHASES WITHOUT OVERLAP (AB) to-broadcast (m) to-delivery (m) PROCES S m PROCES S m COORDINATION PHASES WITH OVERLAP (OAB) to-broadcast (m) to-delivery (m) PROCESS m opt-delivery (m) Overlapping Processing EURO-TM | 1 st Plenary Meeting | Paris 2011

HPDCS Research Group STR FRAMEWORK  Speculative Transactional Replication Framework  Until the arrive of TO-Delivery, set of optimistically delivered (unordered) transactions could be processed in speculative way  Key Idea -> STR Framework on-line identifies all and only transaction serialization orders that would cause optimistically executed transactions to exhibit distinct outcomes.  Properties: Consistency, Non-redundancy, Completeness  Graph based Concurrency Control:  Speculative Polygraph EURO-TM | 1 st Plenary Meeting | Paris 2011

HPDCS Research Group STR FRAMEWORK EURO-TM | 1 st Plenary Meeting | Paris 2011

HPDCS Research Group AGGRO  AGGRessively Optimistic replication protocol  Tailored for network with spontaneous order (Opt-Delivery order matches TO-Delivery order)  Optimistic processing aimed to follow the optimistic delivery order  The key idea -> Uncommitted data item versions are aggressively made visible to other transactions independently of whether the creating transactions will be eventually committed  Transactions abort/retry materializing a history compliant with optimistic delivery order EURO-TM | 1 st Plenary Meeting | Paris 2011

HPDCS Research Group AGGRO EURO-TM | 1 st Plenary Meeting | Paris 2011

HPDCS Research Group Opportunistic Speculation in Actively REplicated Transactional Systems The snapshot miss event is used to opportunistic exploring additional serialization orders The activation of new transaction instance involves any transaction originally serialized after that (like a wave on a different Speculative serialization order) OSARE EURO-TM | 1 st Plenary Meeting | Paris 2011

HPDCS Research Group Transactional systems performance models: why? system performance analysis scalability analysis identifying performance bottlenecks …. performance comparison among different concurrency control algorithms (CCAs) what-if analysis what would happen if I add one more thread what would happen if I change CCA …. evaluation of new CCAs …. Applications: EURO-TM 1 st Plenary Meeting Paris 2011

HPDCS Research Group queuing and processing delay in accessing hardware resources (CPU, shared bus, …) data conflict in accessing shared data items mutual dependence In transactional systems performance is affected by two factors: data conflict hardware resources usage abort rate transaction response time Building transactional systems performance model… EURO-TM 1 st Plenary Meeting Paris 2011

HPDCS Research Group data conflict hardware resources usage abort rate transaction response time (abort probability increases) (transactions re-run many times)(queuing time increases) (data items utilization increases) …data conflict increases… …abort rate increases… …hardware resources usage increases… …transaction response time increases… Suppose that at some point data conflict increases Example (with optimistic concurrency control): EURO-TM 1 st Plenary Meeting Paris 2011

HPDCS Research Group Performance modelling approach two separated modelling layers: Iterative approach to estimate system performance indicators 1) hardware resources model 2) data conflict model queue network model hardware resources model data conflict model different approaches EURO-TM 1 st Plenary Meeting Paris 2011

HPDCS Research Group transaction non-transactional code block thread model begin commit read/ write code block code block code block.. transaction model back-off t begin t write /t read t commit t tcb t ntcb t backoff t_: expected completion time (input into the model) read/ write code block Performance modelling approach: data conflict model EURO-TM 1 st Plenary Meeting Paris 2011

HPDCS Research Group State (i, j): i is the number of threads which are running transactions and j the number of threads in back-off. CTMC transition rates depend on: λ = 1/ t ntcb : transaction arrivals rate μ i :(=1/ r t,i ) txs run service rate in state (i,*) p c,i : probability to successfully commit in state (i,*) State transition diagram of CTMC with k = 3 Threads execution is modeled via a Continuous Time Markov Chain (CTMC) - μ i and p c,I are input from the transaction modelling layer EURO-TM 1 st Plenary Meeting Paris 2011

HPDCS Research Group iterations : Iterations end when the difference between two consecutive values of p c is < є For each state (i,*) of CTMC: initial settings: CCA modelling equations CCA modelling parameters update concurrency control algorithm model EURO-TM 1 st Plenary Meeting Paris 2011

HPDCS Research Group Model Validation: Model vs. discrete event simulation CCA: lazy locking + read validation (TL2) testing workload: - three transactional classes - uniform data accesses EURO-TM 1 st Plenary Meeting Paris 2011

HPDCS Research Group Thank you EURO-TM 1 st Plenary Meeting Paris 2011