The Art of Multiprocessor Programming

by Herlihy; Shavit

• ISBN13: 9780123705914
• ISBN10: 0123705916
• Format: Paperback
• Copyright: 2008-02-29
• Publisher: Elsevier Science

Summary

This book is the first comprehensive presentation of the principles and tools available for programming multiprocessor machines. It is of immediate use to programmers working with the new architectures. For example, the next generation of computer game consoles will all be multiprocessor-based, and the game industry is currently struggling to understand how to address the programming challenges presented by these machines. This change in the industry is so fundamental that it is certain to require a significant response by universities, and courses on multicore programming will become a staple of computer science curriculums. The authors are well known and respected in this community and both teach and conduct research in this area. Prof. Maurice Herlihy is on the faculty of Brown University. He is the recipient of the 2003 Dijkstra Prize in distributed computing. Prof. Nir Shavit is on the faculty of Tel-Aviv University and a member of the technical staff at Sun Microsystems Laboratories. In 2004 they shared the Gödel Prize, the highest award in theoretical computer science. * THE book on multicore programming, the new paradigm of computer science * Written by the world's most revered experts in multiprocessor programming and performance * Includes examples, models, exercises, PowerPoint slides, and sample Java programs

Author Biography

Nir Shavit spent several yeras as a Visiting Professor at M.I.T. before joining the faculty of the School of Computer Science at Tel- Aviv University in 1992.

Table of Contents

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 Sychronization

Linked Lists: the Role of Locking

Concurrent Queues and the ABA Problem

Concurrent Stakcs and Elimination

Counting, Sorting and Distributed Coordinatino

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.