Parallel Computer Architecture

4.4 Illustrating Workload Characterization 253

(1) Before refinement

&^.

(2) After the first refinement

.<

(3) After three more refinements: A

2

subdivides

B;

then A

2

is

subdivided due to

B

2

then

A

22

subdivides ß

1

FIGURE 4.16 Hierarchical refinement of interactions and interaction lists. Binary

trees are shown instead of quadtrees for clarity, and only one input polygon's interaction

lists are shown.

2 Workload Characteristics

We now quantify some important basic characteristics of all our workloads,

including the breakdown of data accesses into read and write or shared and private,

the concurrency and inherent load balance, the inherent communication-to ...