PPT-CS 140 Lecture Notes: Concurrency

Slide 1 Too Much Milk With Locks Both threads struct lock l l ockacquire ampl if milk 0 buyMilk lockrelease amp l CS 140 Lecture Notes Locks. ŒŽ‘ŒŽ‘Œ’Ž\fŒŽ\f\f’‡“\f”\f\b\fƒŒ Sadhna Kumari. OUTLINE. ACID Properties. 2-Phase Commit Protocol. TPS. Serializability. Concurrency Control Protocols. Current Research. Future. References. ACID PROPERTIES. Atomicity: . A . transaction is . Seminar: Transaction Processing (Bachelor). SS 2009. Dennis . Stratmann. Outline. Goal and Overview. Examine Three Approaches to CC on RD:. 1. Predicate-Oriented Concurrency Control. 2. Relational Update Transactions. -. Bhavya. . Kilari. Dr. . Yanqing. Zhang, . CSc. 8320. PREVIEW. P. ART. I. : . I. NTRODUCTION. Transaction Processing System. [. R. Chow & T. Johnson, 1997. Slide . 1. Memory Layout for Process. Code. 0. ∞. Data. Stack. CS 140 Lecture Notes: Linkers. Slide . 2. Creating a Process. 101010101010101010101010101010101010101010101010. cc. x.c. x.s. as. x.o. Slide . 1. Uniprocessor . Locks. void . lock_acquire. (. struct. lock *l) {. . intr_disable. ();. if (!l->locked) {. l->locked = 1;. } else {. . queue_add. (&l->q, . Concurrency Topics. 1. Sequential programming notation. 2. Expressing concurrency with . co. and . process. . 3. States and hardware. 4. Atomic actions. 5. Inter-leavings and histories. 6. The finite progress assumption. Database Concurrency Control. 1 Purpose of Concurrency Control. To enforce Isolation (through mutual exclusion) among conflicting transactions. . To preserve database consistency through consistency preserving execution of transactions.. Sadhna Kumari. OUTLINE. ACID Properties. 2-Phase Commit Protocol. TPS. Serializability. Concurrency Control Protocols. Current Research. Future. References. ACID PROPERTIES. Atomicity: . A . transaction is . Slide . 1. Too Much Milk With Locks. Both threads:. struct. lock l;. .... l. ock_acquire. (&l);. if (milk == 0) . {. . . buyMilk. ();. }. lock_release. (&. l);. CS 140 Lecture Notes: Locks. 3:00. Arrive home: no milk. 3:05. Leave for store. 3:10. Arrive at store. 3:15. Leave store. 3:20. Arrive home, put milk away. 3:25. 3:30. CS 140 Lecture Notes: Concurrency. Slide . 1. Too Much Milk. Slide . 1. Too Much Milk. . Roomate. A. 3:00. Arrive home: no milk. 3:05. Leave for store. 3:10. Arrive at store. 3:15. Leave store. 3:20. Arrive home, put milk away. CS 140 Lecture Notes: Concurrency. -. Bhavya. . Kilari. Dr. . Yanqing. Zhang, . CSc. 8320. PREVIEW. P. ART. I. : . I. NTRODUCTION. Transaction Processing System [. R. Chow & T. Johnson, 1997. Slide . 1. free. File Allocation Table. A: 6. B: 1. .... 6. 4. 3. 0. 1. File A:. File B:. Directory (5). 2. end. 2. 3. end. 3. 4. 5. end. 4. 6. 7. free. …. 1. 2. Disk Scheduling. CS 140 Lecture Notes: Disk Scheduling.