Silicon Press: Ada: Concurrent Programming (2/E)

Introduction
- Concurrent Programming in Ada
- Vending Machine Example
- Simulating the Vending Machine
- Exercises
Tasking Facilities
- Task Specification and Body
- Entry Decl., Entry Calls, & Accept Statements
- Delay Statement
- Select Statement
- Task Activation, Completion, Master, & Term.
- Abort Statement
- Task Priorities
- Task and Entry Attributes
- The CALENDAR Package
- Mutual Exclusion
- Examples
- Exercises
Task Types
- Declaration of Identical Tasks
- Dynamic Task Creation
- Examples
- Exercises
Exceptions and Tasking
- Exceptions in Task Decl. & Activation
- Statement Raising an Exception in a Task
- Exceptions During Task Communication
- Examples
- Exercises
Device Drivers
- Device Registers
- Interrupts
- Low-Level Input/Output Package
- Examples
Real-Time Programming
- Requirements for Real-Time Prog. Lang.
- Scheduling
- Examples
- Exercises
Some Issues in Concurrent Programming
- Deadlock
- Maximizing Concurrency
- The Polling Bias in Ada
- Exercises
More Examples
- Quicksort
- The Alpha-Beta Search Algorithm
- Communication Using Computer Terminals
- Exercise
Concluding Remarks
- Concurrency in Ada and Multicomputers
- Limitations of Ada's Concurrent Prog. Facil.
Appendix A: Task Interaction: A Historical Perspective
- The Ada Version of the Vending Machine
- Semaphores
- Critical Regions
- Monitors
- Message Passing
- Communicating Sequential Processes
- Distributed Processes
- Final Comments
Appendix B: Sequential Programming in Ada - A Synopsis
- Basics
- Types, Constants and Variables
- Expressions and Operator Precedence
- Statements
- Subprograms
- Scope and Visibility Rules
- Input/Output
- Main Programs and Compilation Units
- Pragmas
- More on Types
- Packages
- Exceptions
- Generic Facilities
- Program Structure & Separate Compilation
- Rep. Clauses/Impl.-Dependent Features
- Exercise
Annotated Bibliography
Index