Principles of concurrent and distributed programming

Author(s)

• Ben-Ari, M.

Bibliographic Information

Principles of concurrent and distributed programming

M. Ben-Ari

（Prentice-Hall International series in computer science）

Prentice Hall, c1990

Note

Includes bibliographical references (p. 218-221) and index

Description and Table of Contents

Description

Principles of Concurrent and Distributed Programming provides an introduction to concurrent programming focusing on general principles and not on specific systems.

Table of Contents

I CONCURRENT PROGRAMMING: 1. What is Concurrent Programming? 2. The Concurrent Programming Abstraction. 3. The Mutal Exclusion Problem. 4. Semaphores. 5. Monitors. 6. the Problem of Dining Philosophers. II DISTRIBUTED PROGRAMMING. 7. Distributed Programming Models. 8. Ada. 9. occam. 10. Linda. 11. Distributed Mutual Exclusion. 12. Distributed Termination. 13. The Byzantine Generals Problem. III. IMPLEMENTATION PRINCIPLES: 14. Single Processor Implementation. 15. Multi-processor Implementation. 16. Real-Time Programming. Appendix A: Ada Overview. B: Concurrent Programs in Ada. C: Implementation of the Ada Emulations. D: Distributed Algoriths in Ada. Biblography. Index.

by "Nielsen BookData"

Details

• NCID: BA1135827X
• ISBN:
  • 013711821X
• LCCN: 89039815
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: New York ; Tokyo
• Pages/Volumes: x, 225 p.
• Size: 24 cm
• Classification:
  • NDC8 : 007.64
  • LCC : QA76.5
  • DC20 : 004/.36
• Subject Headings:
  • LCSH : Parallel processing (Electronic computers)
  • LCSH : Electronic data processing -- Distributed processing
• Parent Bibliography ID:
  • BA00010507