User Guide

Contents

Exploring the Parallelism Provided by the Topology of a Graph

This example explores the parallelism provided by the topology of a graph. To make the results as predictable as possible, use a graph that is explicitly parallel, as shown below:
parallel graph
Because the
source_node
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
source_nodes
are connected to a
join_node
and then to a
queue_node
. In this graph, only the
source_nodes
do useful work. Because the parallelism is solely from the topology of the graph, one item per
source_node
is enough to through the graph. Each
source_node
has a weight of 1s(1e6). The results of scalability analysis of the graph are shown below.
speedupe is directly proportional to number of threads
The speedup is directly proportional to the number of threads.

Product and Performance Information

1

Intel's compilers may or may not optimize to the same degree for non-Intel microprocessors for optimizations that are not unique to Intel microprocessors. These optimizations include SSE2, SSE3, and SSSE3 instruction sets and other optimizations. Intel does not guarantee the availability, functionality, or effectiveness of any optimization on microprocessors not manufactured by Intel. Microprocessor-dependent optimizations in this product are intended for use with Intel microprocessors. Certain optimizations not specific to Intel microarchitecture are reserverd for Intel microprocessors. Please refer to the applicable product User and Reference Guides for more information regarding the specific instruction sets covered by this notice.

Notice revision #20110804