PPT-Chapter 6 Concurrency: Deadlock and Starvation

Operating Systems Internals and Design Principles 2017 Pearson Education Inc Hoboken NJ All rights reserved Ninth Edition By William Stallings Deadlock The permanent blocking of a set of processes that either compete for system resources or communicate with each other. 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. Prof. O. Nierstrasz. Selected material © Magee and Kramer. © Oscar Nierstrasz. 2. Roadmap. Modelling Concurrency. Finite State Processes . Labelled Transition Systems. Java Threads. Thread creation. Chapter 6. 2. Outline. Principles of Deadlock. Introduction and conditions for deadlock. Deadlock prevention. Deadlock Avoidance. Deadlock detection. An Integrated deadlock strategy. Concurrency Mechanisms in UNIX, Linux, Solaris and Windows. 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. Reading Assignment. T. M. Pinkston, . “. Deadlock Characterization and Resolution in Interconnection Networks,. ”. Chapter 13 in . Deadlock Resolution in Computer Integrated Systems. , CRC Press 2004. Motivation, Challenges, Impact on Software Development. CSE 110 – Winter 2016. About These Slides. Due to the nature of this material, this lecture was delivered via the chalkboard. Every was advised that slides would not be available and that notes should be taken. . IEEE TC. , May 1987. F. . Silla. , and J. . Duato. , “Improving the Efficiency of Adaptive Routing in Networks with Irregular Topology,” . HIPC. 1997. J. . Duato. “A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks,” . Deadlock . detection. Resource Allocation Graphs. Resource Pool and . C. ounting Semaphores. Dining . Philosophers Problem. Condition Variables . Resource Tables. Deadlock Definition. A . deadlock.  is a situation in which two or more competing actions are each waiting for the other to finish, and thus neither ever does. Starvation was the deliberate Nazi policy.. The amount of food allowed in the ghettos changed from day to day, but typically their ration included:. Bread: 14.0 oz.. Meat Products: 4.5 oz.. Sugar: 1.75 oz.. Motivation, Challenges, Impact on Software Development. CSE 110 – Winter 2016. About These Slides. Due to the nature of this material, this lecture was delivered via the chalkboard. Every was advised that slides would not be available and that notes should be taken. . “A set of processes is deadlocked if each process in the set is waiting for an event that only another process in the set can cause.”. Detection. “Is this system deadlocked, and if so, which processes are involved?”. -. Bhavya. . Kilari. Dr. . Yanqing. Zhang, . CSc. 8320. PREVIEW. P. ART. I. : . I. NTRODUCTION. Transaction Processing System [. R. Chow & T. Johnson, 1997.