Amazon cover image
Image from Amazon.com
Image from Google Jackets

The art of multiprocessor programming / Maurice Herlihy, Nir Shavit.

By: Contributor(s): Material type: TextTextPublication details: Amsterdam ; Boston : Elsevier/Morgan Kaufmann, 2008.Description: xx, 508 p. : ill. ; 24 cmISBN:
  • 9780123705914 (pbk.)
Subject(s): DDC classification:
  • 005.434   22
Contents:
1 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.
Summary: As the computer industry changes from single-processor to multiprocessor architectures, this revolution requires a fundamental change in how programs are written. To leverage the performance and power of multiprocessor programming, also known as multicore programming, you need to learn the new principles, algorithms, and tools presented in this book. It includes fully-developed Java examples detailing data structures, synchronization techniques, transactional memory, and more. Prof. Maurice Herlihy, who coined the phrase ";transactional memory,"; 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Books Books Main library General Stacks 005.434 / HE.A 2008 (Browse shelf(Opens below)) 1 Available 007301

Includes bibliographical references and index.

1 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.

As the computer industry changes from single-processor to multiprocessor architectures, this revolution requires a fundamental change in how programs are written. To leverage the performance and power of multiprocessor programming, also known as multicore programming, you need to learn the new principles, algorithms, and tools presented in this book. It includes fully-developed Java examples detailing data structures, synchronization techniques, transactional memory, and more. Prof. Maurice Herlihy, who coined the phrase ";transactional memory,"; 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.

1

There are no comments on this title.

to post a comment.