Executing complex computations using split graphs
AssigneeInternational Business Machines Corporation
InventorsNir DRUCKER, Ehud AHARONI, Hayim SHAUL
Life of this patent
Estimating the term…
Abstract
An example system includes a processor to split a graph of operations on tensors into even and odd vertical layers. In response to detecting even-even or odd-odd connections, the processor can fill the even-even or odd-odd connections using a reshape operation. The processor can also initialize outputs on a same layer type with a random packing data structure shape from a first group. The processor can then execute a breadth-first search backward based on a minimum number of shapes per layer.
Claims20
A system, comprising a processor to:
- split a graph of operations on tensors into even and odd vertical layers;
- in response to detecting even-even or odd-odd connections, fill the even-even or odd-odd connections using a reshape operation;
- initialize outputs on a same layer type with a random packing data structure shape from a group of compatible shapes;
- and
- execute a breadth-first search backward based on a minimum number of shapes per layer.
A computer-implemented method, comprising:
- splitting, via a processor, a graph of operations on tensors into even and odd vertical layers;
- in response to detecting even-even or odd-odd connections, filling, via the processor, the even-even or odd-odd connections using a reshape operation;
- initializing, via the processor, outputs on a same layer type with a random packing data structure shape from a group of compatible shapes;
- and
- executing, via the processor, a breadth-first search backward based on a minimum number of shapes per layer.
A computer program product for executing complex computations, the computer program product comprising a computer-readable storage medium having program code embodied therewith, the program code executable by a processor to cause the processor to:
- split a graph of operations on tensors into even and odd vertical layers;
- in response to detecting even-even or odd-odd connections, fill the even-even or odd-odd connections using a reshape operation;
- initialize outputs on a same layer type with a random packing data structure shape from a group of compatible shapes;
- and
- execute a breadth-first search backward based on a minimum number of shapes per layer.
Dependencies are inferred from the claim text.