Art of Multiprocessor Programming, Revised Reprint
ISBN: 9780123973375 | 0123973376
Edition: RevisedFormat: Paperback
Publisher: Elsevier Science Ltd
Pub. Date: 5/23/2012
Why Rent from Knetbooks?
Because Knetbooks knows college students. Our rental program is designed to save you time and money. Whether you need a textbook for a semester, quarter or even a summer session, we have an option for you. Simply select a rental period, enter your information and your book will be on its way!
Top 5 reasons to order all your textbooks from Knetbooks:
- We have the lowest prices on thousands of popular textbooks
- Free shipping both ways on ALL orders
- Most orders ship within 48 hours
- Need your book longer than expected? Extending your rental is simple
- Our customer support team is always here to help
Revised and updated with improvements conceived in parallel programming courses, The Art of Multiprocessor Programming is an authoritative guide to multicore programming. It introduces a higher level set of software development skills than that needed for efficient single-core programming. This book provides comprehensive coverage of the new principles, algorithms, and tools necessary for effective multiprocessor programming. Students and professionals alike will benefit from thorough coverage of key multiprocessor programming issues. This revised edition incorporates much-demanded updates throughout the book, based on feedback and corrections reported from classrooms since 2008 Learn the fundamentals of programming multiple threads accessing shared memory Explore mainstream concurrent data structures and the key elements of their design, as well as synchronization techniques from simple locks to transactional memory systems Visit the companion site and download source code, example Java programs, and materials to support and enhance the learning experience
| Introduction | |
| Mutual Exclusion | |
| Concurrent Objects and Linearization | |
| Foundations of Shared Memory | |
| The Relative Power of Synchronization Methods | |
| The Universality of Consensus | |
| Spin Locks and Contention | |
| Monitors and Blocking Synchronization | |
| Linked Lists: the Role of Locking | |
| Concurrent Queues and the ABA P... MORE | |
| Concurrent Stacks and Elimination | |
| Counting, Sorting and Distributed Coordination | |
| Concurrent Hashing and Natural Parallelism | |
| Skiplists and Balanced Search | |
| Priority Queues | |
| Futures, Scheduling and Work Distribution | |
| Barriers | |
| Transactional Memory | |
| Appendices | |
| Table of Contents provided by Publisher. All Rights Reserved. |
Please wait while this item is added to your cart...
