Since the advent of time sharing in the 1960s, designers of concurrent and parallel systems have needed to synchronize the activities of threads of control that share data structures in memory. In recent years, the study of synchronization has gained new urgency with the proliferation of multicore processors, on which even relatively simple user-level programs must frequently run in parallel. This lecture offers a comprehensive survey of shared-memory synchronization, with an emphasis on "systems-level" issues. It includes sufficient coverage of architectural details to understand correctness and performance on modern multicore machines, and sufficient coverage of higher-level issues to understand how synchronization is embedded in modern programming languages. The primary intended audience is "systems programmers"—the authors of operating systems, library packages, language run-time systems, concurrent data structures, and server and utility programs. Much of the discussion should also be of interest to application programmers who want to make good use of the synchronization mechanisms available to them, and to computer architects who want to understand the ramifications of their design decisions on systems-level code. Table of Contents: Introduction / Architectural Background / Essential Theory / Practical Spin Locks / Busy-wait Synchronization with Conditions / Read-mostly Atomicity / Synchronization and Scheduling / Nonblocking Algorithms / Transactional Memory / Author's Biography
评分
评分
评分
评分
如果你对lock,barrier这些都是怎么实现的,他们实现的算法有什么样的发展感兴趣的话。推荐这本书给你。
评分如果你对lock,barrier这些都是怎么实现的,他们实现的算法有什么样的发展感兴趣的话。推荐这本书给你。
评分如果你对lock,barrier这些都是怎么实现的,他们实现的算法有什么样的发展感兴趣的话。推荐这本书给你。
评分如果你对lock,barrier这些都是怎么实现的,他们实现的算法有什么样的发展感兴趣的话。推荐这本书给你。
评分如果你对lock,barrier这些都是怎么实现的,他们实现的算法有什么样的发展感兴趣的话。推荐这本书给你。
本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 qciss.net All Rights Reserved. 小哈图书下载中心 版权所有