The Art of Concurrency

Index

A note on the digital index

A link in an index entry is displayed as the section title in which that entry appears. Because some sections have multiple index markers, it is not unusual for an entry to have several links to the same section. Clicking on any link will take you directly to the place in the text in which the marker appears.

Symbols

0/1 Knapsack Problem, Depth-First Search

A

abundancy of a number, Applying MapReduce

calculation of, Applying MapReduce

adjacency matrix, Graph Algorithms, Glossary

algorithms with state, Algorithms with State

all-pairs shortest path algorithm, All-Pairs Shortest Path–Alternatives to Floyd’s Algorithm

Dijkstra’s Algorithm, Alternatives to Floyd’s Algorithm

Floyd’s Algorithm, All-Pairs Shortest Path–Scalability

concurrent implementation using TBB, All-Pairs Shortest Path

data race in, What About the Data Race on the kth Row?

design factor scorecard, Design Factor Scorecard

serial implementation, All-Pairs Shortest Path

Amdahl’s Law, Amdahl’s Law

criticisms of, Amdahl’s Law

analysis, identifying possible concurrency, Step 1. Analysis: Identify Possible Concurrency

array packing

ArrayPack( ) function (example), The ArrayPack() function

with prefix scan, The ArrayPack() function

arrays

decomposition examples, How should you divide the data into chunks?

decomposition of, Data Decomposition

recurrence relation on array access, Recurrences

sorting, Bubblesort

summing elements (see parallel sum algorithms)

summing elements using reduction code, Handcoded ...