The goal is to devise a load more akin to the expected real-world processing patterns, and then to increase the density to establish a breaking point. Preliminary investigations focus on establishing the properties of this load and to ensure the actual computation load behaves as expected. Using the third Graph pattern prepared thus far, which produces short chains of length=2, yet immediately spread out to maximum concurrency. This leads to 5.8 Nodes / Level on average. |
||
|---|---|---|
| .. | ||
| gear | ||
| mem | ||
| DIR_INFO | ||