Patents by Inventor Lingxin ZHANG

Lingxin ZHANG has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Method and apparatus for task scheduling based on deep reinforcement learning, and device
    Patent number: 11886993
    Abstract: Disclosed are a method and apparatus for task scheduling based on deep reinforcement learning and a device. The method comprises: obtaining multiple target subtasks to be scheduled; building target state data corresponding to the multiple target subtasks, wherein the target state data comprises a first set, a second set, a third set, and a fourth set; inputting the target state data into a pre-trained task scheduling model, to obtain a scheduling result of each target subtask; wherein, the scheduling result of each target subtask comprises a probability that the target subtask is scheduled to each target node; for each target subtask, determining a target node to which the target subtask is to be scheduled based on the scheduling result of the target subtask, and scheduling the target subtask to the determined target node.
    Type: Grant
    Filed: September 9, 2020
    Date of Patent: January 30, 2024
    Assignee: BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS
    Inventors: Qi Qi, Haifeng Sun, Jing Wang, Lingxin Zhang, Jingyu Wang, Jianxin Liao
  • METHOD AND APPARATUS FOR TASK SCHEDULING BASED ON DEEP REINFORCEMENT LEARNING, AND DEVICE
    Publication number: 20210081787
    Abstract: Disclosed are a method and apparatus for task scheduling based on deep reinforcement learning and a device. The method comprises: obtaining multiple target subtasks to be scheduled; building target state data corresponding to the multiple target subtasks, wherein the target state data comprises a first set, a second set, a third set, and a fourth set; inputting the target state data into a pre-trained task scheduling model, to obtain a scheduling result of each target subtask; wherein, the scheduling result of each target subtask comprises a probability that the target subtask is scheduled to each target node; for each target subtask, determining a target node to which the target subtask is to be scheduled based on the scheduling result of the target subtask, and scheduling the target subtask to the determined target node.
    Type: Application
    Filed: September 9, 2020
    Publication date: March 18, 2021
    Inventors: Qi QI, Haifeng SUN, Jing WANG, Lingxin ZHANG, Jingyu WANG, Jianxin LIAO