Method, Apparatus, and Device for Performing FFT

    公开(公告)号:US20240232281A1

    公开(公告)日:2024-07-11

    申请号:US18616470

    申请日:2024-03-26

    CPC classification number: G06F17/142

    Abstract: A method includes: receiving a fast Fourier transformation FFT execution request sent by an application program; obtaining first input data on which an FFT calculation needs to be performed; decomposing the FFT calculation into a plurality of calculation stages based on a cardinality of the FFT calculation, where each calculation stage includes a DFT calculation; determining a DFT calculation matrix corresponding to the DFT calculation in each calculation stage; determining, based on input data of a corresponding calculation stage when a calculation of each calculation stage is performed, a first data matrix on which a matrix operation is performed with the DFT calculation matrix; and performing a matrix multiplication calculation on the DFT calculation matrix and the first data matrix to implement the DFT calculation, and returning a calculation result to the application program after the plurality of calculation stages are completed.

    Data Processing Method, Apparatus, Device, and System

    公开(公告)号:US20250103390A1

    公开(公告)日:2025-03-27

    申请号:US18971823

    申请日:2024-12-06

    Abstract: A scheduler obtains a to-be-processed job; and controls at least one super node based on a resource requirement of the to-be-processed job to process the to-be-processed job based on a global memory pool of the super node, where the to-be-processed job is a processing request related to a distributed application. In this way, because the global memory pool is a resource that is constructed through unified addressing on storage media of nodes in the super node and that is shared by the nodes in the super node, the nodes in the super node that are coupled using a high-speed interconnection technology share and access the global memory pool to process the to-be-processed job.

Patent Agency Ranking