The DOI matches its Crossref record.
The Art of Multiprocessor Programming
Abstract
In many places, inserted text is highlighted in red. Preface p. xx " all of which are useful in structuring concurrent applications. " Chapter 1 p. 4 In Fig. 1.1, line 4 should say for (int j = (i * block) + 1; j <= (i + 1)* block; j++) { p. 11 p. 18 Second paragraph of Mutual Exclusion bullet: " Initially the can is either up or down. Let us say it was down. Then only the pets can go in, and mutual exclusion holds. " Replace question 6 bullet 2 with: Suppose the method M accounts for 30% of the program's computation time. Let sn be the program's speedup on n processes, assuming the rest of the program is perfectly parallelizable. Your boss tells you to double this speedup: the revised program should have speedup s'n ≥ sn/2. You advertize for a programmer to replace M with an improved version, k times faster. What value of k should you require? Chapter 2 p. 23 Figure 2.3 should be amended as shown: public long getAndIncrement() { lock.lock(); try { long temp = value; value = temp + 1; return temp; } finally { lock.unlock(); } } p. 25 Pragma 2.3.1: " We explain the reasons in Chapter 3 and Appendix B. " p. 26 In Fig. 2.5, remove all declarations of variables as volatile. Indeed as stated in Pragma 2.3.1 on page 25, one should use memory barriers when implementing these algorithms. However, in this chapter (in all code) we avoid such issues to keep the algorithms simple. Adding volatile to these variables would require more complex coding that would distract readers from the core issues at hand.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Artificial neural networks in hardware: A survey of two decades of progress
Misra, J., & Saha, I. (2010) · Neurocomputing · doi:10.1016/j.neucom.2010.03.021 · Cited by 646
MemC3: Compact and Concurrent MemCache with Dumber Caching and Smarter Hashing
Fan, B., Andersen, D. G., & Kaminsky, M. (2018) · doi:10.1184/r1/6607223 · Cited by 296
Kuper, L., Turon, A., Krishnaswami, N. R., & Newton, R. R. (2014) · Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages · doi:10.1145/2535838.2535842 · Cited by 46
Metadata
- Venue
- Elsevier eBooks
- Publisher
- Elsevier
- Published
- 2021
- OpenAlex
- W1983572666
- Cited by
- 1,093
- References
- 0
- FWCI
- 24.41
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Art of Multiprocessor Programming. https://app.cochat.ai/papers/10.1016/c2011-0-06993-4
- The paper
- The Art of Multiprocessor Programming. (2021). Elsevier eBooks. https://doi.org/10.1016/c2011-0-06993-4
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.