15 721
play

15-721 DATABASE SYSTEMS [Source] Lecture #03 Concurrency Control - PowerPoint PPT Presentation

Dec 14, 2022 •222 likes •1.71k views

15-721 DATABASE SYSTEMS [Source] Lecture #03 Concurrency Control Part I Andy Pavlo / / Carnegie Mellon University / / Spring 2016 2 TODAYS AGENDA Transaction Models Concurrency Control Overview Many-Core Evaluation CMU 15-721

  1. 13 TRANSACTION CHAINS Txn #1 BEGIN WRITE(A) Txn #2 COMMIT BEGIN WRITE(B) Txn #3 COMMIT BEGIN WRITE(C) ROLLBACK CMU 15-721 (Spring 2016)

  2. 13 TRANSACTION CHAINS Txn #1 BEGIN WRITE(A) Txn #2 COMMIT BEGIN WRITE(B) Txn #3 COMMIT BEGIN WRITE(C) ROLLBACK CMU 15-721 (Spring 2016)

  3. 14 NESTED TRANSACTIONS Savepoints organize a transaction as a sequence of actions that can be rolled back individually. Nested txns form a hierarchy of work. → The outcome of a child txn depends on the outcome of its parent txn. CMU 15-721 (Spring 2016)

  4. 15 NESTED TRANSACTIONS Txn #1 BEGIN WRITE(A) BEGIN BEGIN WRITE(B) BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  5. 15 NESTED TRANSACTIONS Txn #1 BEGIN WRITE(A) BEGIN BEGIN WRITE(B) BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  6. 15 NESTED TRANSACTIONS Txn #1 BEGIN WRITE(A) BEGIN BEGIN WRITE(B) BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  7. 15 NESTED TRANSACTIONS Txn #1 BEGIN WRITE(A) BEGIN BEGIN WRITE(B) BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  8. 15 NESTED TRANSACTIONS Txn #1 BEGIN WRITE(A) BEGIN BEGIN WRITE(B) BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  9. 15 NESTED TRANSACTIONS Txn #1 BEGIN WRITE(A) BEGIN BEGIN WRITE(B) BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  10. 15 NESTED TRANSACTIONS Txn #1 BEGIN Sub-Txn #1.1 WRITE(A) BEGIN BEGIN WRITE(B) BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  11. 15 NESTED TRANSACTIONS Txn #1 BEGIN Sub-Txn #1.1 WRITE(A) BEGIN BEGIN WRITE(B) BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  12. 15 NESTED TRANSACTIONS Txn #1 BEGIN Sub-Txn #1.1 WRITE(A) BEGIN BEGIN WRITE(B) BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  13. 15 NESTED TRANSACTIONS Txn #1 BEGIN Sub-Txn #1.1 WRITE(A) BEGIN BEGIN WRITE(B) BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  14. 15 NESTED TRANSACTIONS Txn #1 BEGIN Sub-Txn #1.1 WRITE(A) BEGIN BEGIN Sub-Txn #1.1.1 WRITE(B) BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  15. 15 NESTED TRANSACTIONS Txn #1 BEGIN Sub-Txn #1.1 WRITE(A) BEGIN BEGIN Sub-Txn #1.1.1 WRITE(B) BEGIN BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  16. 15 NESTED TRANSACTIONS Txn #1 BEGIN Sub-Txn #1.1 WRITE(A) BEGIN BEGIN Sub-Txn #1.1.1 WRITE(B) BEGIN BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  17. 15 NESTED TRANSACTIONS Txn #1 BEGIN Sub-Txn #1.1 WRITE(A) BEGIN BEGIN Sub-Txn #1.1.1 WRITE(B) BEGIN BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  18. 15 NESTED TRANSACTIONS Txn #1 BEGIN Sub-Txn #1.1 WRITE(A) BEGIN BEGIN Sub-Txn #1.1.1 WRITE(B) BEGIN BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  19. 15 NESTED TRANSACTIONS Txn #1 BEGIN Sub-Txn #1.1 WRITE(A) BEGIN BEGIN Sub-Txn #1.1.1 WRITE(B) BEGIN BEGIN WRITE(C) COMMIT WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  20. 15 NESTED TRANSACTIONS Txn #1 BEGIN Sub-Txn #1.1 WRITE(A) BEGIN BEGIN Sub-Txn #1.1.1 X WRITE(B) BEGIN BEGIN X WRITE(C) COMMIT X WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  21. 15 NESTED TRANSACTIONS Txn #1 BEGIN Sub-Txn #1.1 ✓ WRITE(A) BEGIN BEGIN Sub-Txn #1.1.1 X WRITE(B) BEGIN BEGIN X WRITE(C) COMMIT X WRITE(D) ROLLBACK COMMIT CMU 15-721 (Spring 2016)

  22. 16 BULK UPDATE PROBLEM These other txn models are nice, but they still do not solve our bulk update problem. Chained txns seems like the right idea but they require the application to handle failures and maintain it’s own state. → Has to be able to reverse changes when things fail. CMU 15-721 (Spring 2016)

  23. 17 COMPENSATING TRANSACTIONS A special type of txn that is designed to semantically reverse the effects of another already committed txn. Reversal has to be logical instead of physical. → Example: Decrement a counter by one instead of reverting to the original value. CMU 15-721 (Spring 2016)

  24. 18 SAGA TRANSACTIONS A sequence of chained txns T 1 ,…,T n and compensating txns C 1 ,…,C n-1 where one of the following is guaranteed: → The txns will commit in the order T1 ,…,Tn → The txns will commit in the order T 1 ,…,T j ,C j ,…,C 1 (where j < n) SAGAS SIGMOD, pp. 249-259, 2014. CMU 15-721 (Spring 2016)

  25. 19 SAGA TRANSACTIONS Txn #1 Txn #2 Txn #3 BEGIN BEGIN BEGIN WRITE(A+1) WRITE(B+1) WRITE(C+1) COMMIT COMMIT Comp Txn #1 Comp Txn #2 Comp Txn #3 BEGIN BEGIN BEGIN WRITE(A-1) WRITE(B-1) WRITE(C-1) COMMIT COMMIT COMMIT CMU 15-721 (Spring 2016)

  26. 19 SAGA TRANSACTIONS Txn #1 Txn #2 Txn #3 BEGIN BEGIN BEGIN WRITE(A+1) WRITE(B+1) WRITE(C+1) COMMIT COMMIT Comp Txn #1 Comp Txn #2 Comp Txn #3 BEGIN BEGIN BEGIN WRITE(A-1) WRITE(B-1) WRITE(C-1) COMMIT COMMIT COMMIT CMU 15-721 (Spring 2016)

  27. 19 SAGA TRANSACTIONS Txn #1 Txn #2 Txn #3 BEGIN BEGIN BEGIN WRITE(A+1) WRITE(B+1) WRITE(C+1) COMMIT COMMIT Comp Txn #1 Comp Txn #2 Comp Txn #3 BEGIN BEGIN BEGIN WRITE(A-1) WRITE(B-1) WRITE(C-1) COMMIT COMMIT COMMIT CMU 15-721 (Spring 2016)

  28. 19 SAGA TRANSACTIONS Txn #1 Txn #2 Txn #3 BEGIN BEGIN BEGIN WRITE(A+1) WRITE(B+1) WRITE(C+1) COMMIT COMMIT Comp Txn #1 Comp Txn #2 Comp Txn #3 BEGIN BEGIN BEGIN WRITE(A-1) WRITE(B-1) WRITE(C-1) COMMIT COMMIT COMMIT CMU 15-721 (Spring 2016)

  29. 19 SAGA TRANSACTIONS Txn #1 Txn #2 Txn #3 BEGIN BEGIN BEGIN WRITE(A+1) WRITE(B+1) WRITE(C+1) COMMIT COMMIT Comp Txn #1 Comp Txn #2 Comp Txn #3 BEGIN BEGIN BEGIN WRITE(A-1) WRITE(B-1) WRITE(C-1) COMMIT COMMIT COMMIT CMU 15-721 (Spring 2016)

  30. 19 SAGA TRANSACTIONS Txn #1 Txn #2 Txn #3 BEGIN BEGIN BEGIN WRITE(A+1) WRITE(B+1) WRITE(C+1) COMMIT COMMIT Comp Txn #1 Comp Txn #2 Comp Txn #3 BEGIN BEGIN BEGIN WRITE(A-1) WRITE(B-1) WRITE(C-1) COMMIT COMMIT COMMIT CMU 15-721 (Spring 2016)

  31. 19 SAGA TRANSACTIONS Txn #1 Txn #2 Txn #3 BEGIN BEGIN BEGIN WRITE(A+1) WRITE(B+1) WRITE(C+1) COMMIT COMMIT Comp Txn #1 Comp Txn #2 Comp Txn #3 BEGIN BEGIN BEGIN WRITE(A-1) WRITE(B-1) WRITE(C-1) COMMIT COMMIT COMMIT CMU 15-721 (Spring 2016)

  32. 20 CONCURRENCY CONTROL The protocol to allow txns to access a database in a multi-programmed fashion while preserving the illusion that each of them is executing alone on a dedicated system. → The goal is to have the effect of a group of txns on the database’s state is equivalent to any serial execution of all txns. Provides A tomicity + I solation in ACID CMU 15-721 (Spring 2016)

  33. 21 TXN INTERNAL STATE Undo Log Entries → Stored in an in-memory data structure. → Dropped on commit. Redo Log Entries → Append to the in-memory tail of WAL. → Flushed to disk on commit. Read/Write Set → Depends on the concurrency control scheme. CMU 15-721 (Spring 2016)

  34. 22 CONCURRENCY CONTROL SCHEMES Two-Phase Locking (2PL) → Assume txns will conflict so they must acquire locks on elements before they are allowed to access them. Timestamp Ordering (T/O) → Assume that conflicts are rare so txns do not need to acquire locks and instead check for conflicts at commit time. CMU 15-721 (Spring 2016)

  35. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) READ(A) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) CMU 15-721 (Spring 2016)

  36. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) CMU 15-721 (Spring 2016)

  37. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) CMU 15-721 (Spring 2016)

  38. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) Growing Phase CMU 15-721 (Spring 2016)

  39. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) Growing Phase Shrinking Phase CMU 15-721 (Spring 2016)

  40. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) CMU 15-721 (Spring 2016)

  41. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) Txn #2 COMMIT BEGIN LOCK(B) WRITE(B) LOCK(A) WRITE(A) UNLOCK(A) UNLOCK(B) CMU 15-721 (Spring 2016)

  42. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) Txn #2 COMMIT BEGIN LOCK(B) WRITE(B) LOCK(A) WRITE(A) UNLOCK(A) UNLOCK(B) CMU 15-721 (Spring 2016)

  43. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) Txn #2 COMMIT BEGIN LOCK(B) WRITE(B) LOCK(A) WRITE(A) UNLOCK(A) UNLOCK(B) CMU 15-721 (Spring 2016)

  44. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) Txn #2 COMMIT BEGIN LOCK(B) WRITE(B) LOCK(A) WRITE(A) UNLOCK(A) UNLOCK(B) CMU 15-721 (Spring 2016)

  45. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) Txn #2 COMMIT BEGIN LOCK(B) WRITE(B) LOCK(A) WRITE(A) UNLOCK(A) UNLOCK(B) CMU 15-721 (Spring 2016)

  46. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) Txn #2 COMMIT BEGIN LOCK(B) WRITE(B) LOCK(A) WRITE(A) UNLOCK(A) UNLOCK(B) CMU 15-721 (Spring 2016)

  47. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) Txn #2 COMMIT BEGIN LOCK(B) WRITE(B) LOCK(A) WRITE(A) UNLOCK(A) UNLOCK(B) CMU 15-721 (Spring 2016)

  48. 23 TWO-PHASE LOCKING Txn #1 COMMIT BEGIN LOCK(A ) LOCK(A) READ(A) LOCK(B) LOCK(B) WRITE(B) UNLOCK(A) UNLOCK(B) Txn #2 COMMIT BEGIN LOCK(B) WRITE(B) LOCK(A) WRITE(A) UNLOCK(A) UNLOCK(B) CMU 15-721 (Spring 2016)

  49. 24 TWO-PHASE LOCKING Deadlock Detection → Each txn maintains a queue of the txns that hold the locks that it waiting for. → A separate thread checks these queues for deadlocks. → If deadlock found, use a heuristic to decide what txn to kill in order to break deadlock. Deadlock Prevention → Check whether another txn already holds a lock when another txn requests it. → If lock is not available, the txn will either (1) wait, (2) commit suicide, or (3) kill the other txn. CMU 15-721 (Spring 2016)

  50. • • • • • • • 25 TIMESTAMP ORDERING Txn #1 COMMIT BEGIN READ(A) WRITE(B) WRITE(A) CMU 15-721 (Spring 2016)

  51. • • • • • • • 25 TIMESTAMP ORDERING Txn #1 COMMIT BEGIN READ(A) WRITE(B) WRITE(A) CMU 15-721 (Spring 2016)

  52. • • • • • • • 25 TIMESTAMP ORDERING 10001 Txn #1 COMMIT BEGIN READ(A) WRITE(B) WRITE(A) CMU 15-721 (Spring 2016)

  53. • • • • • • • 25 TIMESTAMP ORDERING 10001 Txn #1 COMMIT BEGIN READ(A) WRITE(B) WRITE(A) Read Write Record Timestamp Timestamp A 10000 10000 B 10000 10000 CMU 15-721 (Spring 2016)

  54. • • • • • • • 25 TIMESTAMP ORDERING 10001 Txn #1 COMMIT BEGIN READ(A) WRITE(B) WRITE(A) Read Write Record Timestamp Timestamp A 10000 10000 B 10000 10000 CMU 15-721 (Spring 2016)

  55. • • • • • • • 25 TIMESTAMP ORDERING 10001 Txn #1 COMMIT BEGIN READ(A) WRITE(B) WRITE(A) Read Write Record Timestamp Timestamp A 10001 10000 B 10000 10000 CMU 15-721 (Spring 2016)

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

ADVANCED DATABASE SYSTEMS Transaction Models &amp; Concurrency Control @ Andy_Pavlo // 15-

ADVANCED DATABASE SYSTEMS Transaction Models &amp; Concurrency Control @ Andy_Pavlo // 15-

Lect ure # 02 ADVANCED DATABASE SYSTEMS Transaction Models &amp; Concurrency Control @ Andy_Pavlo // 15- 721 // Spring 2019 CMU 15-721 (Spring 2019) 2 Background Transaction Models Concurrency Control Protocols Isolation Levels CMU

1.49k views • 138 slides
Graphical Interface Object Oriented Programming Marco Chiarandini Department of Mathematics

Graphical Interface Object Oriented Programming Marco Chiarandini Department of Mathematics

DM560 Introduction to Programming in C++ Graphical Interface Object Oriented Programming Marco Chiarandini Department of Mathematics &amp; Computer Science University of Southern Denmark [ Based on slides by Bjarne Stroustrup ] Outline 1. A

1.1k views • 86 slides
We Weakly-supe supervise sed d Vid Video eo Rec ecogn gnitio ition Pa Pascal Mettes

We Weakly-supe supervise sed d Vid Video eo Rec ecogn gnitio ition Pa Pascal Mettes

We Weakly-supe supervise sed d Vid Video eo Rec ecogn gnitio ition Pa Pascal Mettes University of Amsterdam Video recognition pipeline Learn video labels from spatio-temporal inputs. Do Double scale challenge: : Order(s) of

644 views • 39 slides
Exact Collision Detection Recent Developments and Applications Dan Halperin danha@tau.ac.il Tel

Exact Collision Detection Recent Developments and Applications Dan Halperin danha@tau.ac.il Tel

Exact Collision Detection Recent Developments and Applications Dan Halperin danha@tau.ac.il Tel Aviv University MOVIE, Toulouse 2005 Exact Collision Detection 1 Outline background, motivation, earlier results multi-axis NC machining exact

411 views • 30 slides
Transactions Concurrent execution of user programs is essential for good DBMS performance.

Transactions Concurrent execution of user programs is essential for good DBMS performance.

Transactions Concurrent execution of user programs is essential for good DBMS performance. Transaction Management Overview Because disk accesses are frequent, and relatively slow, it is important to keep the cpu humming by working on

364 views • 3 slides
Bitcoin CS 161: Computer Security Prof. Raluca Ada Poipa April 24, 2018 What is Bitcoin?

Bitcoin CS 161: Computer Security Prof. Raluca Ada Poipa April 24, 2018 What is Bitcoin?

Bitcoin CS 161: Computer Security Prof. Raluca Ada Poipa April 24, 2018 What is Bitcoin? Bitcoin is a cryptocurrency: a digital currency whose rules are enforced by cryptography and not by a trusted party (e.g., bank) Core ideal: avoid

1.02k views • 36 slides
Comp115: Databases Transactional Management Overview Instructor: Manos Athanassoulis Comp115

Comp115: Databases Transactional Management Overview Instructor: Manos Athanassoulis Comp115

Comp115 [Spring 2017] - http://www.cs.tufts.edu/comp/115/ - Manos Athanassoulis Comp115: Databases Transactional Management Overview Instructor: Manos Athanassoulis Comp115 [Spring 2017] - http://www.cs.tufts.edu/comp/115/ - Manos Athanassoulis

534 views • 25 slides
Transaction Management Ramakrishnan &amp; Gehrke, Chapter 14+ 320302 Databases &amp; Web Services

Transaction Management Ramakrishnan &amp; Gehrke, Chapter 14+ 320302 Databases &amp; Web Services

Transaction Management Ramakrishnan &amp; Gehrke, Chapter 14+ 320302 Databases &amp; Web Services (P. Baumann) Transactions Concurrent execution of user requests is essential for good DBMS performance User requests arrive concurrently

646 views • 19 slides
Blockchain for Cyberphysical Systems Salil Kanhere School of Computer Science and Engineering

Blockchain for Cyberphysical Systems Salil Kanhere School of Computer Science and Engineering

Blockchain for Cyberphysical Systems Salil Kanhere School of Computer Science and Engineering UNSW Sydney Australia E: salil.kanhere@unsw.edu.au W: www.salilkanhere.net Acknowledgements UNSW : Ali Dorri, Sidra Malik, Chuka Oham, Pooja Gupta,

1.55k views • 83 slides
Database Management Course Content Systems Introduction Database Design Theory

Database Management Course Content Systems Introduction Database Design Theory

Database Management Course Content Systems Introduction Database Design Theory Query Processing and Optimisation Winter 2003 Concurrency Control Data Base Recovery and Security CMPUT 391: Transactions &amp; Concurrency

729 views • 15 slides
Block ckch chain in the Limelight Leila Bahri Researcher lbahri@kth.se Oct. 15, 2019, Castor

Block ckch chain in the Limelight Leila Bahri Researcher lbahri@kth.se Oct. 15, 2019, Castor

Block ckch chain in the Limelight Leila Bahri Researcher lbahri@kth.se Oct. 15, 2019, Castor Days Stockholm Bl Blockchain, , an early-st stage te technology that at enables the de decentralized, , se secure storage and tr tran

1.07k views • 21 slides
ASSURED CYBER SUPPLY CHAIN PROVENANCE USING PERMISSIONED BLOCKCHAIN Andrew Miller Sachin Shetty

ASSURED CYBER SUPPLY CHAIN PROVENANCE USING PERMISSIONED BLOCKCHAIN Andrew Miller Sachin Shetty

ASSURED CYBER SUPPLY CHAIN PROVENANCE USING PERMISSIONED BLOCKCHAIN Andrew Miller Sachin Shetty and Xueping Liang University of Illinois Urbana-Champaign Old Dominion University Funded by the U.S. Department of Energy and the U.S. Department

608 views • 17 slides
Alternatives to Blockchains Sarah Meiklejohn (University College London) fully decentralized

Alternatives to Blockchains Sarah Meiklejohn (University College London) fully decentralized

Alternatives to Blockchains Sarah Meiklejohn (University College London) fully decentralized cryptocurrencies 2 fully decentralized cryptocurrencies tx tx(addr A addr B ) 2 fully decentralized cryptocurrencies tx mining tx(addr A

1.51k views • 100 slides
CS 10: Problem solving via Object Oriented Programming Streams Agenda 1. Streaming data 2.

CS 10: Problem solving via Object Oriented Programming Streams Agenda 1. Streaming data 2.

CS 10: Problem solving via Object Oriented Programming Streams Agenda 1. Streaming data 2. Java streams 2 Streams allow us to process things as they come Stream movie vs. file Stream (Netflix) File (Movie on DVD) Data production

424 views • 30 slides
Object Sharing Service John Mehnert-Spahn, Marc-Florian Mller, Kim-Thomas Mller, Michael

Object Sharing Service John Mehnert-Spahn, Marc-Florian Mller, Kim-Thomas Mller, Michael

Object Sharing Service John Mehnert-Spahn, Marc-Florian Mller, Kim-Thomas Mller, Michael Schttner XtreemOS IP project 1 is funded by the European Commission under contract IST-FP6-033576 XtreemOS IP project 1/34 is funded by the

923 views • 33 slides
Blockchain Tech UNSW COMP9243 18s1 Michael Sproul Warning Blockchain is all the rage, but

Blockchain Tech UNSW COMP9243 18s1 Michael Sproul Warning Blockchain is all the rage, but

Blockchain Tech UNSW COMP9243 18s1 Michael Sproul Warning Blockchain is all the rage, but Its very easy to lose money (volatility, scams) The technology is still immature You may become obsessed ;) Overview Bitcoin

853 views • 57 slides
Understanding Blockchain Technology Teach-In &amp; Introduction Tony Willenberg,

Understanding Blockchain Technology Teach-In &amp; Introduction Tony Willenberg,

Making finance serve society Understanding Blockchain Technology Teach-In &amp; Introduction Tony Willenberg, Co-founder/CTO, Neocapita Finance Watch, FinTech Workshop #1 tony.willenberg@neoapita.com Leopold Hotel, Rue du Luxembourg 35, 1050

986 views • 54 slides
Software Development Methodologies Lecturer: Raman Ramsin Lecture 7 Integrated Object-Oriented

Software Development Methodologies Lecturer: Raman Ramsin Lecture 7 Integrated Object-Oriented

Software Development Methodologies Lecturer: Raman Ramsin Lecture 7 Integrated Object-Oriented Methodologies: OPEN and FOOM OPEN and FOOM Sharif University of Technology Department of Computer Engineering 1 Software Development

610 views • 35 slides
Blockchain Tech UNSW COMP9243 18s1 Michael Sproul Warning Blockchain is all the rage, but

Blockchain Tech UNSW COMP9243 18s1 Michael Sproul Warning Blockchain is all the rage, but

Blockchain Tech UNSW COMP9243 18s1 Michael Sproul Warning Blockchain is all the rage, but Its very easy to lose money (volatility, scams) The technology is still immature You may become obsessed ;) Overview Bitcoin

1.03k views • 56 slides
sled and rio Rust DB + io_uring = @sadisticsystems sled.rs who am I building Rust databases

sled and rio Rust DB + io_uring = @sadisticsystems sled.rs who am I building Rust databases

sled and rio Rust DB + io_uring = @sadisticsystems sled.rs who am I building Rust databases since 2014 previously worked at some social media &amp; infrastructure companies for fun, I build and destroy distributed databases

1.58k views • 52 slides
LongRunningTransactionsinServiceOriented Environments infm3::SR

LongRunningTransactionsinServiceOriented Environments infm3::SR

LongRunningTransactionsinServiceOriented Environments infm3::SR MartinGerlach martin.gerlach@informatik.hawhamburg.de 16.12.2005 Needforconsistencyofbusinesscriticaldata

735 views • 49 slides
Applications and network performance Network Operations glen.turner@aarnet.edu.au How long?

Applications and network performance Network Operations glen.turner@aarnet.edu.au How long?

Applications and network performance Network Operations glen.turner@aarnet.edu.au How long? 600ms 2 TCP basics Slow start Congestion avoidance 3 Inter-flow fairness Connections don't share bandwidth evenly The size of

730 views • 26 slides
Validation in Optimistic Concurrency Control ACM SIGMOD 2015 Programming Contest Alexey Karyakin

Validation in Optimistic Concurrency Control ACM SIGMOD 2015 Programming Contest Alexey Karyakin

Validation in Optimistic Concurrency Control ACM SIGMOD 2015 Programming Contest Alexey Karyakin (Crisis) David R. Cheriton School of Computer Science University of Waterloo The Problem Alexey Karyakin 2 06/02/15 Database and Query

468 views • 16 slides
This course is important for... End users of DBS DB application programmers Database

This course is important for... End users of DBS DB application programmers Database

D ATABASE S YSTEMS I W EEK 1: I NTRODUCTION Tuesday 2 S YLLABUS Class Time and Location: Tue 14:30-16:20 AQ3005 Thu 14:30-15:20 AQ3003 Course Website: http://www.cs.sfu.ca/CC/354/rfrank/ Instructor: Richard Frank, PhD

285 views • 17 slides

More recommend