7.1 Partitioning Exercises
Keywords: perfbook_html

#
7.1 Partitioning Exercises

This section uses a pair of exercises (the classic Dining Philosophers problem and a double-ended queue) to demonstrate the value of partitioning.

Subsections

- 7.1.1 Dining Philosophers Problem
- 7.1.2 Double-Ended Queue
  - 7.1.2.1 Right- and Left-Hand Locks
  - 7.1.2.2 Compound Double-Ended Queue
  - 7.1.2.3 Hashed Double-Ended Queue
  - 7.1.2.4 Compound Double-Ended Queue Revisited
  - 7.1.2.5 Double-Ended Queue Discussion
- 7.1.3 Partitioning Example Discussion