Titlebook: Shared-Memory Synchronization; Michael L. Scott Book 2013 Springer Nature Switzerland AG 2013

refine

Essential Theory,e text of Schneider [1997]. On the broader topic of distributed computing (which as noted in the box on page 2 is viewed by theoreticians as a superset of shared-memory concurrency), interested readers may wish to consult the classic text of Lynch [1996].

玉米

Read-mostly Atomicity,ts of Section 3.1.2 will also suffice. In particular, . optimizations exploit the fact that operations can safely execute concurrently, while still maintaining atomicity, if they read shared data without writing it.

Negligible

1935-3235 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 for this book is “systems programmers

腫塊

Book 2013sion 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.?.

Interstellar

表狀態(tài)

積極詞匯

Architectural Background, chapter provides an overview of these details. It can be skimmed by those already familiar with the subject, but should probably not be skipped in its entirety: the implications of store buffers and directory-based coherence on synchronization algorithms, for example, may not be immediately obvious

遵循的規(guī)范

橫條

Practical Spin Locks,968b]. Dijkstra himself published an .-thread solution in 1965 [CACM]. The problem has been intensely studied ever since. Taubenfeld [2008] provides a summary of significant historical highlights. Ben-Ari [2006, Chaps. 3 & 5] presents a bit more detail. Much more extensive coverage can be found in T

anthropologist