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 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 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
