CN112395075A - Resource processing method and device and resource scheduling system - Google Patents

Resource processing method and device and resource scheduling system Download PDF

Info

Publication number
CN112395075A
CN112395075A CN201910754753.4A CN201910754753A CN112395075A CN 112395075 A CN112395075 A CN 112395075A CN 201910754753 A CN201910754753 A CN 201910754753A CN 112395075 A CN112395075 A CN 112395075A
Authority
CN
China
Prior art keywords
resource
task
resources
server
determining
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201910754753.4A
Other languages
Chinese (zh)
Inventor
刘小宇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alibaba Group Holding Ltd
Original Assignee
Alibaba Group Holding Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Alibaba Group Holding Ltd filed Critical Alibaba Group Holding Ltd
Priority to CN201910754753.4A priority Critical patent/CN112395075A/en
Publication of CN112395075A publication Critical patent/CN112395075A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/48—Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G06F9/5022—Mechanisms to release resources
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
    • G06F9/524—Deadlock detection or avoidance

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Debugging And Monitoring (AREA)

Abstract

The application discloses a resource processing method, a resource processing device and a resource scheduling system. Wherein, the method comprises the following steps: acquiring occupied resources corresponding to tasks running on a server in a system and residual time required by the tasks to release the resources; determining resource parameters of the server according to the occupied resources and the remaining time, wherein the resource parameters are used for expressing the load capacity of the server; a target server is determined from a plurality of servers of the system based on the resource parameters of each server. The resource scheduling method and the resource scheduling device solve the technical problem that resource scheduling imbalance in the prior art causes low resource utilization rate of a system.

Description

Resource processing method and device and resource scheduling system
Technical Field
The present application relates to the field of resource management, and in particular, to a resource processing method, a resource processing device, and a resource scheduling system.
Background
In the field of computers, resource schedulers may implement management and allocation of system resources. In practical applications, for example, in a distributed system, the total resources of the system are fixed, the resources that can be used by each task group are also limited, and the resources occupied by the tasks running in each server are usually different, so in order to improve the utilization rate of the system resources, the resource scheduler needs to schedule the system resources. However, in the prior art, in the process of dynamically scheduling the system resources, the resource scheduler performs resource scheduling inequality, which results in low resource utilization rate of the system, and even results in resource deadlock.
In view of the above problems, no effective solution has been proposed.
Disclosure of Invention
The embodiment of the application provides a resource processing method and device and a resource scheduling system, so as to at least solve the technical problem of low resource utilization rate of the system caused by unbalanced resource scheduling in the prior art.
According to an aspect of an embodiment of the present application, there is provided a resource processing method, including: acquiring occupied resources corresponding to tasks running on a server in a system and residual time required by the tasks to release the resources; determining resource parameters of the server according to the occupied resources and the remaining time, wherein the resource parameters are used for expressing the load capacity of the server; a target server is determined from a plurality of servers of the system based on the resource parameters of each server.
According to another aspect of the embodiments of the present application, there is also provided a resource processing apparatus, including: the acquisition module is used for acquiring occupied resources corresponding to tasks running on the server in the system and the residual time required by the tasks to release the resources; the first determining module is used for determining resource parameters of the server according to the occupied resources and the remaining time, wherein the resource parameters are used for expressing the load capacity of the server; and the second determining module is used for determining the target server from the plurality of servers of the system according to the resource parameter of each server.
According to another aspect of the embodiments of the present application, there is also provided a storage medium including a stored program, wherein when the program runs, a device on which the storage medium is located is controlled to execute the processing method of the resource.
According to another aspect of the embodiments of the present application, there is also provided a processor configured to execute a program, where the program executes the method for processing the resource.
According to another aspect of the embodiments of the present application, there is also provided a resource scheduling system, including: a processor; and a memory coupled to the processor for providing instructions to the processor for processing the following processing steps: acquiring occupied resources corresponding to tasks running on a server in a system and residual time required by the tasks to release the resources; determining resource parameters of the server according to the occupied resources and the remaining time, wherein the resource parameters are used for expressing the load capacity of the server; a target server is determined from a plurality of servers of the system based on the resource parameters of each server.
In the embodiment of the application, a mode of determining a server executing a task according to the load capacity of the server is adopted, after occupied resources corresponding to the task running on the server in the system and time required by the task to release the resources are obtained, resource parameters representing the load capacity of the server are determined according to the occupied resources and the remaining time, and finally, a target server executing the task to be distributed is determined according to the resource parameters of each server. It is easy to note that, in the process of determining the load capacity of the server, the resource occupied by the task running on the server and the time required by the task to release the resource are considered, so that the resource in the system can be balanced, the task to be allocated waits for the resource on the target server preferentially, and the waiting time for the task to be allocated to acquire the resource is shortened.
Therefore, the scheme provided by the application achieves the aim of carrying out balanced scheduling on the resources in the system, so that the technical effect of improving the resource utilization rate of the system is achieved, and the technical problem that the resource utilization rate of the system is low due to unbalanced resource scheduling in the prior art is solved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
FIG. 1 is a block diagram of an alternative hardware configuration of a computer terminal according to an embodiment of the present application;
FIG. 2 is a flow chart of a method of processing a resource according to an embodiment of the present application;
FIG. 3 is a schematic diagram of an alternative resource allocation according to an embodiment of the present application;
FIG. 4 is a schematic diagram of an alternative resource scheduling system according to an embodiment of the present application;
FIG. 5 is a schematic diagram of a resource handling device according to an embodiment of the present application; and
fig. 6 is a block diagram of a computer terminal according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Example 1
There is also provided, in accordance with an embodiment of the present application, a method embodiment for processing a resource, it being noted that the steps illustrated in the flowchart of the figure may be performed in a computer system such as a set of computer-executable instructions, and that, although a logical order is illustrated in the flowchart, in some cases the steps illustrated or described may be performed in an order different than here.
The method provided by the first embodiment of the present application may be executed in a mobile terminal, a computer terminal, or a similar computing device. Fig. 1 shows a hardware configuration block diagram of a computer terminal (or mobile device) for implementing a processing method of resources. As shown in fig. 1, the computer terminal 10 (or mobile device 10) may include one or more (shown as 102a, 102b, … …, 102 n) processors 102 (the processors 102 may include, but are not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA, etc.), a memory 104 for storing data, and a transmission device 106 for communication functions. Besides, the method can also comprise the following steps: a display, an input/output interface (I/O interface), a Universal Serial Bus (USB) port (which may be included as one of the ports of the I/O interface), a network interface, a power source, and/or a camera. It will be understood by those skilled in the art that the structure shown in fig. 1 is only an illustration and is not intended to limit the structure of the electronic device. For example, the computer terminal 10 may also include more or fewer components than shown in FIG. 1, or have a different configuration than shown in FIG. 1.
It should be noted that the one or more processors 102 and/or other data processing circuitry described above may be referred to generally herein as "data processing circuitry". The data processing circuitry may be embodied in whole or in part in software, hardware, firmware, or any combination thereof. Further, the data processing circuit may be a single stand-alone processing module, or incorporated in whole or in part into any of the other elements in the computer terminal 10 (or mobile device). As referred to in the embodiments of the application, the data processing circuit acts as a processor control (e.g. selection of a variable resistance termination path connected to the interface).
The memory 104 can be used to store software programs and modules of application software, such as program instructions/data storage devices corresponding to the resource processing method in the embodiment of the present application, and the processor 102 executes various functional applications and data processing, i.e., implements the above-mentioned resource processing method, by running the software programs and modules stored in the memory 104. The memory 104 may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include memory located remotely from the processor 102, which may be connected to the computer terminal 10 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission device 106 is used for receiving or transmitting data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the computer terminal 10. In one example, the transmission device 106 includes a Network adapter (NIC) that can be connected to other Network devices through a base station to communicate with the internet. In one example, the transmission device 106 can be a Radio Frequency (RF) module, which is used to communicate with the internet in a wireless manner.
The display may be, for example, a touch screen type Liquid Crystal Display (LCD) that may enable a user to interact with a user interface of the computer terminal 10 (or mobile device).
It should be noted here that in some alternative embodiments, the computer device (or mobile device) shown in fig. 1 described above may include hardware elements (including circuitry), software elements (including computer code stored on a computer-readable medium), or a combination of both hardware and software elements. It should be noted that fig. 1 is only one example of a particular specific example and is intended to illustrate the types of components that may be present in the computer device (or mobile device) described above.
Under the operating environment, the application provides a resource processing method as shown in fig. 2. Fig. 2 is a flowchart of a resource processing method according to a first embodiment of the present application, where the method includes the following steps:
step S202, acquiring occupied resources corresponding to tasks running on the server in the system and the residual time required by the tasks to release the resources.
Optionally, the resource scheduling system may be used as an execution subject in this embodiment, and the resource scheduling system may manage and allocate resources in the system, where the system in step S202 may be, but is not limited to, a distributed system.
It should be noted that the server needs to occupy a certain resource when executing the task, where the resource occupied by different tasks is different, for example, the resource occupied by accessing the content stored in the memory is different from the resource occupied by editing the picture. Optionally, the occupied resources corresponding to the task may include an occupied CPU value, where the CPU value is a numerical value without a unit, and generally, the CPU value may be a product of a core number of the occupied CPU and a constant, and the constant may be, but is not limited to, 100; the occupied resources corresponding to the tasks can also be occupied CPU values and occupied memory values.
In an optional embodiment, the resource scheduling system has a monitoring unit, and the monitoring unit can acquire occupied resources corresponding to tasks running in each server in the system, and remaining time required for the tasks to release the resources. Optionally, before the server executes the task, the resource scheduling system determines a task type of the task, and then determines, according to the task type, a size of a resource occupied by the task and a total time required for executing the task. Then, in the process of executing the task by the server, the monitoring unit monitors the running time of the task in real time and determines the remaining time of the task according to the total time. Wherein after the task is completed, the task releases the occupied resources.
And step S204, determining resource parameters of the server according to the occupied resources and the remaining time, wherein the resource parameters are used for expressing the load capacity of the server.
In an alternative embodiment, there may be a plurality of tasks running in the server, and therefore, the tasks running in the server may be divided into sections, then the resource parameter corresponding to each section is calculated, and finally, the resource parameter of the server is determined according to the resource parameters corresponding to all the sections, where the resource parameter may be represented in a form of a numerical value, for example, a larger numerical value corresponding to the resource parameter indicates a stronger load capacity of the server.
Step S206, determining a target server from a plurality of servers of the system according to the resource parameter of each server.
In step S206, the target server is a server on which a task to be assigned is waiting. After determining the target server for the task to be allocated, the task to be allocated can wait on the waiting queue, and when the resource in the target server is idle, the target server acquires the task to be allocated from the waiting queue and executes the task. Optionally, each server corresponds to one waiting queue, and after the resource scheduling system determines a target server for the task to be allocated, the task to be allocated is set in the waiting queue corresponding to the target server.
Optionally, after determining the resource parameter of each server in the system, the resource scheduling system determines the server with the highest resource parameter as the target server. It is easy to note that the size of the resource parameter represents the load capacity of the server, and the server with the highest resource parameter, i.e. the server with the strongest load capacity, is preferably selected as the server to be assigned with the task, and when the resource in the target server is idle, the resource is preferentially assigned to the task to be assigned waiting for the resource in the target server. The target server has stronger load capacity, so that the target server executes the task to be distributed, and the aim of improving the execution efficiency of the task can be achieved.
Based on the solutions defined in steps S202 to S206, it can be known that, in a manner of determining a server executing a task according to the load capacity of the server, after acquiring occupied resources corresponding to the tasks running on the server in the system and the time required for the task to release the resources, resource parameters representing the load capacity of the server are determined according to the occupied resources and the remaining time, and finally, a target server executing the task to be allocated is determined according to the resource parameters of each server.
It is easy to note that, in the process of determining the load capacity of the server, the resource occupied by the task running on the server and the time required by the task to release the resource are considered, so that the resource in the system can be balanced, the task to be allocated waits for the resource on the target server preferentially, and the waiting time for the task to be allocated to acquire the resource is shortened.
Therefore, the scheme provided by the application achieves the aim of carrying out balanced scheduling on the resources in the system, so that the technical effect of improving the resource utilization rate of the system is achieved, and the technical problem that the resource utilization rate of the system is low due to unbalanced resource scheduling in the prior art is solved.
In an optional embodiment, before acquiring occupied resources corresponding to a task running on a server in the system, the resource scheduling system further acquires a resource request of the task to be allocated, determines a target group to which the task to be allocated belongs, then judges whether the remaining resources of the target group are greater than the resources required by the task to be allocated, determines that the remaining resources of the target group are greater than the resources required by the task to be allocated, and enters a step of acquiring occupied resources corresponding to the task running on the server in the system and the remaining time required by the task to release the resources.
In the above process, the resource request includes resources required by the task to be allocated, and the resource request may be an aon (all or nothing) request, where the resource request is completed only when all resource requirements are successfully scheduled. Optionally, the client or the server may send a resource request to the system, and the resource scheduling system determines a target group to which the task to be allocated belongs according to the resource required by the task to be allocated, where each group has a preset upper limit of the resource. And the resource scheduling system detects the occupied resources in the target grouping and then determines the residual resources of the target grouping according to the resource upper limit and the occupied resources. In order to improve the success rate of resource allocation and avoid the problem of resource deadlock and waste caused by using only part of resources for the task to be allocated, the resource scheduling system executes step S202 only when the remaining resources of the target packet are greater than the resources required by the task to be allocated.
Optionally, the resource scheduling system may determine the target group to which the task to be allocated belongs by detecting the task type of the task to be allocated, where in this scenario, different target groups include different types of tasks. Optionally, the resource scheduling system may further determine the target group by detecting the size of the resource required by the task to be allocated, for example, if the remaining resource of the target group is greater than the resource required by the task to be allocated, it is determined that the task to be allocated belongs to the target group.
It should be noted that the target group may include a plurality of tasks, and the total amount of resources used by the tasks in the target group is fixed, that is, the total amount of resources corresponding to the target group is fixed, in other words, the target group has a resource upper limit value. In addition, the target grouping can also have a resource lower limit value, namely if the total amount of resources required by all tasks in the target grouping is smaller than the resource lower limit value, the resource scheduling system automatically allocates the resources with the total amount of resources being the resource lower limit value to the target grouping; if the total amount of resources required by all tasks in the target group is greater than or equal to the lower limit value of the resources, the resource scheduling system allocates a preset total amount of resources to the target group, wherein the preset total amount of resources can be set according to actual requirements, and optionally, the preset total amount of resources can be the lower limit value of the resources.
It should be noted that, at the same time, the total amount of resources required by different target packets is different, for example, at the same time, some target packets require a larger amount of resources and some target packets require a smaller amount of resources, and in order to improve the utilization rate of system resources, the resource scheduling system needs to perform resource scheduling for each target packet. In addition, because the total resource of the system is fixed, the available resource of each target group is also limited and competitive, when the resource scheduling system performs resource allocation, a weight value can be configured for each target group, and the larger the weight value is, the larger the total amount of the available resource corresponding to the target group is.
Further, after the occupied resources corresponding to the tasks running on the server in the system and the residual time required by the tasks to release the resources are obtained, the resource scheduling system determines the weight values of the tasks according to the residual time, then determines the product of the occupied resources of the tasks and the weight values of the tasks as the resource parameters of the tasks, and finally determines the sum of the resource parameters corresponding to all the tasks running on the server as the resource parameters of the server.
Optionally, the remaining time and the weight value are in an inverse proportional relationship, for example, as shown in a resource allocation diagram of fig. 3, in fig. 3, each vertical column represents one server, for example, the first column represents a physical machine, the second column represents a virtual machine, boxes of different lines represent the remaining time, the box corresponding to 0 to 60 seconds is a solid line box, and the corresponding weight value is 29The residual time is 60-120 seconds, and the corresponding weight value is 25The residual time is 120-180 seconds, and the corresponding weight value is 21. The resource scheduling system can determine a weight value corresponding to the task according to the relationship between the remaining time and the weight value, further take the product of the weight value corresponding to the task and the occupied resource as a resource parameter of the task, and finally sum the resource parameters of all tasks in the server to obtain the resource parameter corresponding to the server.
Further, the resource scheduling system may determine a weight value for the task from the remaining time based on the wall time, where the wall time is stored in a core variable of the system that records the time in a year, month, day format in the real world.
Specifically, the resource scheduling system determines a time period to which the current time belongs, wherein the corresponding relation between the remaining time and the weight value is different in different time periods; and then, according to the time period to which the current moment belongs, acquiring the corresponding relation between the remaining time and the weight value, and determining the weight value of the task according to the remaining time and the corresponding relation.
It should be noted that different time periods have different task operation characteristics, for example, the server executes more tasks and the load capacity of the server is poor in the time period from 8 o 'clock earlier to 8 o' clock later, and the server executes less tasks and the load capacity of the server is strong in the late night. Therefore, the weight value corresponding to the task is determined according to the time period to which the current moment belongs, the target server with the quick and free resources can be selected more accurately, and the waiting time for the task to be allocated to acquire the resources is shortened.
In an alternative embodiment, the resource scheduling system may also use memory dimensions to determine resource parameters for tasks. Specifically, the resource scheduling system obtains a first product of an occupied CPU value of the task and a weight value of the task, then obtains a second product of an occupied memory value of the task and the weight value of the task, and finally determines that the sum of the first product and the second product is a resource parameter of the task.
Further, after the resource parameters of the tasks are obtained, the resource scheduling system performs summation calculation on the resource parameters of all the tasks in the server to obtain the resource parameters of the server. After the resource parameters of each server are determined, the resource scheduling system sorts the servers according to the size of the resource parameters, and selects the server with the highest resource parameter as a target server to execute the task to be allocated.
In an optional embodiment, the resource scheduling system may further perform interactive preemption, where the interactive preemption is a resource preemption protocol combining inquiry and response, and in the protocol, the resource scheduling system sends a preemption request to a task occupying a resource, and the task actively responds to the preemption request and returns a part of the resource to achieve resource preemption.
Specifically, after a target server is determined from a plurality of servers of the system according to the resource parameters of each server, the resource scheduling system also detects the waiting time of the task to be allocated, wherein the waiting time of the task to be allocated is the time from the moment when the task to be allocated is received to the current moment; if the waiting time of the task to be distributed exceeds the preset time, initiating a preemption request to a target task in a target server; and if response information of the target task responding to the preemption request is received, allocating the resources released by the target task to the task to be allocated.
In the above process, the target task is the task with the lowest priority running on the target server. In the process of distributing the resources released by the target tasks to the tasks to be distributed, the resource scheduling system detects the residual resources of target groups to which the tasks to be distributed belong, wherein each group has a preset upper limit of resources; and if the residual resources of the target group are smaller than the residual required resources, recalling the resources which are allocated to the tasks to be allocated, wherein the residual required resources are the resources which are required by the tasks to be allocated besides the resources which are allocated to the tasks to be allocated.
It should be noted that, the resource scheduling system adopts an interactive preemption mode, and when the waiting time of the task to be allocated exceeds the preset time, the target task with low priority is selected from the target server with the highest resource parameter to send out an interactive preemption request, so that the running task with low priority can actively give up resources to be allocated to the task to be allocated, thereby achieving the result of allocation acceleration.
Specifically, after receiving the resource request, the resource scheduling system allocates resources according to a resource reservation scheme, and selects a server with the highest resource parameter as a server waiting for a task to be allocated in the process of allocating resources. When the task to be allocated waits for the server, if the fact that available residual resources in the target grouping cannot meet the requirements of the task to be allocated is detected, the resource scheduling system actively recalls the allocated part of task resources, and therefore resource deadlock caused by dynamic adjustment of the target grouping is avoided.
In an alternative embodiment, fig. 4 shows a schematic diagram of an alternative resource scheduling system, and in fig. 4, the default scheduler is a default scheduler in the system, and the default scheduler can be used for resource allocation, and can also store task information, resource occupation information, and information of remaining time required by a task to release resources. As can be seen from FIG. 4, the scheduler includes a Quota group management module, a available resource management module free res, an occupied resource management module Running Queue, a resource parameter processing module Virtual Mach, a task list management module Waiting Queue Manager, and a device management module Machine Manager. The system comprises a Quota group management module, a Quota group management module and a task allocation module, wherein the Quota group management module is used for managing information of target groups to which tasks to be allocated belong, and the target groups are Quota groups; the available resource management module free res is used for managing available resources in the system; the occupied resource management module Running Queue is used for managing occupied resources corresponding to tasks Running on the server in the system; the resource parameter processing module Virtual Mach is used for determining resource parameters of the server according to the residual time required by the task to release the resources and by combining the available machine list; the task list management module Waiting Queue Manager is used for managing the list of the tasks Waiting for the resources. In fig. 4, the AON scheduler is a dedicated scheduler that handles large-volume resources.
Specifically, the interaction process between the AON scheduler and the default scheduler is as follows: first, the AON scheduler sends a resource request to the default scheduler (e.g., S41 in fig. 4), while the AON scheduler serves as an observer to obtain the remaining resources of the task on the server, the resource occupancy amount, and the resource parameters of each available server from the default scheduler (e.g., S42 and S43 in fig. 4), and finally, the AON scheduler makes a decision according to the resource parameters of each available server to make the task to be allocated wait on the target server, i.e., to determine the server with the highest resource parameter as the target server (e.g., S44 in fig. 4).
According to the scheme, the resources required by the tasks to be distributed are combined with the target groups to perform overall scheduling for the granularity, so that resource waste and deadlock caused by resource excess required by each independent task are avoided. In addition, a target server with high resource flow rate (namely large resource parameter) is selected through the resource parameters of the servers, and the task to be distributed waits for the resource on the target server preferentially, so that the waiting time for the task to acquire the resource is shortened, and the utilization rate of the system resource is improved.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
Through the above description of the embodiments, those skilled in the art can clearly understand that the processing method of the resource according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present application.
Example 2
According to an embodiment of the present application, there is also provided a resource processing apparatus for implementing the resource processing method, as shown in fig. 5, the apparatus 50 includes: an acquisition module 501, a first determination module 503, and a second determination module 505.
The acquiring module 501 is configured to acquire occupied resources corresponding to a task running on a server in a system and remaining time required for the task to release the resources; a first determining module 503, configured to determine a resource parameter of the server according to the occupied resource and the remaining time, where the resource parameter is used to indicate a load capacity of the server; a second determining module 505, configured to determine a target server from the plurality of servers of the system according to the resource parameter of each server.
It should be noted here that the obtaining module 501, the first determining module 503 and the second determining module 505 correspond to steps S202 to S206 in embodiment 1, and the three modules are the same as the corresponding steps in the implementation example and the application scenario, but are not limited to the disclosure in the first embodiment. It should be noted that the modules described above as part of the apparatus may be run in the computer terminal 10 provided in the first embodiment.
In an optional embodiment, the processing apparatus of the resource further includes: the device comprises a first obtaining module, a third determining module, a judging module and a fourth determining module. The system comprises a first acquisition module, a second acquisition module and a resource allocation module, wherein the first acquisition module is used for acquiring a resource request of a task to be allocated before acquiring occupied resources corresponding to the task running on a server in the system, and the resource request comprises resources required by the task to be allocated; the third determining module is used for determining target groups to which the tasks to be distributed belong, wherein each group has a preset resource upper limit; the judging module is used for judging whether the residual resources of the target group are larger than the resources required by the tasks to be allocated; and the fourth determining module is used for determining that the residual resources of the target group are larger than the resources required by the tasks to be allocated, and entering the steps of acquiring occupied resources corresponding to the tasks running on the server in the system and the residual time required by the tasks to release the resources.
In an alternative embodiment, the first determining module comprises: a fifth determination module, a sixth determination module, and a seventh determination module. The fifth determining module is used for determining a weight value of the task according to the remaining time, wherein the remaining time and the weight value are in an inverse proportion relation; the sixth determining module is used for determining that the product of the occupied resources of the task and the weight value of the task is a resource parameter of the task; and the seventh determining module is used for determining that the sum of the resource parameters corresponding to all the tasks running on the server is the resource parameter of the server.
In an alternative embodiment, the fifth determining module includes: the device comprises an eighth determining module, a second obtaining module and a ninth determining module. The eighth determining module is configured to determine a time period to which the current time belongs, where, in different time periods, corresponding relationships between remaining time and a weight value are different; the second obtaining module is used for obtaining the corresponding relation between the remaining time and the weight value according to the time period to which the current moment belongs; and the ninth determining module is used for determining the weight value of the task according to the remaining time and the corresponding relation.
Optionally, the occupied resources include: occupied CPU value.
In an alternative embodiment, the occupied resources include: an occupied CPU value and an occupied memory value, wherein the sixth determining module includes: the device comprises a third obtaining module, a fourth obtaining module and a tenth determining module. The third acquisition module is used for acquiring a first product of an occupied CPU value of the task and a weight value of the task; the fourth acquisition module is used for acquiring a second product of the occupied memory value of the task and the weight value of the task; and the tenth determining module is used for determining that the sum of the first product and the second product is the resource parameter of the task.
In an alternative embodiment, the second determining module comprises: an eleventh determining module. The eleventh determining module is configured to determine that the server with the highest resource parameter is the target server.
In an optional embodiment, the processing apparatus of the resource further includes: the device comprises a first detection module, a first processing module and a distribution module. The system comprises a first detection module, a second detection module and a third detection module, wherein the first detection module is used for detecting the waiting time of a task to be distributed after a target server is determined from a plurality of servers of the system according to the resource parameters of each server, and the waiting time of the task to be distributed is the time from the moment when the task to be distributed is received to the current moment; the first processing module is used for initiating a preemption request to a target task in a target server if the waiting time of the task to be distributed exceeds the preset time; and the allocation module is used for allocating the resources released by the target task to the task to be allocated if response information of the target task responding to the preemption request is received.
Optionally, the target task is a task with the lowest priority running on the target server.
In an optional embodiment, the processing apparatus of the resource further includes: the second detection module and the second processing module. The second detection module is used for detecting the residual resources of a target group to which the task to be allocated belongs in the process of allocating the resources released by the target task to the task to be allocated, wherein each group has a preset upper limit of resources; and the second processing module is used for recalling the resources which are allocated to the tasks to be allocated if the residual resources of the target grouping are smaller than the residual required resources, wherein the residual required resources are the resources which are required by the tasks to be allocated besides the resources which are allocated to the tasks to be allocated.
Example 3
According to an embodiment of the present application, there is also provided a resource scheduling system for implementing the method for processing resources, the system including: a processor and a memory.
The memory is connected with the processor and used for providing instructions for the processor to process the following processing steps: acquiring occupied resources corresponding to tasks running on a server in a system and residual time required by the tasks to release the resources; determining resource parameters of the server according to the occupied resources and the remaining time, wherein the resource parameters are used for expressing the load capacity of the server; a target server is determined from a plurality of servers of the system based on the resource parameters of each server.
As can be seen from the above, by determining the servers executing the tasks according to the load capacities of the servers, after acquiring occupied resources corresponding to the tasks running on the servers in the system and the time required by the tasks to release the resources, resource parameters characterizing the load capacities of the servers are determined according to the occupied resources and the remaining time, and finally, a target server executing the tasks to be allocated is determined according to the resource parameters of each server.
It is easy to note that, in the process of determining the load capacity of the server, the resource occupied by the task running on the server and the time required by the task to release the resource are considered, so that the resource in the system can be balanced, the task to be allocated waits for the resource on the target server preferentially, and the waiting time for the task to be allocated to acquire the resource is shortened.
Therefore, the scheme provided by the application achieves the aim of carrying out balanced scheduling on the resources in the system, so that the technical effect of improving the resource utilization rate of the system is achieved, and the technical problem that the resource utilization rate of the system is low due to unbalanced resource scheduling in the prior art is solved.
It should be noted that the resource scheduling system provided in this embodiment can execute the method for processing the resource in embodiment 1, and related contents are already described in embodiment 1, and are not described herein again.
Example 4
The embodiment of the application can provide a computer terminal, and the computer terminal can be any one computer terminal device in a computer terminal group. Optionally, in this embodiment, the computer terminal may also be replaced with a terminal device such as a mobile terminal.
Optionally, in this embodiment, the computer terminal may be located in at least one network device of a plurality of network devices of a computer network.
In this embodiment, the computer terminal may execute the program code of the following steps in the resource processing method: acquiring occupied resources corresponding to tasks running on a server in a system and residual time required by the tasks to release the resources; determining resource parameters of the server according to the occupied resources and the remaining time, wherein the resource parameters are used for expressing the load capacity of the server; a target server is determined from a plurality of servers of the system based on the resource parameters of each server.
Optionally, fig. 6 is a block diagram of a computer terminal according to an embodiment of the present application. As shown in fig. 6, the computer terminal 10 may include: one or more (only one of which is shown) processors 602, memory 604, and a peripherals interface 606.
The memory may be configured to store software programs and modules, such as program instructions/modules corresponding to the resource processing method and apparatus in the embodiments of the present application, and the processor executes various functional applications and data processing by running the software programs and modules stored in the memory, that is, implements the resource processing method. The memory may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memories may further include a memory located remotely from the processor, which may be connected to the terminal 10 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The processor can call the information and application program stored in the memory through the transmission device to execute the following steps: acquiring occupied resources corresponding to tasks running on a server in a system and residual time required by the tasks to release the resources; determining resource parameters of the server according to the occupied resources and the remaining time, wherein the resource parameters are used for expressing the load capacity of the server; determining a target server from a plurality of servers of the system according to the resource parameters of each server, wherein the target server is a server waiting for a task to be allocated, and occupied resources comprise: occupied CPU value.
Optionally, the processor may further execute the program code of the following steps: acquiring a resource request of a task to be allocated before acquiring occupied resources corresponding to the task running on a server in a system, wherein the resource request comprises resources required by the task to be allocated; determining target groups to which tasks to be allocated belong, wherein each group has a preset resource upper limit; judging whether the residual resources of the target group are larger than the resources required by the tasks to be allocated; and determining that the residual resources of the target group are larger than the resources required by the tasks to be distributed, and entering the steps of acquiring occupied resources corresponding to the tasks running on the server in the system and obtaining the residual time required by the tasks to release the resources.
Optionally, the processor may further execute the program code of the following steps: determining a weight value of the task according to the remaining time, wherein the remaining time and the weight value are in an inverse proportional relation; determining the product of occupied resources of the task and the weight value of the task as a resource parameter of the task; and determining the sum of the resource parameters corresponding to all the tasks running on the server as the resource parameter of the server.
Optionally, the processor may further execute the program code of the following steps: determining the time period to which the current moment belongs, wherein the corresponding relation between the remaining time and the weight value is different in different time periods; acquiring a corresponding relation between the remaining time and the weight value according to the time period to which the current moment belongs; and determining the weight value of the task according to the remaining time and the corresponding relation.
Optionally, the processor may further execute the program code of the following steps: acquiring a first product of an occupied CPU value of a task and a weighted value of the task; acquiring a second product of an occupied memory value of the task and a weighted value of the task; determining the sum of the first product and the second product as a resource parameter of the task, wherein the occupied resource comprises: an occupied CPU value and an occupied memory value.
Optionally, the processor may further execute the program code of the following steps: and determining the server with the highest resource parameter as a target server.
Optionally, the processor may further execute the program code of the following steps: after a target server is determined from a plurality of servers of a system according to resource parameters of each server, detecting waiting time of a task to be distributed, wherein the waiting time of the task to be distributed is the time from the moment when the task to be distributed is received to the current moment; if the waiting time of the task to be distributed exceeds the preset time, initiating a preemption request to a target task in a target server; and if response information of the target task responding to the preemption request is received, allocating the resources released by the target task to the task to be allocated, wherein the target task is the task with the lowest priority running on the target server.
Optionally, the processor may further execute the program code of the following steps: in the process of distributing the resources released by the target tasks to the tasks to be distributed, detecting the residual resources of target groups to which the tasks to be distributed belong, wherein each group has a preset upper limit of resources; and if the residual resources of the target group are smaller than the residual required resources, recalling the resources which are allocated to the tasks to be allocated, wherein the residual required resources are the resources which are required by the tasks to be allocated besides the resources which are allocated to the tasks to be allocated.
It can be understood by those skilled in the art that the structure shown in fig. 6 is only an illustration, and the computer terminal may also be a terminal device such as a smart phone (e.g., an Android phone, an iOS phone, etc.), a tablet computer, a palmtop computer, a Mobile Internet Device (MID), a PAD, and the like. Fig. 6 is a diagram illustrating a structure of the electronic device. For example, the computer terminal 10 may also include more or fewer components (e.g., network interfaces, display devices, etc.) than shown in FIG. 6, or have a different configuration than shown in FIG. 6.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by a program instructing hardware associated with the terminal device, where the program may be stored in a computer-readable storage medium, and the storage medium may include: flash disks, Read-Only memories (ROMs), Random Access Memories (RAMs), magnetic or optical disks, and the like.
Example 5
Embodiments of the present application also provide a storage medium. Optionally, in this embodiment, the storage medium may be configured to store a program code executed by the resource processing method provided in the first embodiment.
Optionally, in this embodiment, the storage medium may be located in any one of computer terminals in a computer terminal group in a computer network, or in any one of mobile terminals in a mobile terminal group.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: acquiring occupied resources corresponding to tasks running on a server in a system and residual time required by the tasks to release the resources; determining resource parameters of the server according to the occupied resources and the remaining time, wherein the resource parameters are used for expressing the load capacity of the server; a target server is determined from a plurality of servers of the system based on the resource parameters of each server.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: acquiring a resource request of a task to be allocated before acquiring occupied resources corresponding to the task running on a server in a system, wherein the resource request comprises resources required by the task to be allocated; determining target groups to which tasks to be allocated belong, wherein each group has a preset resource upper limit; judging whether the residual resources of the target group are larger than the resources required by the tasks to be allocated; and determining that the residual resources of the target group are larger than the resources required by the tasks to be distributed, and entering the steps of acquiring occupied resources corresponding to the tasks running on the server in the system and obtaining the residual time required by the tasks to release the resources.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: determining a weight value of the task according to the remaining time, wherein the remaining time and the weight value are in an inverse proportional relation; determining the product of occupied resources of the task and the weight value of the task as a resource parameter of the task; and determining the sum of the resource parameters corresponding to all the tasks running on the server as the resource parameter of the server.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: determining the time period to which the current moment belongs, wherein the corresponding relation between the remaining time and the weight value is different in different time periods; acquiring a corresponding relation between the remaining time and the weight value according to the time period to which the current moment belongs; and determining the weight value of the task according to the remaining time and the corresponding relation.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: acquiring a first product of an occupied CPU value of a task and a weighted value of the task; acquiring a second product of an occupied memory value of the task and a weighted value of the task; determining the sum of the first product and the second product as a resource parameter of the task, wherein the occupied resource comprises: an occupied CPU value and an occupied memory value.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: and determining the server with the highest resource parameter as a target server.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: after a target server is determined from a plurality of servers of a system according to resource parameters of each server, detecting waiting time of a task to be distributed, wherein the waiting time of the task to be distributed is the time from the moment when the task to be distributed is received to the current moment; if the waiting time of the task to be distributed exceeds the preset time, initiating a preemption request to a target task in a target server; and if response information of the target task responding to the preemption request is received, allocating the resources released by the target task to the task to be allocated, wherein the target task is the task with the lowest priority running on the target server.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: in the process of distributing the resources released by the target tasks to the tasks to be distributed, detecting the residual resources of target groups to which the tasks to be distributed belong, wherein each group has a preset upper limit of resources; and if the residual resources of the target group are smaller than the residual required resources, recalling the resources which are allocated to the tasks to be allocated, wherein the residual required resources are the resources which are required by the tasks to be allocated besides the resources which are allocated to the tasks to be allocated.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
In the above embodiments of the present application, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed technology can be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
The foregoing is only a preferred embodiment of the present application and it should be noted that those skilled in the art can make several improvements and modifications without departing from the principle of the present application, and these improvements and modifications should also be considered as the protection scope of the present application.

Claims (14)

1. A method for processing resources, comprising:
acquiring occupied resources corresponding to tasks running on a server in a system and the residual time required by the tasks to release the resources;
determining a resource parameter of the server according to the occupied resource and the remaining time, wherein the resource parameter is used for representing the load capacity of the server;
determining a target server from a plurality of said servers of said system based on resource parameters of each said server.
2. The method of claim 1, wherein prior to obtaining occupied resources corresponding to tasks running on a server in a system, the method further comprises:
acquiring a resource request of a task to be allocated, wherein the resource request comprises resources required by the task to be allocated;
determining target groups to which tasks to be allocated belong, wherein each group has a preset resource upper limit;
judging whether the residual resources of the target group are larger than the resources required by the task to be allocated or not;
and determining that the residual resources of the target group are larger than the resources required by the tasks to be distributed, and entering the step of acquiring occupied resources corresponding to the tasks running on the server in the system and the residual time required by the tasks to release the resources.
3. The method of claim 1, wherein determining resource parameters of the server according to the occupied resources and the remaining time comprises:
determining a weight value of the task according to the remaining time, wherein the remaining time and the weight value are in an inverse proportional relation;
determining the product of the occupied resources of the task and the weight value of the task as the resource parameter of the task;
and determining the sum of the resource parameters corresponding to all the tasks running on the server as the resource parameter of the server.
4. The method of claim 3, wherein determining the weight value of the task according to the remaining time comprises:
determining a time period to which the current moment belongs, wherein the corresponding relation between the remaining time and the weight value is different in different time periods;
acquiring the corresponding relation between the remaining time and the weighted value according to the time period to which the current moment belongs;
and determining the weight value of the task according to the remaining time and the corresponding relation.
5. The method of claim 3, wherein the occupied resources comprise: occupied CPU value.
6. The method of claim 3, wherein the occupied resources comprise: the method comprises the following steps of determining a product of occupied resources of a task and a weight value of the task as a resource parameter of the task, wherein the occupied CPU value and the occupied memory value comprise:
acquiring a first product of an occupied CPU value of the task and a weight value of the task;
acquiring a second product of the occupied memory value of the task and the weight value of the task;
and determining the sum of the first product and the second product as the resource parameter of the task.
7. The method of claim 1, wherein determining a target server from a plurality of the servers of the system based on the resource parameters of each of the servers comprises:
and determining the server with the highest resource parameter as the target server.
8. The method of claim 1, wherein after determining a target server from a plurality of the servers of the system based on the resource parameters of each of the servers, the method further comprises:
detecting waiting time of a task to be distributed, wherein the waiting time of the task to be distributed is the time from the moment of receiving the task to be distributed to the current moment;
if the waiting time of the task to be distributed exceeds the preset time, initiating a preemption request to a target task in the target server;
and if response information that the target task responds to the preemption request is received, allocating the resources released by the target task to the task to be allocated.
9. The method of claim 8, wherein the target task is a lowest priority task running on the target server.
10. The method according to claim 8, wherein in the process of allocating the resource released by the target task to the task to be allocated, the method further comprises:
detecting the residual resources of a target group to which the task to be distributed belongs, wherein each group has a preset resource upper limit;
and if the residual resources of the target group are less than the residual required resources, recalling the resources which are allocated to the tasks to be allocated, wherein the residual required resources are the resources which are required by the tasks to be allocated besides the resources which are allocated to the tasks to be allocated.
11. An apparatus for processing a resource, comprising:
the acquisition module is used for acquiring occupied resources corresponding to tasks running on the server in the system and the residual time required by the tasks for releasing the resources;
a first determining module, configured to determine a resource parameter of the server according to the occupied resource and the remaining time, where the resource parameter is used to indicate a load capacity of the server;
a second determining module for determining a target server from the plurality of servers of the system based on the resource parameter of each of the servers.
12. A storage medium, characterized in that the storage medium comprises a stored program, wherein when the program runs, a device in which the storage medium is located is controlled to execute the processing method of the resource according to any one of claims 1 to 10.
13. A processor, configured to execute a program, wherein the program executes to perform the processing method of the resource according to any one of claims 1 to 10.
14. A resource scheduling system, comprising:
a processor; and
a memory coupled to the processor for providing instructions to the processor for processing the following processing steps:
acquiring occupied resources corresponding to tasks running on a server in a system and the residual time required by the tasks to release the resources;
determining a resource parameter of the server according to the occupied resource and the remaining time, wherein the resource parameter is used for representing the load capacity of the server;
determining a target server from a plurality of said servers of said system based on resource parameters of each said server.
CN201910754753.4A 2019-08-15 2019-08-15 Resource processing method and device and resource scheduling system Pending CN112395075A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910754753.4A CN112395075A (en) 2019-08-15 2019-08-15 Resource processing method and device and resource scheduling system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910754753.4A CN112395075A (en) 2019-08-15 2019-08-15 Resource processing method and device and resource scheduling system

Publications (1)

Publication Number Publication Date
CN112395075A true CN112395075A (en) 2021-02-23

Family

ID=74601667

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910754753.4A Pending CN112395075A (en) 2019-08-15 2019-08-15 Resource processing method and device and resource scheduling system

Country Status (1)

Country Link
CN (1) CN112395075A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112948084A (en) * 2021-03-03 2021-06-11 上海御微半导体技术有限公司 Task scheduling method and system
CN112995613A (en) * 2021-05-20 2021-06-18 武汉中科通达高新技术股份有限公司 Analysis resource management method and device
CN113568737A (en) * 2021-06-30 2021-10-29 北京达佳互联信息技术有限公司 Hardware resource allocation method and device
CN113608878A (en) * 2021-08-18 2021-11-05 上海德拓信息技术股份有限公司 Task distributed scheduling method and system based on resource weight calculation

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112948084A (en) * 2021-03-03 2021-06-11 上海御微半导体技术有限公司 Task scheduling method and system
CN112948084B (en) * 2021-03-03 2024-05-10 上海御微半导体技术有限公司 Task scheduling method and system
CN112995613A (en) * 2021-05-20 2021-06-18 武汉中科通达高新技术股份有限公司 Analysis resource management method and device
CN113568737A (en) * 2021-06-30 2021-10-29 北京达佳互联信息技术有限公司 Hardware resource allocation method and device
CN113568737B (en) * 2021-06-30 2024-03-26 北京达佳互联信息技术有限公司 Hardware resource allocation method and device
CN113608878A (en) * 2021-08-18 2021-11-05 上海德拓信息技术股份有限公司 Task distributed scheduling method and system based on resource weight calculation

Similar Documents

Publication Publication Date Title
US11416307B2 (en) System and method for processing task resources
CN112395075A (en) Resource processing method and device and resource scheduling system
CN108683720B (en) Container cluster service configuration method and device
CN107241281B (en) Data processing method and device
JP2021521518A (en) Virtual machine scheduling method and equipment
CN103019853A (en) Method and device for dispatching job task
CN103428290A (en) Method and device for pushing data
CN107295090A (en) A kind of method and apparatus of scheduling of resource
CN110290399B (en) Data distribution method, system, device and computer readable storage medium
CN112988390A (en) Calculation power resource allocation method and device
CN109495542A (en) Load allocation method and terminal device based on performance monitoring
CN111131841A (en) Live indirect access method and device, electronic equipment and storage medium
CN109002364A (en) Optimization method, electronic device and the readable storage medium storing program for executing of interprocess communication
CN108241535B (en) Resource management method and device and server equipment
CN104202305A (en) Transcoding processing method and device, server
CN114629960A (en) Resource scheduling method, device, system, device, medium, and program product
CN108924128A (en) A kind of mobile terminal and its method for limiting, the storage medium of interprocess communication
CN111858035A (en) FPGA equipment allocation method, device, equipment and storage medium
CN111988388A (en) Flow distribution method and device, electronic equipment and storage medium
CN114219468A (en) Micro-service charging method and device based on private container cloud and related components
CN111597034B (en) Processor resource scheduling method and device, terminal equipment and computer storage medium
WO2020166617A1 (en) Resource-contention arbitration apparatus, resource-contention arbitration method, and program
CN108737223B (en) Health consultation method, device, platform and storage medium based on load balancing
CN108093062B (en) Cloud resource management method and device
CN113037512A (en) Statistical method and device for network resource consumption and server

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination