make_graph

Graphical Representation of a Task Dependency Structure

internal

Mechanisms to parallelize dependent tasks in a manner that
optimizes the compute resources available. It provides access to "delayed"
computations, which may be parallelized using futures. It is, to an extent,
a facsimile of the 'Dask' library (<https://www.dask.org/>), for the 'Python'
language.

Jeremy Coyle

delayed

A Framework for Parallelizing Dependent Tasks

Nima Hejazi

make_graph function

<dl><dt>delayed_object</dt>
<dd>the Delayed object to graph</dd>
<dt>graph</dt>
<dd>the current graph, usually NULL</dd>
<dt>level</dt>
<dd>the level of the node to be graphed, usually NULL</dd></dl>

Arguments

Graphical Representation of a Task Dependency Structure — make_graph

<dl>

<dt>delayed_object</dt>
<dd>the Delayed object to graph</dd>


<dt>graph</dt>
<dd>the current graph, usually NULL</dd>


<dt>level</dt>
<dd>the level of the node to be graphed, usually NULL</dd>

</dl>

make_graph: Graphical Representation of a Task Dependency Structure

Description

Usage

Arguments