US 2026/0277554 A1 · SCHEDULING TILE PROGRAM OPERATIONS

Abstract

Processors, systems, and techniques to generate schedules of operations of tile-based programs in accordance with constants on usage of functional units of an accelerator. In at least one embodiment a compiler is to generate a dependency graph indicative of operations of a tile program and determine functional units of an accelerator that would be used to perform operations in a first order indicated by the dependency graph. The compiler is further to determine a second order in which to perform the operations of the tile program based, at least in part, on constraints on usage of the determined functional units, and generate code to perform the tile program based, at least in part, on the second order.

Claims20

Dependent claims

One or more processors, comprising:

circuitry to cause a compiler to:
generate a dependency graph indicative of operations of a tile program;
determine functional units of an accelerator that would be used to perform operations in a first order indicated by the dependency graph;
determine a second order in which to perform the operations of the tile program based, at least in part, on constraints on usage of the determined functional units;
and
generate code to perform the tile program based, at least in part, on the second order.

3 more elements

Dependencies are inferred from the claim text.

Scheduling tile program operations

Life of this patent

Scheduling tile program operations

Life of this patent

Abstract

Claims20