If non-zero, declares that this graph is going to use collective
ops and must synchronize step_ids with any other graph with this
same group_key value (in a distributed computation where tasks
run disjoint graphs).
If true, then operations (using the inter-op pool) across all
session::run() calls will be centrally scheduled, optimizing for (median
and tail) latency.
If non-zero, declares that this graph is going to use collective
ops and must synchronize step_ids with any other graph with this
same group_key value (in a distributed computation where tasks
run disjoint graphs).
int64 collective_graph_key = 1;
Returns:
The collectiveGraphKey.
getUseRunHandlerPool
booleangetUseRunHandlerPool()
If true, then operations (using the inter-op pool) across all
session::run() calls will be centrally scheduled, optimizing for (median
and tail) latency.
Consider using this option for CPU-bound workloads like inference.