Index

A

ABarrier class 203, 419–420
algorithm 205, 205f
implementation 204–206
Accelerators, offloading code blocks to 292–297
Acquire operations 161
Acquire semantics 179
Acquire-release fence 161
Acquire-release memory model 175
sequential consistency compared with 177–178
Advanced reads 157–158
Affinity identity 470
AIX 160
Algorithms 
ABarrier class 205, 205f
Box-Muller 97–98
divide and conquer 222
image-filtering 401
lock-free 125, 171–174
as alternative to critical sections 171
AReduction class 172–174
as optimistic approach 171
updating global data item 171–172
parallel quicksort 282–285
parallel_do 310, 328–329
parallel_for 309, 385
example of usage 317–320
parallel_for_each 310, 327–328
parallel_invoke 310, 329–330
parallel_reduce  ...

Get Shared Memory Application Programming now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.