- Intel Threading Building Blocks
- Foreword
- Note from the Lead Developer of Intel Threading Building Blocks
- Preface
- 1. Why Threading Building Blocks?
- 2. Thinking Parallel
- 3. Basic Algorithms
- 4. Advanced Algorithms
- 5. Containers
- 6. Scalable Memory Allocation
- 7. Mutual Exclusion
- 8. Timing
- 9. Task Scheduler
- When Task-Based Programming Is Inappropriate
- Much Better Than Raw Native Threads
- Initializing the Library Is Your Job
- Example Program for Fibonacci Numbers
- Task Scheduling Overview
- How Task Scheduling Works
- Recommended Task Recurrence Patterns
- Making Best Use of the Scheduler
- Task Scheduler Interfaces
- Task Scheduler Summary
- 10. Keys to Success
- 11. Examples
- The Aha! Factor
- A Few Other Key Points
- parallel_for Examples
- The Game of Life
- Parallel_reduce Examples
- CountStrings: Using concurrent_hash_map
- Quicksort: Visualizing Task Stealing
- A Better Matrix Multiply (Strassen)
- Advanced Task Programming
- Packet Processing Pipeline
- Memory Allocation
- Game Threading Example
- Physics Interaction and Update Code
- Open Dynamics Engine
- 12. History and Related Projects
- Index
- About the Author
- Colophon
- Copyright
Name
queuing_rw_mutex Class — Class that models ReaderWriterMutex Concept that is fair and scalable.
Description
A queuing_rw_mutex models the ReaderWriterMutex Concept. A queuing_rw_mutex is scalable, in the sense that if a task has to wait to acquire the mutex, it spins on its own local cache line. A queuing_rw_mutex is fair, in that tasks acquire the lock in the order they requested it, even if they later are suspended. A queuing_rw_mutex is not reentrant.
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.