The art of multiprocessor programming

著者

書誌事項

The art of multiprocessor programming

Maurice Herlihy, Nir Shavit

Morgan Kaufmann, c2008

大学図書館所蔵 件 / 全19件

この図書・雑誌をさがす

注記

Includes bibliographical references (p. 483-493) and index

内容説明・目次

内容説明

The Art of Multiprocessor Programming promises to be the first comprehensive presentation of the principles and tools available for programming multiprocessor machines. 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, programmers need to learn the new principles, algorithms, and tools. The book will be 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. This book includes fully-developed Java examples detailing data structures, synchronization techniques, transactional memory, and more. Students in multiprocessor and multicore programming courses and engineers working with multiprocessor and multicore systems will find this book quite useful.

目次

  • 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 Sychronization
  • 9 Linked Lists: the Role of Locking
  • 10 Concurrent Queues and the ABA Problem
  • 11 Concurrent Stakcs and Elimination
  • 12 Counting, Sorting and Distributed Coordinatino
  • 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
  • Appendices

「Nielsen BookData」 より

詳細情報

ページトップへ