is serial, there is no parallelism provided from within the node. This ensures all parallelism observed is provided by the topology of the graph. Eight
are connected to a
and then to a
. In this graph, only the
do useful work. Because the parallelism is solely from the topology of the graph, one item per
is enough to through the graph. Each
has a weight of 1s(1e6). The results of scalability analysis of the graph are shown below.