Burns, Alan, <br/><br/>
Concurrent and real-time programming in Ada 2005 / 
Alan Burns and Andy Wellings. 
 - Cambridge ;  New York :  Cambridge University Press,  2007. 
 - xiv, 461 p. :  26 cm. 
<br/><br/>Introduction<br/>1.1 Concurrency<br/>1.2 Real-time systems<br/>1.3 Ada's time and clock facilities<br/>1.4 Summary<br/>1.5 Further reading<br/>The nature and uses of concurrent programming<br/>2.1 Uses of concurrent programming<br/>2.2 Program entities<br/>2.3 Process representation<br/>2.4 A simple embedded system<br/>2.5 Summary<br/>2.6 Further reading<br/>Inter-process communication<br/>3.1 Data communication<br/>3.2 Synchronisation<br/>3.3 Deadlocks and indefinite postponements<br/>3.4 System performance, correctness and reliability<br/>3.5 Dining philosophers problem<br/>3.6 Shared variables and protected variables<br/>3.7 Semaphores<br/>3.8 Monitors<br/>3.9 Message-based communication<br/>3.10 Summary<br/>3.11 Further reading<br/>Task types and objects<br/>4.1 Task creation<br/>4.2 Task activation, execution, finalisation and termination<br/>4.3 Task hierarchies<br/>4.4 Task identification<br/>4.5 Task creation, communication and synchronisation within task<br/>finalisation<br/>4.6 Summary<br/>The rendezvous<br/>5.1 The basic model<br/>5.2 The entry statement<br/>5.3 The accept statement<br/>5.4 The Count attribute<br/>5.5 Entry families<br/>5.6 Three-way synchronisation<br/>5.7 Private entries<br/>5.8 Exceptions and the rendezvous<br/>5.9 Task states<br/>5.10 Summary<br/>The select statement and the rendezvous<br/>6.1 Selective accept<br/>6.2 Guarded alternatives<br/>6.3 Delay alternative<br/>6.4 The else part<br/>6.5 The correct use of guards<br/>6.6 The terminate alternative<br/>6.7 The exception Program-Error<br/>6.8 Summary of the selective accept statement<br/>6.9 Conditional and timed entry calls<br/>6.10 Mutual exclusion and deadlocks<br/>6.11 The dining philosophers<br/>6.12 Task states<br/>6.13 Summary<br/>Protected objects and data-oriented communication<br/>7.1 Protected objects<br/>7.2 Mutual exclusion<br/>7.3 Condition synchronisation<br/>7.4 Entry calls and barriers<br/>7.5 Private entries and entry families<br/>7.6 Restrictions on protected objects<br/>7.7 Access variables and protected types<br/>7.8 Elaboration, finalisation and exceptions<br/>7.9 Shared data<br/>7.10 The readers and writers problem<br/>7.11 The specification of synchronisation agents<br/>7.12 Shared variables<br/>7.13 Volatile and atomic data<br/>7.14 Task states<br/>7.15 Summary<br/>8  Avoidance synchronisation and the requeue facility<br/>8.1 The need for requeue<br/>8.2 Semantics of requeue<br/>8.3 Requeuing to other entities<br/>8.4 Real-time solutions to the resource control problem<br/>8.5 Entry families and server tasks<br/>8.6 Extended example<br/>8.7 Task states<br/>8.8 Summary<br/>9  Exceptions, abort and asynchronous transfer of control<br/>9.1 Exceptions<br/>9.2 The abort statement<br/>9.3 Asynchronous transfer of control<br/>9.4 Understanding the asynchronous select statement<br/>9.5 A robust readers and writers algorithm<br/>9.6 Task states<br/>9.7 Summary<br/>10 Object-oriented programming and tasking<br/>10.1 The Ada 2005 OOP model<br/>10.2 Tasks and interfaces<br/>10.3 Protected types and interfaces<br/>10.4 Synchronized interfaces<br/>10.5 Summary<br/>10.6 Further reading<br/>11 Concurrency utilities<br/>11.1 Communication and synchronisation abstractions<br/>11.2 Semaphores<br/>11.3 Locks<br/>11.4 Signals<br/>11.5 Event variables<br/>11.6 Buffers<br/>11.7 Blackboards<br/>11.8 Broadcasts<br/>11.9 Barriers<br/>11.10 Concurrent execution abstractions<br/>11.11 Callables and futures<br/>11.12 Executors<br/>11.13 Completion services<br/>11.14 Image processing example revisited<br/>11.15 Summary<br/>12 Tasking and systems programming<br/>12.1 Device driving and interrupt handling<br/>12.2 Model of interrupts<br/>12.3 Task identifiers<br/>12.4 Task attributes<br/>12.5 Summary<br/>12.6 Further reading<br/>13 Scheduling real-time systems - fixed priority dispatching<br/>13.1 Scheduling<br/>13.2 Fixed priority dispatching<br/>13.3 Priority ceiling locking<br/>13.4 Entry queue policies<br/>13.5 Active priorities and dispatching policies<br/>13.6 Summary<br/>13.7 Further reading<br/>14 Scheduling real-time systems - other dispatching facilities<br/>14.1 Non-preemptive dispatching<br/>14.2 Round-robin dispatching<br/>14.3 Earliest deadline first dispatching<br/>14.4 Mixed scheduling<br/>14.5 Dynamic priorities<br/>14.6 Synchronous and asynchronous task control<br/>14.7 Summary<br/>14.8 Further reading<br/>15 Timing events and execution-time control<br/>15.1 Events and event handling<br/>15.2 Timing events<br/>15.3 Dual priority scheduling<br/>15.4 Execution-time clocks<br/>15.5 Execution-time timers<br/>15.6 Group budgets<br/>15.7 Task termination events<br/>15.8 Summary<br/>15.9 Further reading<br/>16 Real-time utilities<br/>16.1 Real-time task state<br/>16.2 Real-time task release mechanisms<br/>16.3 Periodic release mechanisms<br/>16.4 Sporadic release mechanisms<br/>16.5 Aperiodic release mechanisms and execution-time servers<br/>16.6 Real-time tasks<br/>16.7 The cruise control system example<br/>16.8 Summary<br/>17 Restrictions, metrics and the Ravenscar profile<br/>17.1 Restricted tasking and other language features<br/>17.2 The Ravenscar profile<br/>17.3 Partition elaboration control<br/>17.4 Examples of the use of the Ravenscar profile<br/>17.5 Metrics and optimisations<br/>17.6 Summary<br/>17.7 Further reading<br/>18 Conclusion<br/>18.1 Support for concurrency<br/>18.2 Support for real-time<br/>18.3 New to Ada 2005<br/>18.4 Outstanding issues and the future 
<br/><br/><label>ISBN: </label>9780521866972 (hbk.) 0521866979 (hbk.) 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Ada (Computer program language)<br/>Parallel Programming (Computer science)<br/>Real-time Programming.
<br/><br/><label>Dewey Class. No.: </label>005.133  / BUR/C