Save up to 30% on Elsevier print and eBooks with free shipping. No promo code needed.
Save up to 30% on print and eBooks.
The Art of Multiprocessor Programming
2nd Edition - September 8, 2020
Authors: Maurice Herlihy, Nir Shavit, Victor Luchangco, Michael Spear
Language: English
Paperback ISBN:9780124159501
9 7 8 - 0 - 1 2 - 4 1 5 9 5 0 - 1
eBook ISBN:9780123914064
9 7 8 - 0 - 1 2 - 3 9 1 4 0 6 - 4
The Art of Multiprocessor Programming, Second Edition, provides users with an authoritative guide to multicore programming. This updated edition introduces higher level softwa…Read more
Purchase options
LIMITED OFFER
Save 50% on book bundles
Immediately download your ebook while waiting for your print delivery. No promo code is needed.
The Art of Multiprocessor Programming, Second Edition, provides users with an authoritative guide to multicore programming. This updated edition introduces higher level software development skills relative to those needed for efficient single-core programming, and includes comprehensive coverage of the new principles, algorithms, and tools necessary for effective multiprocessor programming. The book is an ideal resource for students and professionals alike who will benefit from its thorough coverage of key multiprocessor programming issues.
Features new exercises developed for instructors using the text, with more algorithms, new examples, and other updates throughout the book
Presents the fundamentals of programming multiple threads for accessing shared memory
Explores mainstream concurrent data structures and the key elements of their design, as well as synchronization techniques, from simple locks to transactional memory systems
Students in multiprocessor and multicore programming courses and engineers working with multiprocessor and multicore systems
1. Introduction
2. Mutual exclusion
3. Concurrent objects
4. Foundations of shared memory
5. The relative power of synchronization operations
6. Universality of consensus
7. Spin locks and contention
8. Monitors and blocking synchronization
9. Linked lists: The role of locking
10. Queues, memory management, and the ABA problem
11. Stacks and elimination
12. Counting, sorting and distributed coordination
Maurice Herlihy received an A.B. in Mathematics from Harvard University, and a Ph.D. in Computer Science from M.I.T. He has served on the faculty of Carnegie Mellon University, on the staff of DEC Cambridge Research Lab, and is currently a Professor in the Computer Science Department at Brown University. Dr. Herlihy is an ACM Fellow, and is the recipient of the 2003 Dijkstra Prize in Distributed Computing. He shared the 2004 Gödel Prize with Nir Shavit, with whom he also shared the 2012 Edsger W. Dijkstra Prize In Distributed Computing.
Affiliations and expertise
Brown University, Providence, RI, USA
NS
Nir Shavit
Nir Shavit received a B.A. and M.Sc. from the Technion and a Ph.D. from the Hebrew University, all in Computer Science. From 1999 to 2011 he served as a member of technical staff at Sun Labs and Oracle Labs. He shared the 2004 Gödel Prize with Maurice Herlihy, with whom he also shared the 2012 Edsger W. Dijkstra Prize in Distributed Computing. He is a Professor in the Electrical Engineering and Computer Science Department at M.I.T. and the Computer Science Department at Tel-Aviv University.
Affiliations and expertise
Professor of Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA
VL
Victor Luchangco
Victor Luchangco is a Senior Algorithms Researcher at Algorand in Cambridge, MA, USA.
Affiliations and expertise
Senior Algorithms Researcher, Algorand, Cambridge, MA, USA
MS
Michael Spear
Professor Spear's research interests are broadly in concurrency, programming languages, and computer architecture. His goal is to make it easier for programmers to write correct, scalable applications.
Affiliations and expertise
Computer Science and Engineering, Lehigh University, Bethlehem, PA, USA
Read The Art of Multiprocessor Programming on ScienceDirect