Method of programming linear graphs for streaming vector computation

Abstract

A method for producing a formatted description of a computation representable by a data-flow graph and computer for performing a computation so described. A source instruction is generated for each input (502, 522) of the data-flow graph, a computational instruction is generated for each node (506, 510, 514 etc) of the data-flow graph, and a sink instruction is generated for each output (520, 540) of the data-flow graph. The computation instruction for a node includes a descriptor of the operation performed at the node and a descriptor of each instruction that produces an input to the node. The formatted description is a sequential instruction list (A, B, C, . . . , J, K, L, FIG. 2) comprising source instructions, computational instructions and sink instructions. Each instruction has an instruction identifier and the descriptor of each instruction that produces an input to the node is the instruction identifier. The computer includes a program memory (618) and a number of computational units (602) interconnected by an interconnection unit (604). The computer is directed by a program of instructions stored in the program memory (618) to implement a computation representable by a data-flow graph (e.g. 100). The program of instructions is generated from a sequential instruction list.

Dependencies are inferred from the claim text.