利索-全球专利检索

  1. Login
  2. Sign Up

Search Results

1201 records (took 0.016 seconds)

    PLACEMENT AND SCHEDULING OF RADIO SIGNAL PROCESSING DATAFLOW OPERATIONS
    2.
    发明公开
    PLACEMENT AND SCHEDULING OF RADIO SIGNAL PROCESSING DATAFLOW OPERATIONS 审中-公开

    公开(公告)号：EP4404531A3

    公开(公告)日：2024-10-09

    申请号：EP24179922.0

    申请日：2018-04-17

    Applicant: Deepsig Inc.

    Inventor： O'SHEA, Timothy James

    IPC: G06F9/50 ,  G06F9/48 ,  H04L47/83

    CPC classification number: Y02D10/00 ,  G06F9/4881 ,  G06F2209/48420130101 ,  G06F2209/48520130101 ,  G06F9/5038 ,  G06F9/5066 ,  H04L47/83

    Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for placement and scheduling of radio signal processing dataflow operations. An example method provides a primitive radio signal processing computational dataflow graph that comprises nodes representing operations and directed edges representing data flow. The nodes and directed edges of the primitive radio signal processing computational dataflow graph are partitioned to produce a set of software kernels that, when executed on processing units of a target hardware platform, achieve a specific optimization objective. Runtime resource scheduling, including data placement for individual software kernels in the set of software kernels to efficiently execute operations on the processing units of the target hardware platform. The resources of the processing units in the target hardware platform are then allocated according to the defined runtime resource scheduling.

    TASK DEPENDENCIES
    4.
    发明公开
    TASK DEPENDENCIES 审中-公开

    公开(公告)号：EP4439293A1

    公开(公告)日：2024-10-02

    申请号：EP24165022.5

    申请日：2024-03-21

    Applicant: Imagination Technologies Limited

    Inventor： KING, Ian

    IPC: G06F9/48 ,  G06F9/38 ,  G06F9/52

    CPC classification number: G06F9/3885 ,  G06F9/4881 ,  G06F9/52 ,  G06F2209/48420130101 ,  G06F2209/48620130101

    Abstract: A method of managing task dependencies within a task queue of a GPU is described. The method comprises determining a class ID and a resource ID for a task and also for any parent task of the task and outputting the class IDs and resource IDs for both the task itself and any parent task of the task for storage associated with the task in a task queue. The class ID identifies a class of the task from a hierarchy of task classes and the resource ID of the task identifies resources allocated and/or written to by the task.

    METHOD TO EXECUTE FUNCTIONS ON HARDWARE ACCELERATORS IN HETEROGENEOUS AUTOMOTIVE SYSTEMS WITH GUARANTEED FREEDOM FROM INTERFERENCE
    8.
    发明公开
    METHOD TO EXECUTE FUNCTIONS ON HARDWARE ACCELERATORS IN HETEROGENEOUS AUTOMOTIVE SYSTEMS WITH GUARANTEED FREEDOM FROM INTERFERENCE 审中-公开

    公开(公告)号：EP4379550A1

    公开(公告)日：2024-06-05

    申请号：EP22211069.4

    申请日：2022-12-02

    Applicant: TTTech Auto AG

    Inventor： Cassadevall Saiz, Arnau ,  Serna Oliver, Ramon

    IPC: G06F9/50 ,  G06F9/52 ,  G06F9/48

    CPC classification number: G06F9/5044 ,  G06F2209/50920130101 ,  G06F9/522 ,  G06F9/4881

    Abstract: The invention relates to a method and computer system to execute functions in an automotive computer system, wherein a function comprises software components as well as computation kernels, "kernels", wherein the computer system comprises (a) computation core(s) and hardware accelerator devices, wherein each core is configured to execute software components, and wherein each accelerator is configured to execute kernels, each kernel is compatible with one or more accelerators, and a kernel can only be executed on a compatible accelerator, the software components are configured to request, when they are running on a core, the execution of one or more kernels. The computer system comprises a hardware accelerator manager component, "HWA". The HWA enqueues each kernel in one queue of an accelerator, which accelerator is compatible to the kernel, and sorts the kernels within their queues, wherein the HWA enqueues and sorts the kernels according to defined criteria. The HWA receives requests from running software components to execute specific kernels and triggers the execution of requested kernels on their accelerators. The requested kernels are executed on their accelerators taking into account the queues and their sorting order within their queues. The HWA has exclusive control of the accelerators and ensures that a kernel is only executing on its accelerator if no other kernel accelerator is executing simultaneously.

    DATA PROCESSING METHOD AND COMPUTER DEVICE
    9.
    发明公开
    DATA PROCESSING METHOD AND COMPUTER DEVICE 审中-实审

    公开(公告)号：EP4372572A2

    公开(公告)日：2024-05-22

    申请号：EP24151801.8

    申请日：2019-05-22

    Applicant: Huawei Technologies Co., Ltd.

    Inventor： GAO, Xiong ,  LI, Wei ,  ZHENG, Ming ,  LAM, Hou Fun

    IPC: G06F13/28

    CPC classification number: G06F9/4881 ,  G06F2209/48420130101 ,  G06F9/5016 ,  G06F2209/501120130101 ,  G06F9/5022

    Abstract: Embodiments of this application disclose a data processing method. The method in the embodiments of this application includes: generating, by a computer device, a target task, where the target task includes a buffer application task or a buffer release task, the target task is a successive task of a first task and is a preceding task of a second task, the first task and the second task are to-be-executed tasks between which there is a sequential dependency relationship, and when the target task is the buffer application task, a buffer corresponding to the buffer application task is used when the second task is executed, or when the target task is the buffer release task, a buffer corresponding to the buffer release task is used when the first task is executed; and after a preceding task of the target task is executed and before a successive task of the target task is executed, obtaining, by the computer device based on the target task, a buffer entry corresponding to the target task, where the buffer entry is an entry including a memory size of a buffer corresponding to the target task, a memory location of the buffer, and a memory address of the buffer, and executing the target task to apply for or release the buffer corresponding to the target task.

    JOB SCHEDULE QUALITY PREDICTION AND JOB SCHEDULING
    10.
    发明公开
    JOB SCHEDULE QUALITY PREDICTION AND JOB SCHEDULING 审中-公开

    公开(公告)号：EP4369193A1

    公开(公告)日：2024-05-15

    申请号：EP22207301.7

    申请日：2022-11-14

    Applicant: SAP SE

    Inventor： HABBANAKUPPE SURENDRANATH, Vinay

    IPC: G06F9/48 ,  G06N3/08 ,  G06N20/00

    CPC classification number: G06F9/4881 ,  G06N3/08 ,  G06N20/00

    Abstract: Some embodiments are directed to scheduling batch jobs for execution on a computer system. Multiple candidate job schedules may be generated that satisfying the defined limits. A job schedule quality may be predicted for the candidate job schedules using a predictive model previously trained on job schedule performance data. The candidate job schedule with suitable job schedule quality is used for autonomously scheduling the batch job execution.

Patent Agency Ranking