US 2019/0319895 A1Published application

Resource Scheduling Method And Apparatus

OwnerYan ZENG, Zhancheng LUO +1inventors

InventorsYan ZENG, Zhancheng LUO, Zongfang LIN

Life of this patent

Estimating the term…

Loading patent…

Abstract

This application discloses a resource scheduling method, so as to resolve a prior-art problem of low resource usage. The method includes: determining, by a resource scheduler, a dominant share of an ith user, and determining a dominant idle resource of an ath node; then selecting, from N users, a first user with a minimum dominant share, and selecting a first task from tasks, of the first user, to which no resources are allocated; selecting a first node from M nodes according to dominant idle resources of the M nodes, where a dominant idle resource of the selected first node is the same as a resource corresponding to a dominant share of the selected first user; and finally, scheduling, by the resource scheduler, a resource of the selected first node to the selected first user, so that the first user executes the selected first task by using the scheduled resource.

Claims12

Dependent claims

A resource scheduling method, wherein the method is used to allocate resources to tasks of N users in a distributed system, and the method comprises:

determining, by a resource scheduler, a dominant share of an ith user, wherein the dominant share is a maximum value of user resource usage ratios corresponding to m types of resources;
a user resource usage ratio corresponding to a jth type of resource is a ratio of a resource volume of the jth type of resource that has been currently allocated to the ith user to a total allocatable resource volume of the jth type of resource;
j runs over all positive integers not greater than m;
m represents a total quantity of to-be-scheduled resource types;
i runs over all positive integers not greater than N;
and N is a positive integer greater than 1;
determining, by the resource scheduler, a dominant idle resource of an ath node, wherein the dominant idle resource is a resource that is of the m types of resources and that has a maximum corresponding idle ratio;
an idle ratio corresponding to a bth type of resource is a ratio of a current idle resource volume of the bth type of resource of the ath node to a total resource volume of the bth type of resource of the ath node, b runs over all positive integers not greater than m;
a runs over all positive integers not greater than M, and M represents a total quantity of nodes with to-be-scheduled resources;
selecting, by the resource scheduler from the N users, a first user with a minimum dominant share;
selecting a first task from tasks, of the first user, to which no resources are allocated;
selecting, by the resource scheduler, a first node from M nodes according to dominant idle resources of the M nodes, wherein a dominant idle resource of the selected first node is the same as a resource corresponding to a dominant share of the selected first user;
and
scheduling, by the resource scheduler, a resource of the selected first node to the selected first user, so that the first user executes the selected first task by using the scheduled resource.

11 more elements

A resource scheduling apparatus, wherein the apparatus is configured to allocate resources to tasks of N users in a distributed system, and the apparatus comprises:

a first determining module, configured to determine a dominant share of an ith user, and determine a dominant idle resource of an ath node, wherein the dominant share is a maximum value of user resource usage ratios corresponding to m types of resources;
a user resource usage ratio corresponding to a jth type of resource is a ratio of a resource volume of the jth type of resource that has been currently allocated to the ith user to a total allocatable resource volume of the jth type of resource;
j runs over all positive integers not greater than m;
m represents a total quantity of to-be-scheduled resource types;
i runs over all positive integers not greater than N;
N is a positive integer greater than 1;
the dominant idle resource is a resource that is of the m types of resources and that has a maximum corresponding idle ratio;
an idle ratio corresponding to a bth type of resource is a ratio of a current idle resource volume of the bth type of resource of the ath node to a total resource volume of the bth type of resource of the ath node, b runs over all positive integers not greater than m;
a runs over all positive integers not greater than M, and M represents a total quantity of nodes with to-be-scheduled resources;
a first selecting module, configured to select, from the N users, a first user with a minimum dominant share determined by the first determining module, and select a first task from tasks, of the first user, to which no resources are allocated;
a second selecting module, configured to select a first node from M nodes according to dominant idle resources that are on the M nodes and that are determined by the first determining module, wherein a dominant idle resource of the selected first node is the same as a resource corresponding to a dominant share of the selected first user;
and
a scheduling module, configured to schedule a resource of the first node selected by the second selecting module to the first user selected by the first selecting module, so that the first user executes the selected first task by using the scheduled resource.

10 more elements

Dependencies are inferred from the claim text.

Facts

Application: 16/456,982Filed 28 Jun 2019
Priority: CN 201611261831.X30 Dec 2016
Published: 17 Oct 2019
Term ends: Not estimatedThe source records don’t support an estimate.

Classification7 codes

G06F 9/505
The resource being a machine, e.g. CPUs, Servers, Terminals: considering the load
G06F 9/4881
By program, e.g. task dispatcher, supervisor, operating system: scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
G06F 9/5027
To service a request: the resource being a machine, e.g. CPUs, Servers, Terminals
H04L 47/72
Admission control; Resource allocation: using reservation actions during connection setup

Family

Application16/456,982Continuation
US 2019/0319895 A1This patent

From the US filing history. Foreign family members aren’t listed.

Timeline

Citations

Open elsewhere

Building an agent or pulling many patents? Use the API or MCP server instead of scraping pages. Get an API key