CNIPA.AI
검색으로 돌아가기
기록

DYNAMIC ALLOCATION OF WORK AND DATA ON SPATIAL COMPUTE ARCHITECTURES

발명심사 중
20청구항 · 3 독립항
§ Ⅰ

개요

발명자

Joseph MELBER; Andra BISCA; Kristof DENOLF; Gagandeep SINGH; Alireza KHODAMORADI

IPC 분류

G6F 9/50

CPC 분류

G6F9/5016

Dynamic allocation of work and data on a spatial compute architecture in which a lead dispatch node dynamically assigns a task of an application to a selected compute tile, and routes a corresponding active message to a local data memory pool of the selected compute tile. The active message may include instructions, data, and/or configuration parameters to enable the selected compute tile to execute the task. If there is insufficient space in the local data memory pool, the lead dispatch node routes the active message to shared memory or to a local data memory pool of another compute tile, and subsequently routes the active message to the local data memory pool of the selected compute tile when space is available. Alternatively, the lead dispatch node may forward the task and the active message to another lead dispatch node.

원문 (중국어)

Dynamic allocation of work and data on a spatial compute architecture in which a lead dispatch node dynamically assigns a task of an application to a selected compute tile, and routes a corresponding active message to a local data memory pool of the selected compute tile. The active message may include instructions, data, and/or configuration parameters to enable the selected compute tile to execute the task. If there is insufficient space in the local data memory pool, the lead dispatch node routes the active message to shared memory or to a local data memory pool of another compute tile, and subsequently routes the active message to the local data memory pool of the selected compute tile when space is available. Alternatively, the lead dispatch node may forward the task and the active message to another lead dispatch node.