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.
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.
This web resource is a comprehensive tutorial
on concurrent and distributed programming with all basics illustrated with
practical examples. It starts with an overview of concurrency, illustrating
critical principles with simple programming examples. Notes provide overviews of
several programming languages-including C, C++, Java, Ada, and Perl-showing how
each approaches concurrency. It encompasses mutual exclusion, message passing,
and both the standard and an enhanced version of the classic Dining Philosophers
problem. It also touches on threading in Java and Ada as well as introduces the
POSIX threads library (pthreads) for C programs. This book is perfect for
students and practitioners who need to know the underpinning of concurrent
programming in different environments.