G06F30/347

FAST FPGA COMPILATION FROM SOFTWARE FLOWS THROUGH PARTIAL RECONFIGURATION AND HARDENED NETWORK-ON-CHIP

Systems or methods of the present disclosure may provide a library including multiple personas that may be pre-generated by a manufacturer and/or custom generated by a designer that may be used to implement a design onto an integrated circuit device. The design may be decomposed into one or more personas to be implemented as coarse-grained operations on the integrated circuit device, thereby decreasing compilation time experienced by the designer. The personas may be loaded into one or more regions of the integrated circuit device to realize the design. That is, the design may be realized by one persona may be implemented across multiple regions, one region may be configured by multiple personas, one persona configuring one region, or any combination thereof. Additionally or alternatively, the integrated circuit device may include networks-on-chip to improve data routing between the regions.

Shape memory storage for electrical circuit autorouting

A method to store the shapes of an electrical circuit design in a hierarchical set of arrays that inverts the layout size order by area includes defining a plurality of storage levels. Each level corresponds to a two-dimensional projection of the three-dimensional volume of the circuit layout. Accordingly, each level subsumes the entire physical space of the circuit layout. Each level may include a respective grid of slots. The slots may be rectangular. Each slot within any single level may be the same size and dimensions as every other slot in this level. Shapes are added to this storage technique based upon size, not based upon physical layer. Each slot can contain shapes from any physical layer as long as that shape fits entirely within the slot.

Shape memory storage for electrical circuit autorouting

A method to store the shapes of an electrical circuit design in a hierarchical set of arrays that inverts the layout size order by area includes defining a plurality of storage levels. Each level corresponds to a two-dimensional projection of the three-dimensional volume of the circuit layout. Accordingly, each level subsumes the entire physical space of the circuit layout. Each level may include a respective grid of slots. The slots may be rectangular. Each slot within any single level may be the same size and dimensions as every other slot in this level. Shapes are added to this storage technique based upon size, not based upon physical layer. Each slot can contain shapes from any physical layer as long as that shape fits entirely within the slot.

Modular Compilation Flows for a Programmable Logic Device

Systems or methods of the present disclosure may provide an electronic device that includes memory storing instructions; and a processor, that when executing the instructions, is to receive a design for a programmable fabric of an integrated circuit device. The instructions are also to cause the processor to cause compilation of the design into a configuration during a compilation window. The instructions further are to cause the processor to determine at least some routing for the configuration outside of the compilation window.

Modular Compilation Flows for a Programmable Logic Device

Systems or methods of the present disclosure may provide an electronic device that includes memory storing instructions; and a processor, that when executing the instructions, is to receive a design for a programmable fabric of an integrated circuit device. The instructions are also to cause the processor to cause compilation of the design into a configuration during a compilation window. The instructions further are to cause the processor to determine at least some routing for the configuration outside of the compilation window.

SCALABLE COMPUTING DEVICE
20230022507 · 2023-01-26 ·

The present disclosure relates to a network chip (108) comprising: a programmable infrastructure (201) having a plurality of access points (202); at least one chiplet communications interface (3D PLUG) suitable for interfacing with at least one chiplet (110), each chiplet communications interface (3D PLUG) being coupled to a corresponding one of the access points (202); and a plurality of network-to-network communications interfaces (206, 208, 210, 212) each suitable for interfacing with another network chip (108).

SCALABLE COMPUTING DEVICE
20230022507 · 2023-01-26 ·

The present disclosure relates to a network chip (108) comprising: a programmable infrastructure (201) having a plurality of access points (202); at least one chiplet communications interface (3D PLUG) suitable for interfacing with at least one chiplet (110), each chiplet communications interface (3D PLUG) being coupled to a corresponding one of the access points (202); and a plurality of network-to-network communications interfaces (206, 208, 210, 212) each suitable for interfacing with another network chip (108).

CONNECTION ANALYSIS METHOD FOR MULTI-PORT NESTING MODEL AND STORAGE MEDIUM
20230229838 · 2023-07-20 ·

A connection analysis method for a multi-port nested model and a medium. The method includes: acquiring instance information and nested relationships of a multi-port nested model, and building an instance relationship tree; reading port information and connection information of instances, and adding the port information and the connection information to the instance relationship tree; acquiring the port information and the connection information of the instances of each node layer by layer according to the instance relationship tree to build a connection dictionary; and acquiring port-to-port connection information of the instances by retrieving the connection dictionary to perform connection analysis on the multi-port nested model.

CONNECTION ANALYSIS METHOD FOR MULTI-PORT NESTING MODEL AND STORAGE MEDIUM
20230229838 · 2023-07-20 ·

A connection analysis method for a multi-port nested model and a medium. The method includes: acquiring instance information and nested relationships of a multi-port nested model, and building an instance relationship tree; reading port information and connection information of instances, and adding the port information and the connection information to the instance relationship tree; acquiring the port information and the connection information of the instances of each node layer by layer according to the instance relationship tree to build a connection dictionary; and acquiring port-to-port connection information of the instances by retrieving the connection dictionary to perform connection analysis on the multi-port nested model.

Applications for hardware accelerators in computing systems
11561779 · 2023-01-24 · ·

An example method of implementing an application for a hardware accelerator having a programmable device coupled to memory is disclosed. The method includes compiling source code of the application to generate logical circuit descriptions of kernel circuits; determining resource availability in a dynamic region of programmable logic of the programmable device, the dynamic region exclusive of a static region of the programmable logic programmed with a host interface configured to interface a computing system having the hardware accelerator; determining resource utilization by the kernel circuits in the dynamic region; determining fitting solutions of the kernel circuits within the dynamic region, each of the fitting solutions defining connectivity of the kernel circuits to banks of the memory; adding a memory subsystem to the application based on a selected fitting solution of the fitting solutions; and generating a kernel image configured to program the dynamic region to implement the kernel circuits and the memory subsystem.