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 
Advanced Concurrent Programming Notes
These notes provide a detailed expositions on advanced topics in concurrent programming; these are focused both on theoretical foundations as well as on practical applications of shared-variable programming. Among the various aspects treated are mutual exclusion techniques (such as Petersen's algorithm) and, of course, synchronization methods such as semaphores and monitors. The introduction of paradigms in distributed programming is also covered by means of remote procedure calls (RPC), as well as transactional memory, among other things. The module covers the proof outline logic of concurrent programs that allow for a rigorous approach toward understanding the correctness of concurrent systems. As graduate-level study notes perfect for anyone interested in comprehending concurrency in software development at a deeper level than usual, they provide an excellent approach toward understanding the reasoning of designs and also toward verifying critical properties in concurrent systems.
Author(s): Memorial University of Newfoundland
NA Pages
Concurrent Programming Class Notes (PDF 110P)
These class notes give a course outline that is conducted in-depth on concurrent programming. They include the basic concepts of parallel programming, multi-processing, and multi-threading. Threads' definitions and properties are presented, such as lifecycle processes and the structure of concurrent hardware architecture. The basic algorithms form the foundation, including Kessel's and ticket algorithms, with semantic and the bakery algorithm as the key synchronization tools. Another topic that the material will be discussing about concurrency issues is deadlock and speculative multithreading. This book is a resource on getting an easy-to-access introduction to concurrent programming principles; it is excellent for student and professional readers who want to learn about how to effectively manage concurrent processes in software applications.
Author(s): Gabriel Lemonde
110 Pages
