Table of ContentsChapter 12: An Introduction to Concurrent Programming Definitions Interactions between processors take two forms: Multiprocessor Organization Multiprocessor Organization(Cont) Multiprocessor Organization(Cont) Multiprocessor Organization(Cont) Multiprocessor Organization(Cont) 12.2 Streams: Implicit Synchronization Process Network Process Networks PPT Slide 12.3 Concurrency as Interleaving Interleaving preserves the relative order of events in a thread A complete Ada program Concurrent Tasks in Ada A procedure with two tasks declared within it. 12.4 Liveness Properties Resource Sharing Constrains Concurrency Deadlock: The Inability to Proceed Livelock: No Process makes Progress Fairness and Deadlock Prevention 12.5 Safety Access to Shared Data Critical Sections (Cont) Safety of Serialability 12.6 Concurrency in Ada A rendezvous Synchronized Communication Threads for the tasks Task Initialization and Dynamically Created Tasks Selective Acceptance Selective Acceptance (Cont) 12.7 Synchronized Access to Shared Variables Direct Access Semaphores: Mutual Exclusion Monitors Monitors (cont) Buffer as a process Buffer as a Process |
Author: Zage
Email: dmz@cs.bsu.edu Home Page: http://www.cs.bsu.edu/homepages/dmz/cs335/ |