6.033 Spring Lecture #19. Distributed transactions Availability Replicated State Machines spring 2018 Katrina LaCurts
|
|
- Norma Logan
- 5 years ago
- Views:
Transcription
1 6.033 Spring 2018 Lecture #19 Distributed transactions Availability Replicated State Machines spring 2018 Katrina Laurts
2 goal: build reliable systems from unreliable components the abstraction that makes that easier is transactions, which provide atomicity and isolation, while not hindering performance atomicity isolation shadow copies (simple, poor performance) or logs (better performance, a bit more complex) two-phase locking we also want transaction-based systems to be distributed to run across multiple machines and to remain available even through failures spring 2018 Katrina Laurts
3 1 write1 (X) 2 write2 (X) (replica of ) problem: replica servers can become inconsistent spring 2018 Katrina Laurts
4 if primary fails, switches to backup ( knows how to contact backup servers) primary chooses order of operations, decides all non-deterministic values primary AKs coordinator only after it s sure that backup has all updates (backup) attempt: coordinators communicate with primary servers, who communicate with backup servers spring 2018 Katrina Laurts
5 if primary fails, switches to backup ( knows how to contact backup servers) (dead) (backup) attempt: coordinators communicate with primary servers, who communicate with backup servers spring 2018 Katrina Laurts
6 if primary fails, switches to backup ( knows how to contact backup servers) (dead) attempt: coordinators communicate with primary servers, who communicate with backup servers spring 2018 Katrina Laurts
7 multiple coordinators + the network = problems 1 2 (backup) attempt: coordinators communicate with primary servers, who communicate with backup servers spring 2018 Katrina Laurts
8 multiple coordinators + the network = problems 1 network partition 2 (backup) attempt: coordinators communicate with primary servers, who communicate with backup servers spring 2018
9 multiple coordinators + the network = problems 1 network partition 2 (backup, but primary for 2) attempt: coordinators communicate with primary servers, who communicate with backup servers spring 2018
10 multiple coordinators + the network = problems 1 network partition 2 (backup, but primary for 2) 1 and 2 are using different primaries; and are no longer consistent attempt: coordinators communicate with primary servers, who communicate with backup servers spring 2018
11 use a view server, which determines which replica is the primary spring 2018 Katrina Laurts
12 1:, view server keeps a table that maintains a sequence of views use a view server, which determines which replica is the primary spring 2018 Katrina Laurts
13 primary 1:, backup view server alerts primary/backups about their roles (backup) use a view server, which determines which replica is the primary spring 2018 Katrina Laurts
14 primary sends updates to, gets AKs from backup (as before) primary 1:, backup (backup) use a view server, which determines which replica is the primary spring 2018 Katrina Laurts
15 primary? coordinators make requests to view server to find out who is primary 1:, (backup) use a view server, which determines which replica is the primary spring 2018 Katrina Laurts
16 coordinators contact primary (as before) primary? 1:, (backup) use a view server, which determines which replica is the primary spring 2018 Katrina Laurts
17 primary? 1:, primary/backup(s) ping view server so that it can discover failures (backup) use a view server, which determines which replica is the primary spring 2018 Katrina Laurts
18 handling primary failure (dead) lack of pings indicates to that is down 1:, " (backup) spring 2018 Katrina Laurts
19 handling primary failure (dead) 1:, 2:, -- primary " spring 2018 Katrina Laurts
20 handling primary failure (dead) primary? 1:, 2:, -- " spring 2018 Katrina Laurts
21 handling primary failure (dead) 1:, 2:, -- " spring 2018 Katrina Laurts
22 handling primary failure due to partition network partition 1:, (backup) pose a partition keeps from communicating with the view ser spring 2018
23 handling primary failure due to partition (presumed dead) network partition 1:, lack of pings indicates to that is down (backup) spring 2018
24 handling primary failure due to partition (presumed dead) network p 1:, 2:, -- artition primary makes primary spring 2018
25 primary handling primary failure due to partition (presumed dead) network partition 1:, 2:, -- question: what happens before knows it s the primary? spring 2018
26 handling primary failure due to partition (presumed dead) network partition 1:, 2:, -- rejected by primary will act as backup (accept updates from, reject coordinator requests) spring 2018
27 handling primary failure due to partition (presumed dead) network partition 1:, 2:, -- question: what happens after knows it s the primary, but also thinks it is? spring 2018
28 handling primary failure due to partition rejected by (can t get AK from ) 1:, 2:, -- network partition (presumed dead) rejected by won t be able to act as primary (can t accept client requests because it won t get AKs from ) spring 2018
29 " 1:, problem: what if view server fails? spring 2018 Katrina Laurts
30 " 1:, problem: what if view server fails? go to recitation tomorrow and find out spring 2018 Katrina Laurts
31 Replicated state machines (RSMs) provide single-copy consistency: operations complete as if there is a single copy of the data, though internally there are replicas. RSMs use a primary-backup mechanism for replication. The view server ensures that only one replica acts as the primary. It can also recruit new backups after servers fail. To extend this model to handle view-server failures, we need a mechanism to provide distributed consensus; see tomorrow s recitation (on Raft) spring 2018 Katrina Laurts
32 MIT OpenourseWare ompute stem i ee i Spring 201 For information about citing these materials or our Terms of Use, visit: 32
6.033 Spring Lecture #18. Distributed transactions Multi-site atomicity Two-phase commit spring 2018 Katrina LaCurts
6.033 Spring 2018 Lecture #18 Distributed transactions Multi-site atomicity Two-phase 1 goal: build reliable systems from unreliable components the abstraction that makes that easier is transactions, which
More information6.033 Spring 2016 Lecture #18. Distributed transactions Multi-site atomicity Two-phase commit
6.033 Spring 2016 Lecture #18 Distributed transactions Multi-site atomicity Two-phase Katrina LaCurts lacurts@mit 6.033 2016 goal: build reliable systems from unreliable components the abstraction that
More informationEECS 498 Introduction to Distributed Systems
EECS 498 Introduction to Distributed Systems Fall 2017 Harsha V. Madhyastha Implementing RSMs Logical clock based ordering of requests Cannot serve requests if any one replica is down Primary-backup replication
More informationPrimary-Backup Replication
Primary-Backup Replication CS 240: Computing Systems and Concurrency Lecture 7 Marco Canini Credits: Michael Freedman and Kyle Jamieson developed much of the original material. Simplified Fault Tolerance
More informationPrimary/Backup. CS6450: Distributed Systems Lecture 3/4. Ryan Stutsman
Primary/Backup CS6450: Distributed Systems Lecture 3/4 Ryan Stutsman Material taken/derived from Princeton COS-418 materials created by Michael Freedman and Kyle Jamieson at Princeton University. Licensed
More information6.033 Spring Lecture #12. In-network resource management Queue management schemes Traffic differentiation spring 2018 Katrina LaCurts
6.033 Spring 2018 Lecture #12 In-network resource management Queue management schemes Traffic differentiation 1 Internet of Problems How do we route (and address) scalably, while dealing with issues of
More information6.033 Spring Lecture #6. Monolithic kernels vs. Microkernels Virtual Machines spring 2018 Katrina LaCurts
6.033 Spring 2018 Lecture #6 Monolithic kernels vs. Microkernels Virtual Machines 1 operating systems enforce modularity on a single machine using virtualization in order to enforce modularity + build
More informationRecall: Primary-Backup. State machine replication. Extend PB for high availability. Consensus 2. Mechanism: Replicate and separate servers
Replicated s, RAFT COS 8: Distributed Systems Lecture 8 Recall: Primary-Backup Mechanism: Replicate and separate servers Goal #: Provide a highly reliable service Goal #: Servers should behave just like
More information6.033 Spring Lecture #1. Complexity Modularity and abstraction Enforced modularity via client/server models spring 2018 Katrina LaCurts
6.033 Spring 2018 Lecture #1 Complexity Modularity and abstraction Enforced modularity via client/server models 1 what is a system? a set of interconnected components that has an expected behavior observed
More informationDistributed systems. Lecture 6: distributed transactions, elections, consensus and replication. Malte Schwarzkopf
Distributed systems Lecture 6: distributed transactions, elections, consensus and replication Malte Schwarzkopf Last time Saw how we can build ordered multicast Messages between processes in a group Need
More informationExtend PB for high availability. PB high availability via 2PC. Recall: Primary-Backup. Putting it all together for SMR:
Putting it all together for SMR: Two-Phase Commit, Leader Election RAFT COS 8: Distributed Systems Lecture Recall: Primary-Backup Mechanism: Replicate and separate servers Goal #: Provide a highly reliable
More informationTwo phase commit protocol. Two phase commit protocol. Recall: Linearizability (Strong Consistency) Consensus
Recall: Linearizability (Strong Consistency) Consensus COS 518: Advanced Computer Systems Lecture 4 Provide behavior of a single copy of object: Read should urn the most recent write Subsequent reads should
More informationFrom eventual to strong consistency. Primary-Backup Replication. Primary-Backup Replication. Replication State Machines via Primary-Backup
From eventual to strong consistency Replication s via - Eventual consistency Multi-master: Any node can accept operation Asynchronously, nodes synchronize state COS 418: Distributed Systems Lecture 10
More informationPRIMARY-BACKUP REPLICATION
PRIMARY-BACKUP REPLICATION Primary Backup George Porter Nov 14, 2018 ATTRIBUTION These slides are released under an Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0) Creative Commons
More informationLast time. Distributed systems Lecture 6: Elections, distributed transactions, and replication. DrRobert N. M. Watson
Distributed systems Lecture 6: Elections, distributed transactions, and replication DrRobert N. M. Watson 1 Last time Saw how we can build ordered multicast Messages between processes in a group Need to
More informationReplication in Distributed Systems
Replication in Distributed Systems Replication Basics Multiple copies of data kept in different nodes A set of replicas holding copies of a data Nodes can be physically very close or distributed all over
More informationReplication. Feb 10, 2016 CPSC 416
Replication Feb 10, 2016 CPSC 416 How d we get here? Failures & single systems; fault tolerance techniques added redundancy (ECC memory, RAID, etc.) Conceptually, ECC & RAID both put a master in front
More information6.033 Spring Lecture #5. Threads Condition Variables Preemption spring 2018 Katrina LaCurts
6.033 Spring 2018 Lecture #5 Threads Condition Variables Preemption 1 operating systems enforce modularity on a single machine using virtualization in order to enforce modularity + build an effective operating
More informationCS /15/16. Paul Krzyzanowski 1. Question 1. Distributed Systems 2016 Exam 2 Review. Question 3. Question 2. Question 5.
Question 1 What makes a message unstable? How does an unstable message become stable? Distributed Systems 2016 Exam 2 Review Paul Krzyzanowski Rutgers University Fall 2016 In virtual sychrony, a message
More informationCSE 124: REPLICATED STATE MACHINES. George Porter November 8 and 10, 2017
CSE 24: REPLICATED STATE MACHINES George Porter November 8 and 0, 207 ATTRIBUTION These slides are released under an Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0) Creative Commons
More information6.033 Spring Lecture #3. Operating systems Virtual memory OS abstractions spring 2018 Katrina LaCurts
6.033 Spring 2018 Lecture #3 Operating systems Virtual memory OS abstractions 1 Lingering Problem Client internet Server load(amazon.com/buy.html?socks) what if we don t want our modules to be on entirely
More informationConsistency. CS 475, Spring 2018 Concurrent & Distributed Systems
Consistency CS 475, Spring 2018 Concurrent & Distributed Systems Review: 2PC, Timeouts when Coordinator crashes What if the bank doesn t hear back from coordinator? If bank voted no, it s OK to abort If
More informationSeeing the Big Picture
Seeing the Big Picture Segmenting Images to Create Data 15.071x The Analytics Edge Image Segmentation Divide up digital images to salient regions/clusters corresponding to individual surfaces, objects,
More information11. Replication. Motivation
11. Replication Seite 1 11. Replication Motivation Reliable and high-performance computation on a single instance of a data object is prone to failure. Replicate data to overcome single points of failure
More informationMobile and Heterogeneous databases Distributed Database System Transaction Management. A.R. Hurson Computer Science Missouri Science & Technology
Mobile and Heterogeneous databases Distributed Database System Transaction Management A.R. Hurson Computer Science Missouri Science & Technology 1 Distributed Database System Note, this unit will be covered
More informationDistributed Consensus Protocols
Distributed Consensus Protocols ABSTRACT In this paper, I compare Paxos, the most popular and influential of distributed consensus protocols, and Raft, a fairly new protocol that is considered to be a
More informationConcurrency Control II and Distributed Transactions
Concurrency Control II and Distributed Transactions CS 240: Computing Systems and Concurrency Lecture 18 Marco Canini Credits: Michael Freedman and Kyle Jamieson developed much of the original material.
More informationTransactions. CS 475, Spring 2018 Concurrent & Distributed Systems
Transactions CS 475, Spring 2018 Concurrent & Distributed Systems Review: Transactions boolean transfermoney(person from, Person to, float amount){ if(from.balance >= amount) { from.balance = from.balance
More informationDistributed Computation Models
Distributed Computation Models SWE 622, Spring 2017 Distributed Software Engineering Some slides ack: Jeff Dean HW4 Recap https://b.socrative.com/ Class: SWE622 2 Review Replicating state machines Case
More informationRecovering from a Crash. Three-Phase Commit
Recovering from a Crash If INIT : abort locally and inform coordinator If Ready, contact another process Q and examine Q s state Lecture 18, page 23 Three-Phase Commit Two phase commit: problem if coordinator
More informationCPS 512 midterm exam #1, 10/7/2016
CPS 512 midterm exam #1, 10/7/2016 Your name please: NetID: Answer all questions. Please attempt to confine your answers to the boxes provided. If you don t know the answer to a question, then just say
More informationFailures, Elections, and Raft
Failures, Elections, and Raft CS 8 XI Copyright 06 Thomas W. Doeppner, Rodrigo Fonseca. All rights reserved. Distributed Banking SFO add interest based on current balance PVD deposit $000 CS 8 XI Copyright
More informationParallel Data Types of Parallelism Replication (Multiple copies of the same data) Better throughput for read-only computations Data safety Partitionin
Parallel Data Types of Parallelism Replication (Multiple copies of the same data) Better throughput for read-only computations Data safety Partitioning (Different data at different sites More space Better
More informationDistributed Computing. CS439: Principles of Computer Systems November 20, 2017
Distributed Computing CS439: Principles of Computer Systems November 20, 2017 Last Time Network Programming: Sockets End point of communication Identified by (IP address : port number) pair Client-Side
More informationIntuitive distributed algorithms. with F#
Intuitive distributed algorithms with F# Natallia Dzenisenka Alena Hall @nata_dzen @lenadroid A tour of a variety of intuitivedistributed algorithms used in practical distributed systems. and how to prototype
More informationToday: Fault Tolerance
Today: Fault Tolerance Agreement in presence of faults Two army problem Byzantine generals problem Reliable communication Distributed commit Two phase commit Three phase commit Paxos Failure recovery Checkpointing
More informationCSE 444: Database Internals. Section 9: 2-Phase Commit and Replication
CSE 444: Database Internals Section 9: 2-Phase Commit and Replication 1 Today 2-Phase Commit Replication 2 Two-Phase Commit Protocol (2PC) One coordinator and many subordinates Phase 1: Prepare Phase 2:
More informationConsistency in Distributed Systems
Consistency in Distributed Systems Recall the fundamental DS properties DS may be large in scale and widely distributed 1. concurrent execution of components 2. independent failure modes 3. transmission
More informationConsistency and Replication (part b)
Consistency and Replication (part b) EECS 591 Farnam Jahanian University of Michigan Tanenbaum Chapter 6.1-6.5 Eventual Consistency A very weak consistency model characterized by the lack of simultaneous
More informationREPLICATED STATE MACHINES
5/6/208 REPLICATED STATE MACHINES George Porter May 6, 208 ATTRIBUTION These slides are released under an Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0) Creative Commons license These
More informationRecall our 2PC commit problem. Recall our 2PC commit problem. Doing failover correctly isn t easy. Consensus I. FLP Impossibility, Paxos
Consensus I Recall our 2PC commit problem FLP Impossibility, Paxos Client C 1 C à TC: go! COS 418: Distributed Systems Lecture 7 Michael Freedman Bank A B 2 TC à A, B: prepare! 3 A, B à P: yes or no 4
More informationMulti-version concurrency control
MVCC and Distributed Txns (Spanner) 2P & CC = strict serialization Provides semantics as if only one transaction was running on DB at time, in serial order + Real-time guarantees CS 518: Advanced Computer
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Distributed System Engineering: Spring Exam I
Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.824 Distributed System Engineering: Spring 2017 Exam I Write your name on this cover sheet. If you tear
More informationTolerating Latency in Replicated State Machines through Client Speculation
Tolerating Latency in Replicated State Machines through Client Speculation April 22, 2009 1, James Cowling 2, Edmund B. Nightingale 3, Peter M. Chen 1, Jason Flinn 1, Barbara Liskov 2 University of Michigan
More informationFine-grained Transaction Scheduling in Replicated Databases via Symbolic Execution
Fine-grained Transaction Scheduling in Replicated Databases via Symbolic Execution Raminhas pedro.raminhas@tecnico.ulisboa.pt Stage: 2 nd Year PhD Student Research Area: Dependable and fault-tolerant systems
More informationLecture 6 Consistency and Replication
Lecture 6 Consistency and Replication Prof. Wilson Rivera University of Puerto Rico at Mayaguez Electrical and Computer Engineering Department Outline Data-centric consistency Client-centric consistency
More informationBeyond FLP. Acknowledgement for presentation material. Chapter 8: Distributed Systems Principles and Paradigms: Tanenbaum and Van Steen
Beyond FLP Acknowledgement for presentation material Chapter 8: Distributed Systems Principles and Paradigms: Tanenbaum and Van Steen Paper trail blog: http://the-paper-trail.org/blog/consensus-protocols-paxos/
More informationDistributed System. Gang Wu. Spring,2018
Distributed System Gang Wu Spring,2018 Lecture4:Failure& Fault-tolerant Failure is the defining difference between distributed and local programming, so you have to design distributed systems with the
More informationA (quick) retrospect. COMPSCI210 Recitation 22th Apr 2013 Vamsi Thummala
A (quick) retrospect COMPSCI210 Recitation 22th Apr 2013 Vamsi Thummala Latency Comparison L1 cache reference 0.5 ns Branch mispredict 5 ns L2 cache reference 7 ns 14x L1 cache Mutex lock/unlock 25 ns
More informationGFS. CS6450: Distributed Systems Lecture 5. Ryan Stutsman
GFS CS6450: Distributed Systems Lecture 5 Ryan Stutsman Some material taken/derived from Princeton COS-418 materials created by Michael Freedman and Kyle Jamieson at Princeton University. Licensed for
More informationConsistency and Replication
Consistency and Replication 1 D R. Y I N G W U Z H U Reasons for Replication Data are replicated to increase the reliability of a system. Replication for performance Scaling in numbers Scaling in geographical
More informationCSE 444: Database Internals. Lecture 25 Replication
CSE 444: Database Internals Lecture 25 Replication CSE 444 - Winter 2018 1 Announcements Magda s office hour tomorrow: 1:30pm Lab 6: Milestone today and due next week HW6: Due on Friday Master s students:
More informationMegastore: Providing Scalable, Highly Available Storage for Interactive Services & Spanner: Google s Globally- Distributed Database.
Megastore: Providing Scalable, Highly Available Storage for Interactive Services & Spanner: Google s Globally- Distributed Database. Presented by Kewei Li The Problem db nosql complex legacy tuning expensive
More informationPractical Byzantine Fault Tolerance. Castro and Liskov SOSP 99
Practical Byzantine Fault Tolerance Castro and Liskov SOSP 99 Why this paper? Kind of incredible that it s even possible Let alone a practical NFS implementation with it So far we ve only considered fail-stop
More information9 Replication 1. Client
August 2, 2008 9.1 Introduction 9 1 is the technique of using multiple copies of a server or a resource for better availability and performance. Each copy is called a replica. The main goal of replication
More informationReplication architecture
Replication INF 5040 autumn 2008 lecturer: Roman Vitenberg INF5040, Roman Vitenberg 1 Replication architecture Client Front end Replica Client Front end Server Replica INF5040, Roman Vitenberg 2 INF 5040
More informationConcurrency Control In Distributed Main Memory Database Systems. Justin A. DeBrabant
In Distributed Main Memory Database Systems Justin A. DeBrabant debrabant@cs.brown.edu Concurrency control Goal: maintain consistent state of data ensure query results are correct The Gold Standard: ACID
More informationByzantine Fault Tolerance
Byzantine Fault Tolerance CS6450: Distributed Systems Lecture 10 Ryan Stutsman Material taken/derived from Princeton COS-418 materials created by Michael Freedman and Kyle Jamieson at Princeton University.
More informationDon t Give Up on Serializability Just Yet. Neha Narula
Don t Give Up on Serializability Just Yet Neha Narula Don t Give Up on Serializability Just Yet A journey into serializable systems Neha Narula MIT CSAIL GOTO Chicago May 2015 2 @neha PhD candidate at
More informationInfluxDB and the Raft consensus protocol. Philip O'Toole, Director of Engineering (SF) InfluxDB San Francisco Meetup, December 2015
InfluxDB and the Raft consensus protocol Philip O'Toole, Director of Engineering (SF) InfluxDB San Francisco Meetup, December 2015 Agenda What is InfluxDB and why is it distributed? What is the problem
More informationAssignment 12: Commit Protocols and Replication
Data Modelling and Databases Exercise dates: May 24 / May 25, 2018 Ce Zhang, Gustavo Alonso Last update: June 04, 2018 Spring Semester 2018 Head TA: Ingo Müller Assignment 12: Commit Protocols and Replication
More informationYouki Kadobayashi NAIST
Information Network 1 Routing (1) Image: Part of the entire Internet topology based on CAIDA dataset, using NAIST Internet viewer Youki Kadobayashi NAIST 1 The Routing Problem How do I get from source
More informationCS 347 Parallel and Distributed Data Processing
CS 347 Parallel and Distributed Data Processing Spring 2016 Notes 5: Concurrency Control Topics Data Database design Queries Decomposition Localization Optimization Transactions Concurrency control Reliability
More informationExploiting Commutativity For Practical Fast Replication
Exploiting Commutativity For Practical Fast Replication Seo Jin Park Stanford University John Ousterhout Stanford University Abstract Traditional approaches to replication require client requests to be
More informationDistributed Commit in Asynchronous Systems
Distributed Commit in Asynchronous Systems Minsoo Ryu Department of Computer Science and Engineering 2 Distributed Commit Problem - Either everybody commits a transaction, or nobody - This means consensus!
More informationImportant Lessons. A Distributed Algorithm (2) Today's Lecture - Replication
Important Lessons Lamport & vector clocks both give a logical timestamps Total ordering vs. causal ordering Other issues in coordinating node activities Exclusive access to resources/data Choosing a single
More informationRecoverability. Kathleen Durant PhD CS3200
Recoverability Kathleen Durant PhD CS3200 1 Recovery Manager Recovery manager ensures the ACID principles of atomicity and durability Atomicity: either all actions in a transaction are done or none are
More informationDistributed Computing. CS439: Principles of Computer Systems November 19, 2018
Distributed Computing CS439: Principles of Computer Systems November 19, 2018 Bringing It All Together We ve been studying how an OS manages a single CPU system As part of that, it will communicate with
More informationExploiting Commutativity For Practical Fast Replication. Seo Jin Park and John Ousterhout
Exploiting Commutativity For Practical Fast Replication Seo Jin Park and John Ousterhout Overview Problem: replication adds latency and throughput overheads CURP: Consistent Unordered Replication Protocol
More information6.033: Fault Tolerance: Isolation Lecture 17 Katrina LaCurts,
6.033: Fault Tolerance: Isolation Lecture 17 Katrina LaCurts, lacurts@mit.edu 0. Introduction - Last time: Atomicity via logging. We're good with atomicity now. - Today: Isolation - The problem: We have
More informationDatabases. Laboratorio de sistemas distribuidos. Universidad Politécnica de Madrid (UPM)
Databases Laboratorio de sistemas distribuidos Universidad Politécnica de Madrid (UPM) http://lsd.ls.fi.upm.es/lsd/lsd.htm Nuevas tendencias en sistemas distribuidos 2 Summary Transactions. Isolation.
More informationA Better Approach to Leveraging an OpenStack Private Cloud. David Linthicum
A Better Approach to Leveraging an OpenStack Private Cloud David Linthicum A Better Approach to Leveraging an OpenStack Private Cloud 1 Executive Summary The latest bi-annual survey data of OpenStack users
More informationDynamic Reconfiguration of Primary/Backup Clusters
Dynamic Reconfiguration of Primary/Backup Clusters (Apache ZooKeeper) Alex Shraer Yahoo! Research In collaboration with: Benjamin Reed Dahlia Malkhi Flavio Junqueira Yahoo! Research Microsoft Research
More informationDistributed Transaction Management. Distributed Database System
Distributed Transaction Management Advanced Topics in Database Management (INFSCI 2711) Some materials are from Database Management Systems, Ramakrishnan and Gehrke and Database System Concepts, Siberschatz,
More informationDistributed Systems. Aleardo Manacero Jr.
Distributed Systems Aleardo Manacero Jr. Replication - part 1 Introduction Using multiple servers to attend client requests allow for a better performance in the system Unfortunately, as shown in the study
More informationTS: System Center Data Protection Manager 2007, Configuring. Version 3.1
70-658 TS: System Center Data Protection Manager 2007, Configuring Version 3.1 QUESTION NO: 1 You are a system administrator for your company. A System Center Data Protection Manager (DPM) 2007 server
More informationCS 347 Parallel and Distributed Data Processing
CS 347 Parallel and Distributed Data Processing Spring 2016 Notes 5: Concurrency Control Topics Data Database design Queries Decomposition Localization Optimization Transactions Concurrency control Reliability
More informationDistributed Systems. Day 9: Replication [Part 1]
Distributed Systems Day 9: Replication [Part 1] Hash table k 0 v 0 k 1 v 1 k 2 v 2 k 3 v 3 ll Facebook Data Does your client know about all of F s servers? Security issues? Performance issues? How do clients
More informationVerdi: A Framework for Implementing and Formally Verifying Distributed Systems
Verdi: A Framework for Implementing and Formally Verifying Distributed Systems Key-value store VST James R. Wilcox, Doug Woos, Pavel Panchekha, Zach Tatlock, Xi Wang, Michael D. Ernst, Thomas Anderson
More informationCS603: Distributed Systems
CS603: Distributed Systems Lecture 1: Basic Communication Services Cristina Nita-Rotaru Lecture 1/ Spring 2006 1 Reference Material Textbooks Ken Birman: Reliable Distributed Systems Recommended reading
More informationAgreement and Consensus. SWE 622, Spring 2017 Distributed Software Engineering
Agreement and Consensus SWE 622, Spring 2017 Distributed Software Engineering Today General agreement problems Fault tolerance limitations of 2PC 3PC Paxos + ZooKeeper 2 Midterm Recap 200 GMU SWE 622 Midterm
More informationFastTrack: An Optimized Transit Tracking System for the MBTA
FastTrack: An Optimized Transit Tracking System for the MBTA A Group of 3 MIT Students in 6.033 Contents 1 Introduction 1 2 Data Storage 2 3 Data Collection and Distribution 3 3.1 Location Data........................................
More informationImportant Project Dates
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.035, Spring 2010 Handout Project Overview Tuesday, Feb 2 This is an overview of the course project and
More informationBasic vs. Reliable Multicast
Basic vs. Reliable Multicast Basic multicast does not consider process crashes. Reliable multicast does. So far, we considered the basic versions of ordered multicasts. What about the reliable versions?
More informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK ENHANCED DATA REPLICATION TECHNIQUES FOR DISTRIBUTED DATABASES SANDIP PANDURANG
More informationSCALABLE CONSISTENCY AND TRANSACTION MODELS
Data Management in the Cloud SCALABLE CONSISTENCY AND TRANSACTION MODELS 69 Brewer s Conjecture Three properties that are desirable and expected from realworld shared-data systems C: data consistency A:
More informationBuilding Consistent Transactions with Inconsistent Replication
Building Consistent Transactions with Inconsistent Replication Irene Zhang, Naveen Kr. Sharma, Adriana Szekeres, Arvind Krishnamurthy, Dan R. K. Ports University of Washington Distributed storage systems
More informationCockroachDB on DC/OS. Ben Darnell, CTO, Cockroach Labs
CockroachDB on DC/OS Ben Darnell, CTO, Cockroach Labs Agenda A cloud-native database CockroachDB on DC/OS Why CockroachDB Demo! Cloud-Native Database What is Cloud-Native? Horizontally scalable Individual
More informationEECS 498 Introduction to Distributed Systems
EECS 498 Introduction to Distributed Systems Fall 2017 Harsha V Madhyastha Example Scenario Genome data from roughly one million users 125 MB of data per user Goal: Analyze data to identify genes that
More informationToday: Fault Tolerance. Fault Tolerance
Today: Fault Tolerance Agreement in presence of faults Two army problem Byzantine generals problem Reliable communication Distributed commit Two phase commit Three phase commit Paxos Failure recovery Checkpointing
More informationDistributed Systems. 09. State Machine Replication & Virtual Synchrony. Paul Krzyzanowski. Rutgers University. Fall Paul Krzyzanowski
Distributed Systems 09. State Machine Replication & Virtual Synchrony Paul Krzyzanowski Rutgers University Fall 2016 1 State machine replication 2 State machine replication We want high scalability and
More informationDistributed Transactions
Distributed Transactions CS6450: Distributed Systems Lecture 17 Ryan Stutsman Material taken/derived from Princeton COS-418 materials created by Michael Freedman and Kyle Jamieson at Princeton University.
More informationDECOMPOSITION, ABSTRACTION, FUNCTIONS
DECOMPOSITION, ABSTRACTION, FUNCTIONS (download slides and.py files follow along!) 6.0001 LECTURE 4 6.0001 LECTURE 4 1 LAST TIME while loops vs for loops should know how to write both kinds should know
More informationDistributed Systems 8L for Part IB
Distributed Systems 8L for Part IB Handout 3 Dr. Steven Hand 1 Distributed Mutual Exclusion In first part of course, saw need to coordinate concurrent processes / threads In particular considered how to
More informationExam 2 Review. Fall 2011
Exam 2 Review Fall 2011 Question 1 What is a drawback of the token ring election algorithm? Bad question! Token ring mutex vs. Ring election! Ring election: multiple concurrent elections message size grows
More informationCS4450. Computer Networks: Architecture and Protocols. Lecture 11 Rou+ng: Deep Dive. Spring 2018 Rachit Agarwal
CS4450 Computer Networks: Architecture and Protocols Lecture 11 Rou+ng: Deep Dive Spring 2018 Rachit Agarwal 2 Goals for Today s Lecture Learning about Routing Protocols Link State (Global view) Distance
More informationEECS 498 Introduction to Distributed Systems
EECS 498 Introduction to Distributed Systems Fall 2017 Harsha V. Madhyastha Replicated State Machines Logical clocks Primary/ Backup Paxos? 0 1 (N-1)/2 No. of tolerable failures October 11, 2017 EECS 498
More informationCSE 444: Database Internals. Lectures 26 NoSQL: Extensible Record Stores
CSE 444: Database Internals Lectures 26 NoSQL: Extensible Record Stores CSE 444 - Spring 2014 1 References Scalable SQL and NoSQL Data Stores, Rick Cattell, SIGMOD Record, December 2010 (Vol. 39, No. 4)
More informationChapter 19: Distributed Databases
Chapter 19: Distributed Databases Chapter 19: Distributed Databases Heterogeneous and Homogeneous Databases Distributed Data Storage Distributed Transactions Commit Protocols Concurrency Control in Distributed
More information