Solutions to Parallel and Distributed Computing Problems: Lessons from Biological Sciences
by Albert Y. Zomaya, Fikret Ercal, Stephan Olariu
Index
A
A* algorithm
Ant colonies, 69
Allocation string, 159
Automatic target recognition (ATR), 136
B
Benchmark, 59
Box decomposition, 29
C
CA-based scheduler, 185, 193, 196, 201, 205
concept, 185
discovery of rules, 194
learning mode, 193
operation mode, 193
Cellular automata, 3, 87, 179, 182
asynchronous, 15
asynchronous execution scheme, 4
competition between rules, 203
domain decomposition, 5
edge of chaos, 7
elementary, 6
FHP model, 22
fluid flow, 17
full neighborhood, 190
general rule, 183
ising spin model, 34
lattice gas automata (LGA), 17
selected neighborhood 187
space-time diagrams, 184, 199, 201–203
synchronous, 3
totalistic rule, 184
transition function, 183, 184, 186, 189, 192
universal computers, 5
Checkpointing, 91
Coevolutionary, 70
Communication delays, 130
Communication graph, 114
Complete graph, 114
Completion time, 112
emerging macroscopic behavior, 1
Computational power, 41
Critical path, 236
bottom level, 236
top level, 236
Crossover, 49, 116, 117, 140, 212, 214, 238, 241
cycle, 213
inversion, 213
order, 213
partially mapped, 213
shuffle, 213
single-point, 117
D
Deme model, 47
Diallel mating, 60
Directed acyclic graph (DAG), 137
single-producer, 138
Discrete-event, 13 ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access