The Art of Multiprocessor Programming, Revised Reprint

The Art of Multiprocessor Programming, Revised Reprint
复制标题

DOI：
--
复制
发表时间：
2012-06
期刊：
--
影响因子：
--
通讯作者：
M. Herlihy;N. Shavit
M. Herlihy;N. Shavit
中科院分区：
其他
文献类型：
--
作者：
M. Herlihy;N. Shavit

文献摘要

被引文献

相似文献

经过修订和更新，在并行编程课程中进行了改进，多处理器编程的艺术是多核编程的权威指南。它引入了比高效单核编程所需的更高级别的软件开发技能。本书全面介绍了有效的多处理器编程所必需的新原理、算法和工具。学生和专业人士都将受益于关键的多处理器编程问题的全面覆盖。本修订版根据自2008年以来课堂报告的反馈和更正，在整本书中纳入了急需的更新学习访问共享内存的多线程编程的基础知识探索主流并发数据结构及其设计的关键元素，以及从简单锁到事务内存系统的同步技术访问配套网站并下载源代码，示例Java程序，以及支持和增强学习体验的材料目录1.导言2.相互排斥3.并发对象和线性化4.共享内存的基础5.同步方法的相对功率6.第七章共识的普遍性8.第八章. 9.第九章.链接列表：锁定的作用10. 11.第11章. 12.第12章.计数、分类和分布式协调13. 14.第14章. 15.第15章.第16章.未来，调度和工作分配17。18. honor transmittance Memory附录
Revised and updated with improvements conceived in parallel programming courses, The Art of Multiprocessor Programming is an authoritative guide to multicore programming. It introduces a higher level set of software development skills than that needed for efficient single-core programming. This book provides comprehensive coverage of the new principles, algorithms, and tools necessary for effective multiprocessor programming. Students and professionals alike will benefit from thorough coverage of key multiprocessor programming issues. This revised edition incorporates much-demanded updates throughout the book, based on feedback and corrections reported from classrooms since 2008 Learn the fundamentals of programming multiple threads accessing shared memory Explore mainstream concurrent data structures and the key elements of their design, as well as synchronization techniques from simple locks to transactional memory systems Visit the companion site and download source code, example Java programs, and materials to support and enhance the learning experience Table of Contents 1. Introduction 2. Mutual Exclusion 3. Concurrent Objects and Linearization 4. Foundations of Shared Memory 5. The Relative Power of Synchronization Methods 6. The Universality of Consensus 7. Spin Locks and Contention 8. Monitors and Blocking Synchronization 9. Linked Lists: the Role of Locking 10. Concurrent Queues and the ABA Problem 11. Concurrent Stacks and Elimination 12. Counting, Sorting and Distributed Coordination 13. Concurrent Hashing and Natural Parallelism 14. Skiplists and Balanced Search 15. Priority Queues 16. Futures, Scheduling and Work Distribution 17. Barriers 18. Transactional Memory Appendices