Description
The Art of Multiprocessor Programming (2nd Ed.)
Authors: Herlihy Maurice, Shavit Nir, Luchangco Victor, Spear Michael
Language: EnglishSubjects for The Art of Multiprocessor Programming:
Keywords
algorithm; implementation; Boolean; Java; memory; linear; concurrent; synchronization
73.94 €
In Print (Delivery period: 14 days).
Add to cart the book of Herlihy Maurice, Shavit Nir, Luchangco Victor, Spear Michael576 p. · 19x23.4 cm · Paperback
Description
/li>Contents
/li>Readership
/li>Biography
/li>Comment
/li>
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 13. Concurrent hashing and natural parallelism 14. Skiplists and balanced search 15. Priority queues 16. Scheduling and work distribution 17. Data parallelism 18. Barriers 19. Optimism and manual memory management 20. Transactional programming Appendix A: Software basics Appendix B: Hardware basics
Students in multiprocessor and multicore programming courses and engineers working with multiprocessor and multicore systems.
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.
Victor Luchangco is a Senior Algorithms Researcher at Algorand in Cambridge, MA, USA.
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.
- 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