Techniques are provided herein for efficient parallel computation of multiple data-elements. The techniques include storing immediate-dependency information for data-elements, and a set of target data-elements to calculate. A directed acyclic graph for the target data-elements is based on the immediate-dependency information, and is executed, starting at the leaf nodes and in parallel, in order to determine the target data-elements.
展开▼