Concurrent Programming Class Notes
This note focuses on Concurrent Programming, Parallel Programming, Multi-Processing and Multi-Threading. Topics covered includes: Thread, Properties of a Thread, Lifecycle of a process, Concurrent Hardware, Basic Uniprocessor, Multiprocessors, Basic Hardware, Kessel’s Algorithm, Java Threads Scheduling Model, Compiler Optimization and Mutlithreading, Ticket Algorithm, Bakery Algorithm, Semaphores, Concurrency Problems with Deadlock, Speculative Multithreading (SpMT),Lifecycle of a process, Achieving good performances, Concurrent Hardware, Granularity, Atomicity, Race Conditions, Mutual Exclusion, Brief Interruption to Introduce Java and PThreads, Java Threads Scheduling Model, Compiler Optimization and Mutlithreading, PThreads, Execution Scheduling Policies, Contention Scope, Properties of Mutual Exclusion algorithms, Ticket Algorithm, Bakery Algorithm, Hardware Support for Concurrency, Splitter, Practical Lock Design, Tasuki Locks, Barrier, Semaphores, Condition Variables, Broadcasting, Building Semaphores using Monitors, Using Multiple Condition Variables, Readers and Writers Problem, Concurrency Problems with Deadlock, Dining Philosophers, Deadlock Solution, Scheduling and Priorities, Scheduling Guarantees, Priorities, Termination and Suspension, Miscellanous Issues,Memory Consistency, Relaxed Models, Building Correctly Synchronized Programs, Java Concurrency API, Condition Variable, Concurrent Data Structures, Message Passing, Process Algebra, Homogenous actors, Irregular Actors
Author(s): Gabriel Lemonde Labrecque
110 Pages 
Concurrent Programming in Pharo
This PDF offers a real-world understanding of concurrent programming in the Pharo programming environment by concentrating on it. First, it introduces concurrent programming and leads to a simple example based on which the fundamental ideas are constructed. Some important concepts include creating processes, lifetimes, ProcessorScheduler, priorities of processes, and scheduler rules so that one can understand the management of the flow of executions. Discussions on important APIs accompany working examples of semaphores, which should help developers in their ability to learn synchronization techniques. It is designed for programmers to acquire all the skills one would need to implement concurrent solutions effectively in Pharo and thus can be a valuable member of any programmer's library.
Author(s): Stephane Ducasse, Guillermo Polito
58 Pages
Concurrent Programming in Harmony by Cornell
The Harmony Virtual Machine: Principles and Practice of Concurrent Programming This comprehensive guide develops the principles and practice of concurrent programming with the Harmony Virtual Machine. This comprehensive reference guide discusses key ideas such as critical sections and problems in concurrent programming. It helps readers learn about Peterson's algorithm for mutual exclusion, various locking mechanisms, and concurrent data structures. The text also explains advanced synchronization techniques, such as conditional waiting, reader/writer locks, and monitors. In addition, this book includes deadlock and starvation concepts. It talks about distributed systems with consensus algorithms such as Paxos and the protocols used for authentication, such as Needham-Schroeder. Material is structured to support theoretical understanding and practical application, making this text useful for both students and practitioners in concurrent programming.
Author(s): Robbert van Renesse
225 Pages
