parallax v1.0.0 Parallax.Graph

Repesents a graph of parallizable operations. Parallax.Executable will topsort it from root, and parallize where possible

Link to this section Summary

Link to this section Types

Link to this type t()
t() :: %Parallax.Graph{
  adj: term(),
  args: term(),
  deps: term(),
  operations: term(),
  opts: term()
}

Link to this section Functions

Link to this function add_node(seq, name, op, requirement)

Sequence the parallel operation by:

  1. Generating the max level in the dependency tree for each operation
  2. Group the operations by that level
  3. Executing each level in parallel, in sorted order