The Art of Multiprocessor Programming
Autor Maurice Herlihy, Nir Shavit, Victor Luchangco, Michael Spearen Limba Engleză Paperback – 30 dec 2020
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
Preț: 349.43 lei
Preț vechi: 591.32 lei
-41% Nou
61.82€ • 72.68$ • 54.15£
Carte disponibilă
Livrare economică 01-15 ianuarie 26
Livrare express 24-30 decembrie pentru 184.81 lei
Specificații
ISBN-10: 0124159508
Pagini: 576
Dimensiuni: 191 x 235 x 30 mm
Greutate: 1.15 kg
Ediția:2nd edition
Editura: ELSEVIER SCIENCE
Public țintă
Students in multiprocessor and multicore programming courses and engineers working with multiprocessor and multicore systems.Cuprins
1. Introduction 2. Mutual Exclusion 3. Concurrent Objects and Linearization 4. Foundations of Shared Memory 5. The Relative Power of Synchronization Methods 6. The Universality of Consensus 7. Spin Locks and Contention 8. Monitors and Blocking Synchronization 9. Linked Lists: The Role of Locking 10. Concurrent Queues and the ABA Problem 11. Concurrent Stacks and Elimination 12. Counting, Sorting and Distributed Coordination 13. Concurrent Hashing and Natural Parallelism 14. Skiplists and Balanced Search 15. Priority Queues 16. Futures, Scheduling and Work Distribution 17. Barriers 18. Transactional Memory