知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

110 records (took 0.027 seconds)

    Paging Method and Device
    41.
    发明申请
    Paging Method and Device 审中-公开

    公开(公告)号：US20180324749A1

    公开(公告)日：2018-11-08

    申请号：US15773510

    申请日：2015-11-26

    Applicant: Huawei Technologies Co., Ltd.

    Inventor： Yu Cai ,  Da Wang ,  Jian Wang

    IPC: H04W68/02 ,  H04W76/28 ,  H04W8/18 ,  H04W72/04

    Abstract: An embodiment method includes: obtaining, by a communications device, a DRX period of a first device and an identifier of the first device; determining, according to the DRX period of the first device and the identifier of the first device, a paging occasion on which the first device pages a second device; and transmitting, by the communications device, a first paging message on the paging occasion on which the first device pages the second device, where the first paging message is used by the first device to page the second device, and the communications device is the first device or the second device.

    Scheduling method and apparatus for applying laxity correction based on task completion proportion and preset time
    43.
    发明授权
    Scheduling method and apparatus for applying laxity correction based on task completion proportion and preset time 有权

    公开(公告)号：US09990229B2

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

    申请号：US14730425

    申请日：2015-06-04

    Applicant: Huawei Technologies Co., Ltd.

    Inventor： Dongrui Fan ,  Xiaochun Ye ,  Da Wang ,  Hao Zhang

    IPC: G06F9/48 ,  G06F3/12 ,  G06F9/50

    CPC classification number: G06F9/4887 ,  G06F3/126 ,  G06F9/4881 ,  G06F9/5038

    Abstract: A real-time multi-task scheduling method and apparatus for dynamically scheduling a plurality of tasks in the computing system are disclosed. In the method, a processor of the computing system determines that laxity correction should be performed for a currently scheduled task, and then acquires a remaining execution time of the currently scheduled task according to an execution progress of the currently scheduled task and a time for which the currently scheduled task has been executed. After acquiring a laxity of the currently scheduled task according to the remaining execution time of the currently scheduled task and a deadline of the currently scheduled task, the processor determines a priority of the currently scheduled task according to the laxity of the currently scheduled task, and re-determines a priority queue according to the priority of the task. Then, the processor scheduling the plurality of tasks according to the re-determined priority queue.

    Memory access processing method, apparatus, and system
    45.
    发明授权
    Memory access processing method, apparatus, and system 有权

    公开(公告)号：US09898206B2

    公开(公告)日：2018-02-20

    申请号：US15017081

    申请日：2016-02-05

    Applicant: Huawei Technologies Co., Ltd.

    Inventor： Dongrui Fan ,  Fenglong Song ,  Da Wang ,  Xiaochun Ye

    IPC: G06F3/06 ,  G06F9/38

    CPC classification number: G06F3/0611 ,  G06F3/0656 ,  G06F3/0683 ,  G06F9/3824

    Abstract: A memory access processing method and apparatus, and a system. The method includes receiving a memory access request sent by a processor, combining multiple memory access requests received within a preset time period to form a new memory access request, where the new memory access request includes a code bit vector corresponding to memory addresses. A first code bit identifier is configured for the code bits that are in the code bit vector and corresponding to the memory addresses accessed by the multiple memory access requests. The method further includes sending the new memory access request to a memory controller, so that the memory controller executes a memory access operation on a memory address corresponding to the first code bit identifier. The method effectively improves memory bandwidth utilization.

    Real-Time Multi-Task Scheduling Method and Apparatus
    46.
    发明申请
    Real-Time Multi-Task Scheduling Method and Apparatus 有权
    实时多任务调度方法与装置

    公开(公告)号：US20150268996A1

    公开(公告)日：2015-09-24

    申请号：US14730425

    申请日：2015-06-04

    Applicant: Huawei Technologies Co., Ltd.

    Inventor： Dongrui Fan ,  Xiaochun Ye ,  Da Wang ,  Hao Zhang

    IPC: G06F9/48

    CPC classification number: G06F9/4887 ,  G06F3/126 ,  G06F9/4881 ,  G06F9/5038

    Abstract: A real-time multi-task scheduling method and apparatus for dynamically scheduling a plurality of tasks in the computing system are disclosed. In the method, a processor of the computing system determines that laxity correction should be performed for a currently scheduled task, and then acquires a remaining execution time of the currently scheduled task according to an execution progress of the currently scheduled task and a time for which the currently scheduled task has been executed. After acquiring a laxity of the currently scheduled task according to the remaining execution time of the currently scheduled task and a deadline of the currently scheduled task, the processor determines a priority of the currently scheduled task according to the laxity of the currently scheduled task, and re-determines a priority queue according to the priority of the task. Then, the processor scheduling the plurality of tasks according to the re-determined priority queue.

    Abstract translation: 公开了一种用于在计算系统中动态调度多个任务的实时多任务调度方法和装置。 在该方法中，计算系统的处理器确定应对当前调度的任务执行松弛度校正，然后根据当前调度任务的执行进度获取当前调度任务的剩余执行时间， 当前计划的任务已执行。 根据当前调度任务的剩余执行时间和当前调度任务的最后期限获取当前调度任务的松弛度后，处理器根据当前调度任务的松弛度来确定当前调度任务的优先级，以及 根据任务的优先级重新确定优先级队列。 然后，处理器根据重新确定的优先级队列调度多个任务。

    DYNAMIC SET ASSOCIATIVE CACHE APPARATUS FOR PROCESSOR AND ACCESS METHOD THEREOF
    47.
    发明申请
    DYNAMIC SET ASSOCIATIVE CACHE APPARATUS FOR PROCESSOR AND ACCESS METHOD THEREOF 有权
    用于处理器的动态集合相关缓存设备及其访问方法

    公开(公告)号：US20140344522A1

    公开(公告)日：2014-11-20

    申请号：US14328173

    申请日：2014-07-10

    Applicant: Huawei Technologies Co., Ltd.

    Inventor： Lingjun Fan ,  Shibin Tang ,  Da Wang ,  Hao Zhang ,  Dongrui Fan

    IPC: G06F12/08

    CPC classification number: G06F12/0864 ,  G06F1/3275 ,  G06F12/0833 ,  G06F12/0891 ,  G06F12/0895 ,  G06F2212/601 ,  G06F2212/6032 ,  G06F2212/621 ,  Y02B70/12 ,  Y02B70/123 ,  Y02D10/13 ,  Y02D10/14

    Abstract: The present invention provides a dynamic set associative cache apparatus for a processor. When read access occurs, the apparatus first determines a valid/invalid bit of each cache block in a cache set to be accessed, and sets, according to the valid/invalid bit of each cache block, an enable/disable bit of a cache way in which the cache block is located; then, reads valid cache blocks, compares a tag section in a memory address with a tag block in each cache block that is read, and if there is a hit, reads data from a data block in a hit cache block according to an offset section of the memory address.

    Abstract translation: 本发明提供了一种用于处理器的动态组关联高速缓存装置。 当读取访问发生时，设备首先确定要访问的高速缓存集中的每个高速缓存块的有效/无效位，并根据每个高速缓存块的有效/无效位设置缓存方式的使能/禁止位 其中高速缓存块位于其中; 然后，读取有效的高速缓存块，将存储器地址中的标签部分与读取的每个高速缓存块中的标签块进行比较，并且如果存在命中，则根据偏移部分从命中高速缓存块中的数据块读取数据 的内存地址。

    Paging determining method and apparatus
    48.
    发明授权
    Paging determining method and apparatus 有权

    公开(公告)号：US11737052B2

    公开(公告)日：2023-08-22

    申请号：US17532169

    申请日：2021-11-22

    Applicant: HUAWEI TECHNOLOGIES CO., LTD.

    Inventor： Da Wang ,  Jian Wang

    IPC: H04W68/00 ,  H04W68/02

    CPC classification number: H04W68/005

    Abstract: Embodiments of the present invention provide a paging determining method. The method includes: determining, by a network device, a first group to which a first terminal device paged on a first paging occasion belongs, where the first group belongs to the M groups; and sending, by the network device, control information based on the first group, where the control information is used to indicate paging information, and the paging information includes a device identifier of the first terminal device. Therefore, reduction of terminal device power consumption can be effectively supported.

    Method for determining priorities of scheduling requests, terminal device, and base station
    49.
    发明授权
    Method for determining priorities of scheduling requests, terminal device, and base station 有权

    公开(公告)号：US11219043B2

    公开(公告)日：2022-01-04

    申请号：US16646241

    申请日：2018-05-16

    Applicant: HUAWEI TECHNOLOGIES CO., LTD.

    Inventor： Yun Liu ,  Jian Wang ,  Da Wang ,  Yifan Xue

    IPC: H04W4/00 ,  H04W72/12

    Abstract: A method for determining priorities of scheduling requests including: determining, by a terminal device, that a first time domain resource collides with a second time domain resource, where the first time domain resource is used to transmit a first scheduling request, and the second time domain resource is used to transmit a second scheduling request; determining, by the terminal device, a priority of the first scheduling request and a priority of the second scheduling request according to first priority information of the first scheduling request and first priority information of the second scheduling request; and if the priority of the first scheduling request is higher than the priority of the second scheduling request, sending, by the terminal device, the first scheduling request to a base station.

Patent Agency Ranking