{"title":"并发和分布式编程的原则","authors":"M. Ben-Ari","doi":"10.5860/choice.28-2760","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":137924,"journal":{"name":"PHI Series in computer science","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"429","resultStr":"{\"title\":\"Principles of concurrent and distributed programming\",\"authors\":\"M. Ben-Ari\",\"doi\":\"10.5860/choice.28-2760\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":137924,\"journal\":{\"name\":\"PHI Series in computer science\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"429\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"PHI Series in computer science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5860/choice.28-2760\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"PHI Series in computer science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5860/choice.28-2760","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Principles of concurrent and distributed programming
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.