INDEX
affinity, 7, 19, 20, 21, 23, 35, 49, 51–54, 60, 89, 125
upc_forall with continue as affinity argument, 53
upc_forall with expression as affinity argument, 53
upc_forall with integer as affinity argument, 52
upc_forall with shared address as affinity argument, 52
ANSI C, see ISO C
backtracking, 62
barrier synchronization, see upc_barrier
block size, see data layout
blocking factor, see data layout
bulk transfers, see string functions
cache coherence, 117
collective function, 73
continue, 53
data decomposition, see domain decomposition data layout, 25, 51
*layout qualifier, 28
three-dimensional cells, 60
blocked array, 25, 27, 33, 35, 37, 50
default data distribution, see round-robin data distribution
default block size, 86
indefinite block size, 27, 83, 86, 88
multidimensional array, 54, 60, 77, 84
round-robin fashion, 6, 50, 79
deadlock, 105
distributed memory multiprocessors, see DMs
distributed shared memory, see DSM
domain decomposition, 49
dynamic memory allocation, 21
embarrassingly parallel, 67
examples
bakery algorithm, 110, 112, 113
dining philosophers, 106
heat conduction, 56, 58, 61, 62, 74, 80, 84, 93, 95, 129, 132
matrix-vector multiplication, 26, 29, 50, 52, 53, 81
parallel binary tree, 133
pointer representation, 41
sparse matrix compression, 87
Get UPC: DISTRIBUTED SHARED MEMORY 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.