COMPILING AND EXECUTING A HIGH-LEVEL PROGRAM BASED ON A PRE-SEGMENTED COMPUTATIONAL GRAPH

Abstract: the present disclosure provides a method and system for efficiently compiling and executing a high-level program (e.g., artificial intelligence models) on a coarse-grained reconfigurable (cgr) processor comprising an array of cgr units. in one aspect, the system identifies a first occurrence of a section of code within the high-level program, and then creates a first instance of a hypersection based on the section of code. the system next identifies a subsequent occurrence of the section of code within the high-level program, and subsequently creates a second instance of the hypersection based on the section of code. next, the system compiles the high-level program including the first and second instance of the hypersection. subsequently, the system executes the high-level program including the first and second instance, which repeatedly executes the section of code. segmenting the high-level program based on one or more pre-defined hypersections increases both compilation speed and compiler throughout.

Inventor(s): Jianding LUO, Yuan LIN

CPC Classification: G06F8/451 ({Code distribution (considering CPU load at run-time ; load rebalancing )})

Search for rejections for patent application number 20250217125