9780521629119-052162911X-Concurrency in Ada

Concurrency in Ada

ISBN-13: 9780521629119
ISBN-10: 052162911X
Edition: 2
Author: Alan Burns, Andy Wellings
Publication date: 1998
Publisher: Cambridge University Press
Format: Paperback 442 pages
FREE US shipping

Book details

ISBN-13: 9780521629119
ISBN-10: 052162911X
Edition: 2
Author: Alan Burns, Andy Wellings
Publication date: 1998
Publisher: Cambridge University Press
Format: Paperback 442 pages

Summary

Concurrency in Ada (ISBN-13: 9780521629119 and ISBN-10: 052162911X), written by authors Alan Burns, Andy Wellings, was published by Cambridge University Press in 1998. With an overall rating of 4.1 stars, it's a notable title among other books. You can easily purchase or rent Concurrency in Ada (Paperback) from BooksRun, along with many other new and used books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.93.

Description

A major feature of the Ada programming language is the facilities it provides for concurrent programming. In this book, Alan Burns and Andy Wellings provide a thorough and self-contained account of concurrent programming in Ada, and show users how to harness the full power of the language. Starting with an overview of the nonconcurrent features of Ada, the authors examine in detail the uses of concurrent programming and the inherent difficulties in providing interprocess communication. They introduce the Ada tasking model, and explain system programming, real-time issues, distribution, object-oriented programming, and reuse. This is the first book to deal with concurrent features in the new Ada standard, and it offers practical advice to both programmers working with embedded systems and those interested more broadly in the development of programming languages. Many otherwise inaccessible issues are probed in depth, making this book invaluable to professional software engineers and advanced students of programming alike. Every Ada programmer will find it essential reading and a primary reference work.

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book