adm in istrivia
play

ADM IN ISTRIVIA Project #1 is due Fri Sept 27 th @ 11:59pm Homework - PowerPoint PPT Presentation

Jul 31, 2023 •135 likes •1.33k views

09 Index Concurrency Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science Carnegie Mellon University Fall 2019 2 ADM IN ISTRIVIA Project #1 is due Fri Sept 27 th @ 11:59pm Homework #2 is due Mon Sept 30 th @ 11:59pm

  1. 17 B+ TREE M ULTI- TH READED EXAM PLE T 1 : Delete 44 A 20 T 2 : Find 41 10 35 B C D 6 12 23 31 38 44 Rebalance! 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  2. 17 B+ TREE M ULTI- TH READED EXAM PLE T 1 : Delete 44 A 20 T 2 : Find 41 10 35 B C D 6 12 23 31 38 44 Rebalance! 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  3. 17 B+ TREE M ULTI- TH READED EXAM PLE T 1 : Delete 44 A 20 T 2 : Find 41 10 35 B C D 6 12 23 31 38 44 Rebalance! 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  4. 17 B+ TREE M ULTI- TH READED EXAM PLE T 1 : Delete 44 A 20 T 2 : Find 41 10 35 B C D 6 12 23 31 38 44 41 Rebalance! 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  5. 17 B+ TREE M ULTI- TH READED EXAM PLE T 1 : Delete 44 A 20 T 2 : Find 41 10 35 B C D 6 12 23 31 38 44 41 Rebalance! 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I ??? CMU 15-445/645 (Fall 2019)

  6. 18 LATCH CRABBIN G/ CO UPLIN G Protocol to allow multiple threads to access/modify B+Tree at the same time. Basic Idea: → Get latch for parent. → Get latch for child → Release latch for parent if “safe”. A safe node is one that will not split or merge when updated. → Not full (on insertion) → More than half-full (on deletion) CMU 15-445/645 (Fall 2019)

  7. 19 LATCH CRABBIN G/ CO UPLIN G Find : Start at root and go down; repeatedly, → Acquire R latch on child → Then unlatch parent Insert/Delete : Start at root and go down, obtaining W latches as needed. Once child is latched, check if it is safe: → If child is safe, release all latches on ancestors. CMU 15-445/645 (Fall 2019)

  8. 20 EXAM PLE # 1 FIN D 38 R A 20 10 35 B C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  9. 20 EXAM PLE # 1 FIN D 38 R A 20 R 10 35 B It’s safe to release the latch on A. C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  10. 20 EXAM PLE # 1 FIN D 38 A 20 R 10 35 B C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  11. 20 EXAM PLE # 1 FIN D 38 A 20 10 35 B R C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  12. 20 EXAM PLE # 1 FIN D 38 A 20 10 35 B C D 6 12 23 38 44 R 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  13. 20 EXAM PLE # 1 FIN D 38 A 20 10 35 B C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  14. 21 EXAM PLE # 2 DELETE 38 W A 20 10 35 B C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  15. 21 EXAM PLE # 2 DELETE 38 W A 20 W 10 35 B We may need to coalesce B, so we can’t release the latch on A. C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  16. 21 EXAM PLE # 2 DELETE 38 W A 20 W 10 35 B W C D 6 12 23 38 44 We know that D will not need to merge with C, so it’s safe to 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 release latches on A and B. E F G H I CMU 15-445/645 (Fall 2019)

  17. 21 EXAM PLE # 2 DELETE 38 A 20 10 35 B W C D 6 12 23 38 44 We know that D will not need to merge with C, so it’s safe to 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 release latches on A and B. E F G H I CMU 15-445/645 (Fall 2019)

  18. 21 EXAM PLE # 2 DELETE 38 A 20 10 35 B C D 6 12 23 38 44 W 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  19. 21 EXAM PLE # 2 DELETE 38 A 20 10 35 B C D 6 12 23 38 44 W 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  20. 22 EXAM PLE # 3 IN SERT 4 5 A 20 10 35 B C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 45 E F G H I CMU 15-445/645 (Fall 2019)

  21. 22 EXAM PLE # 3 IN SERT 4 5 W A 20 W 10 35 B We know that if D needs to split, B has room so it’s safe to release the latch on A. C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 45 E F G H I CMU 15-445/645 (Fall 2019)

  22. 22 EXAM PLE # 3 IN SERT 4 5 A 20 W 10 35 B W C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 45 E F G H I CMU 15-445/645 (Fall 2019)

  23. 22 EXAM PLE # 3 IN SERT 4 5 A 20 W 10 35 B W C D 6 12 23 38 44 W 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 45 Node I won’t split, so we E F G H I can release B+D. CMU 15-445/645 (Fall 2019)

  24. 22 EXAM PLE # 3 IN SERT 4 5 A 20 10 35 B C D 6 12 23 38 44 W 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 45 Node I won’t split, so we E F G H I can release B+D. CMU 15-445/645 (Fall 2019)

  25. 23 EXAM PLE # 4 IN SERT 25 W A 20 W 10 35 B C D 6 12 23 31 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  26. 23 EXAM PLE # 4 IN SERT 25 A 20 W 10 35 B C D 6 12 23 31 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  27. 23 EXAM PLE # 4 IN SERT 25 A 20 W 10 35 B W C D 6 12 23 31 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  28. 23 EXAM PLE # 4 IN SERT 25 A 20 10 35 B W C D 6 12 23 31 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  29. 23 EXAM PLE # 4 IN SERT 25 A 20 10 35 B W C D 6 12 23 31 38 44 W 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 We need to split F so we need to E F G H I hold the latch on its parent node. CMU 15-445/645 (Fall 2019)

  30. 23 EXAM PLE # 4 IN SERT 25 A 20 10 35 B W C D 6 12 23 31 38 44 W 3 4 6 9 10 11 12 13 20 22 23 31 25 35 36 38 41 44 We need to split F so we need to E F G H I hold the latch on its parent node. CMU 15-445/645 (Fall 2019)

  31. 23 EXAM PLE # 4 IN SERT 25 A 20 10 35 B W C D 6 12 23 31 38 44 W 3 4 6 9 10 11 12 13 20 22 23 31 25 35 36 38 41 44 We need to split F so we need to E F G H I hold the latch on its parent node. 31 CMU 15-445/645 (Fall 2019)

  32. 24 O BSERVATIO N What was the first step that all the update examples did on the B+Tree? Delete 38 Insert 45 Insert 25 W W W A A A 20 20 20 CMU 15-445/645 (Fall 2019)

  33. 25 O BSERVATIO N What was the first step that all the update examples did on the B+Tree? Taking a write latch on the root every time becomes a bottleneck with higher concurrency. Can we do better? CMU 15-445/645 (Fall 2019)

  34. 26 BETTER LATCH IN G ALGO RITH M Assume that the leaf node is safe. Use read latches and crabbing to reach it, and then verify that it is safe. If leaf is not safe, then do previous algorithm using write latches. CMU 15-445/645 (Fall 2019)

  35. 27 EXAM PLE # 2 DELETE 38 R A 20 10 35 B C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  36. 27 EXAM PLE # 2 DELETE 38 A 20 R 10 35 B C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  37. 27 EXAM PLE # 2 DELETE 38 A 20 10 35 B R C D 6 12 23 38 44 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  38. 27 EXAM PLE # 2 DELETE 38 A 20 10 35 B R C D 6 12 23 38 44 W 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I CMU 15-445/645 (Fall 2019)

  39. 27 EXAM PLE # 2 DELETE 38 A 20 10 35 B C D 6 12 23 38 44 W 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I H will not need to coalesce, so we’re safe! CMU 15-445/645 (Fall 2019)

  40. 27 EXAM PLE # 2 DELETE 38 A 20 10 35 B C D 6 12 23 38 44 W 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 E F G H I H will not need to coalesce, so we’re safe! CMU 15-445/645 (Fall 2019)

  41. 28 EXAM PLE # 4 IN SERT 25 A 20 10 35 B C D 6 12 23 38 44 W 3 4 6 9 10 11 12 13 20 22 23 31 35 36 38 41 44 We need to split F so we have to restart and re- E F G H I execute like before. CMU 15-445/645 (Fall 2019)

  42. 29 BETTER LATCH IN G ALGO RITH M Search : Same as before. Insert/Delete : → Set latches as if for search, get to leaf, and set W latch on leaf. → If leaf is not safe, release all latches, and restart thread using previous insert/delete protocol with write latches. This approach optimistically assumes that only leaf node will be modified; if not, R latches set on the first pass to leaf are wasteful. CMU 15-445/645 (Fall 2019)

  43. 30 O BSERVATIO N The threads in all the examples so far have acquired latches in a "top-down" manner. → A thread can only acquire a latch from a node that is below its current node. → If the desired latch is unavailable, the thread must wait until it becomes available. But what if we want to move from one leaf node to another leaf node? CMU 15-445/645 (Fall 2019)

  44. 31 LEAF N O DE SCAN EXAM PLE # 1 T 1 : Find Keys < 4 R 3 A 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  45. 31 LEAF N O DE SCAN EXAM PLE # 1 T 1 : Find Keys < 4 3 A R 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  46. 31 LEAF N O DE SCAN EXAM PLE # 1 T 1 : Find Keys < 4 Do not release latch on C 3 A until thread has latch on B R 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  47. 31 LEAF N O DE SCAN EXAM PLE # 1 T 1 : Find Keys < 4 Do not release latch on C 3 A until thread has latch on B R R 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  48. 31 LEAF N O DE SCAN EXAM PLE # 1 T 1 : Find Keys < 4 3 A R 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  49. 32 LEAF N O DE SCAN EXAM PLE # 2 T 1 : Find Keys < 4 T 2 : Find Keys > 1 3 A 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  50. 32 LEAF N O DE SCAN EXAM PLE # 2 T 1 : Find Keys < 4 R T 2 : Find Keys > 1 3 A 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  51. 32 LEAF N O DE SCAN EXAM PLE # 2 T 1 : Find Keys < 4 R T 2 : Find Keys > 1 3 A R R 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  52. 32 LEAF N O DE SCAN EXAM PLE # 2 T 1 : Find Keys < 4 T 2 : Find Keys > 1 3 A R R 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  53. 32 LEAF N O DE SCAN EXAM PLE # 2 T 1 : Find Keys < 4 T 2 : Find Keys > 1 Both T 1 and T 2 now hold Both T 1 and T 2 now hold 3 A this read latch. this read latch. R R 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  54. 32 LEAF N O DE SCAN EXAM PLE # 2 T 1 : Find Keys < 4 T 2 : Find Keys > 1 Only T 1 holds Only T 2 holds 3 A this read latch. this read latch. R R 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  55. 33 LEAF N O DE SCAN EXAM PLE # 3 T 1 : Delete 4 T 2 : Find Keys > 1 R 3 A 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  56. 33 LEAF N O DE SCAN EXAM PLE # 3 T 1 : Delete 4 T 2 : Find Keys > 1 3 A R W 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  57. 33 LEAF N O DE SCAN EXAM PLE # 3 T 1 : Delete 4 T 2 : Find Keys > 1 3 A T 2 cannot acquire the read latch on C R W 1 2 3 4 B C CMU 15-445/645 (Fall 2019)

  58. 33 LEAF N O DE SCAN EXAM PLE # 3 T 1 : Delete 4 T 2 : Find Keys > 1 3 A T 2 cannot acquire the read latch on C R W 1 2 3 4 B C T 2 does not know what T 1 is doing… CMU 15-445/645 (Fall 2019)

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

Lect ure # 24 ADVANCED DATABASE SYSTEMS Databases on New Hardware @ Andy_Pavlo // 15- 721 //

Lect ure # 24 ADVANCED DATABASE SYSTEMS Databases on New Hardware @ Andy_Pavlo // 15- 721 //

Lect ure # 24 ADVANCED DATABASE SYSTEMS Databases on New Hardware @ Andy_Pavlo // 15- 721 // Spring 2018 2 ADM IN ISTRIVIA Snowflake Guest: May 2 th @ 3:00pm Final Exam Handout: May 2 nd Code Review #2: May 2 nd @ 11:59pm We will use the

1.01k views • 73 slides
12 Part I Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

12 Part I Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

Query Execution 12 Part I Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science Carnegie Mellon University Fall 2019 2 ADM IN ISTRIVIA Homework #3 is due Wed Oct 9 th @ 11:59pm Mid-Term Exam is Wed Oct 16th @ 12:00pm

891 views • 56 slides
10 Aggregations Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

10 Aggregations Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

Sorting &amp; 10 Aggregations Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science Carnegie Mellon University Fall 2020 2 ADM IN ISTRIVIA Homework #3 is due Sunday Oct 18 th Mid-Term Exam is Wed Oct 21 st

516 views • 35 slides
Join Algorithms Lecture # 12 Database Systems Andy Pavlo AP AP Computer Science

Join Algorithms Lecture # 12 Database Systems Andy Pavlo AP AP Computer Science

Join Algorithms Lecture # 12 Database Systems Andy Pavlo AP AP Computer Science 15-445/15-645 Carnegie Mellon Univ. Fall 2018 2 ADM IN ISTRIVIA Project #2 Checkpoint #1 is due TODAY No class on Wednesday October 10th Mid-term Exam is

1k views • 71 slides
Query Processing Lecture # 10 Database Systems Andy Pavlo AP AP Computer Science

Query Processing Lecture # 10 Database Systems Andy Pavlo AP AP Computer Science

Query Processing Lecture # 10 Database Systems Andy Pavlo AP AP Computer Science 15-445/15-645 Carnegie Mellon Univ. Fall 2018 2 ADM IN ISTRIVIA Project #2 Checkpoint #1 is due Monday October 9 th @ 11:59pm Mid-term Exam is on

976 views • 52 slides
24 Databases Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

24 Databases Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

Distributed OLAP 24 Databases Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science Carnegie Mellon University Fall 2019 2 ADM IN ISTRIVIA Homework #5 : Monday Dec 3 rd @ 11:59pm Project #4 : Monday Dec 10 th @

887 views • 61 slides
20 Schemes Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

20 Schemes Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

Logging 20 Schemes Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science Carnegie Mellon University Fall 2019 2 ADM IN ISTRIVIA Homework #4 is due Wed Nov 13th @ 11:59pm. Project #3 is due Sun Nov 17th @ 11:59pm.

827 views • 47 slides
22 Introduction to Distributed Databases Intro to Database Systems Andy Pavlo AP AP

22 Introduction to Distributed Databases Intro to Database Systems Andy Pavlo AP AP

22 Introduction to Distributed Databases Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science Carnegie Mellon University Fall 2019 2 ADM IN ISTRIVIA Homework #5 : Monday Dec 3 rd @ 11:59pm Project #4 : Monday Dec 10

756 views • 37 slides
07 Part I Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

07 Part I Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

Tree Indexes 07 Part I Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science Carnegie Mellon University Fall 2020 2 ADM IN ISTRIVIA Project #1 is due Sunday Sept 27 th Homework #2 is due Sunday Oct 4 th 15-445/645

633 views • 45 slides
17 Locking Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

17 Locking Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

Two-Phase 17 Locking Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science Carnegie Mellon University Fall 2020 2 ADM IN ISTRIVIA Project #3 is due Sun Nov 22 nd @ 11:59pm. Homework #4 is due Sun Nov 8 th @ 11:59pm.

1.07k views • 79 slides
Distributed OLTP Databases (Part I) Lecture # 22 Andy Pavlo Database Systems AP AP Computer

Distributed OLTP Databases (Part I) Lecture # 22 Andy Pavlo Database Systems AP AP Computer

Distributed OLTP Databases (Part I) Lecture # 22 Andy Pavlo Database Systems AP AP Computer Science 15-445/15-645 Carnegie Mellon Univ. Fall 2018 2 ADM IN ISTRIVIA Project #3 : TODAY @ 11:59am Homework #5 : Monday Dec 3 rd @ 11:59pm

1.66k views • 92 slides
Concurrency Control Lecture # 19 Database Systems Andy Pavlo AP AP Computer Science

Concurrency Control Lecture # 19 Database Systems Andy Pavlo AP AP Computer Science

Multi-Version Concurrency Control Lecture # 19 Database Systems Andy Pavlo AP AP Computer Science 15-445/15-645 Carnegie Mellon Univ. Fall 2018 2 ADM IN ISTRIVIA Homework #4 : Monday Nov 12 th @ 11:59pm Project #3 : Monday Nov 19 th @

1.3k views • 66 slides
Concurrency Control Lecture # 18 Database Systems Andy Pavlo AP AP Computer Science

Concurrency Control Lecture # 18 Database Systems Andy Pavlo AP AP Computer Science

Timestamp Ordering Concurrency Control Lecture # 18 Database Systems Andy Pavlo AP AP Computer Science 15-445/15-645 Carnegie Mellon Univ. Fall 2018 2 ADM IN ISTRIVIA Homework #4 : Monday Nov 12 th @ 11:59pm Project #3 : Monday Nov 19 th

1.24k views • 95 slides
Database Storage Part I Lecture # 03 Database Systems Andy Pavlo AP AP Computer Science

Database Storage Part I Lecture # 03 Database Systems Andy Pavlo AP AP Computer Science

Database Storage Part I Lecture # 03 Database Systems Andy Pavlo AP AP Computer Science 15-445/15-645 Carnegie Mellon Univ. Fall 2018 2 ADM IN ISTRIVIA Homework #1 is due Monday September 10 th @ 11:59pm Project #1 will be released on

852 views • 63 slides
ADVANCED DATABASE SYSTEMS Databases on New Hardware @ Andy_Pavlo // 15- 721 // Spring 2020 2

ADVANCED DATABASE SYSTEMS Databases on New Hardware @ Andy_Pavlo // 15- 721 // Spring 2020 2

Lect ure # 25 ADVANCED DATABASE SYSTEMS Databases on New Hardware @ Andy_Pavlo // 15- 721 // Spring 2020 2 ADM IN ISTRIVIA April 29: Guest Speaker (Live) May 4: Code Review #2 Submission May 5: Final Presentations (Live) May 13: Final Exam

994 views • 72 slides
16 Control Theory Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

16 Control Theory Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science

Concurrency 16 Control Theory Intro to Database Systems Andy Pavlo AP AP 15-445/15-645 Computer Science Carnegie Mellon University Fall 2020 2 ADM IN ISTRIVIA Project #2 C2 is due Sun Nov 1st @ 11:59pm Project #3 will be released

1.08k views • 85 slides
RFID Traceability: A Multilayer Problem Gildas Avoine and Philippe Oechslin EPFL, Lausanne,

RFID Traceability: A Multilayer Problem Gildas Avoine and Philippe Oechslin EPFL, Lausanne,

Introduction and Motivation Financial Cryptography 2005 Relationship Between Traceability and Communication Model Focus on the Communication Layer RFID Traceability: A Multilayer Problem Gildas Avoine and Philippe Oechslin EPFL, Lausanne,

445 views • 29 slides
INF 111 / CSE 121: Software Tools and Methods Lecture Notes for Fall Quarter, 2007 Michele

INF 111 / CSE 121: Software Tools and Methods Lecture Notes for Fall Quarter, 2007 Michele

INF 111 / CSE 121: Software Tools and Methods Lecture Notes for Fall Quarter, 2007 Michele Rousseau Set 17 (Some notes adapted from Susan E. Sim &amp; UML Distilled) Announcements Homework Due 11/21 @ 3p TA will be available for

302 views • 14 slides
semaphores / reader/writer 1 Changelog Changes made in this version not seen in fjrst lecture:

semaphores / reader/writer 1 Changelog Changes made in this version not seen in fjrst lecture:

semaphores / reader/writer 1 Changelog Changes made in this version not seen in fjrst lecture: 1 October 2019: fjx mixup of result and value in semaphore exercise return 3 October 2019: correct reader-priority rwlock code to

1.17k views • 78 slides
A Unified MapReduce Domain-Specific Language for Distributed and Shared Memory Architectures

A Unified MapReduce Domain-Specific Language for Distributed and Shared Memory Architectures

Pontifical Catholic University of Rio Grande do Sul (PUCRS), Faculty of Informatics (FACIN), Computer Science Graduate Program (PPGCC) Parallel Application Modeling Group (GMAP) A Unified MapReduce Domain-Specific Language for Distributed

513 views • 36 slides
Large-Scale Data Engineering Hadoop MapReduce in more detail event.cwi.nl/lsde2015 How will I

Large-Scale Data Engineering Hadoop MapReduce in more detail event.cwi.nl/lsde2015 How will I

Large-Scale Data Engineering Hadoop MapReduce in more detail event.cwi.nl/lsde2015 How will I actually learn Hadoop? This class session Hadoop: The Definitive Guide RTFM There is a lot of material out there There is also a lot

265 views • 26 slides
Doubling FreeBSD request-response throughputs over TCP with PASTE Michio Honda, Giuseppe Lettieri

Doubling FreeBSD request-response throughputs over TCP with PASTE Michio Honda, Giuseppe Lettieri

Doubling FreeBSD request-response throughputs over TCP with PASTE Michio Honda, Giuseppe Lettieri AsiaBSDCon 2019 Contact: @michioh, micchie@sfc.wide.ad.jp Code: https://micchie.net/paste/ Paper:

290 views • 26 slides
Bubble Sharing: Area and Energy Efficient Adaptive Routers using Centralized Buffers Syed Minhaj

Bubble Sharing: Area and Energy Efficient Adaptive Routers using Centralized Buffers Syed Minhaj

Bubble Sharing: Area and Energy Efficient Adaptive Routers using Centralized Buffers Syed Minhaj Hassan and Sudhakar Yalamanchili Center for Research on Experimental Computer Systems School of Electrical and Computer Engineering Georgia

409 views • 25 slides
Implemen'ng a Ring-based Real-'me Capable Network Using a

Implemen'ng a Ring-based Real-'me Capable Network Using a

Robotics Research Institute technische universitt Jun.-Prof. Dr. rer. nat. Sascha Uhrig dortmund Implemen'ng a Ring-based Real-'me Capable Network Using a Mul'threaded Java Processor

800 views • 13 slides

More recommend