Driving Forces of Parallel Patterns

1. Decomposition
(D) Data Decomposition
(F) Functional Decomposition (at least in abstraction)
2. Ordering
(P) Ordering must be preserved
(NP) Ordering does not matter and only the effect counts
3. Communication structure
(L) Local: neighbor-to-neighbor
(R) Recursive: Tree structure
(I) Irregular: Complex geometric shapes
4. Dependencies
(C) Clearly separable
(D) Deterministically (or functionally) dependant
(I) Inseparable

---

Table of Parallel Patterns

	decomposition		ordering		communication			dependency
	(D)	(F)	(P)	(NP)	(L)	(R)	(I)	(C)	(D)	(I)
Pipes
Layers
Repositories
Master/Worker
Replicable
Inseparation
Divide&Conquer
Geometric
Recursive
Irregular Mesh