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 book.quotespace.org All Rights Reserved. 小美書屋 版权所有