CN111314401B - Resource allocation method, device, system, terminal and computer readable storage medium - Google Patents
Resource allocation method, device, system, terminal and computer readable storage medium Download PDFInfo
- Publication number
- CN111314401B CN111314401B CN201811517238.6A CN201811517238A CN111314401B CN 111314401 B CN111314401 B CN 111314401B CN 201811517238 A CN201811517238 A CN 201811517238A CN 111314401 B CN111314401 B CN 111314401B
- Authority
- CN
- China
- Prior art keywords
- task
- state
- physical resources
- node
- resource
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1029—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers using data related to the state of servers by a load balancer
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Stored Programmes (AREA)
Abstract
The embodiment of the invention provides a resource allocation method, a device, a system, a terminal and a computer readable storage medium, wherein the method comprises the following steps: receiving a task request sent by a user side; according to the task request, calling a node in an idle state in the physical resource to execute a task carried in the task request, and modifying the state of the called node into an occupied state; and after the called node executes the task, modifying the state of the called node into an idle state. According to the embodiment of the invention, the node in the idle state can be quickly called for task requests to execute tasks according to the states of the nodes in the physical resources, and after the called node executes the tasks, the state of the called node is modified into the idle state, so that the node modified into the idle state can be called again to execute other tasks, and the resource utilization rate and the task processing efficiency are improved.
Description
Technical Field
The present invention relates to the field of big data technologies, and in particular, to a method, an apparatus, a system, a terminal, and a computer readable storage medium for resource allocation.
Background
When big data calculation starts, physical resources are usually applied at one time, and meanwhile, after tasks are completed, the physical resources applied are released at one time. There are two problems with such execution logic, the first being that when there is a new task that needs to be calculated, it can be time consuming to re-apply for physical resources, even beyond the time that the task is executed. And secondly, after the single node of the physical resource finishes executing the task, the release can be carried out after all the associated nodes need to wait for the execution to finish, so that the utilization rate of the physical resource is reduced.
The above information disclosed in the background section is only for enhancement of understanding of the background of the invention and therefore it may contain information that does not form the prior art that is already known to a person of ordinary skill in the art.
Disclosure of Invention
The embodiment of the invention provides a resource allocation method, a device, a system, a terminal and a computer readable storage medium, which are used for solving one or more technical problems in the prior art.
In a first aspect, an embodiment of the present invention provides a resource allocation method, including:
receiving a task request sent by a user side;
according to the task request, calling a node in an idle state in the physical resource to execute a task carried in the task request, and modifying the state of the called node into an occupied state;
and after the called node executes the task, modifying the state of the called node into an idle state.
In one embodiment, before receiving the task request sent by the user side, the method further includes:
and logically marking the nodes in the physical resource, marking the state of the node currently executing the task as an occupied state, and marking the state of the node not currently executing the task as an idle state.
In one embodiment, according to the task request, invoking a node in an idle state in a physical resource to execute a task carried in the task request includes:
acquiring the number of tasks carried in the task request;
and calling the nodes in the idle state from one or more physical resources to execute the tasks according to the number of the tasks.
In one embodiment, invoking the node in the idle state from one or more of the physical resources to perform the task according to the number of tasks includes:
and when the number of the nodes in the idle state in any one of the physical resources is greater than or equal to the number of the tasks, calling a plurality of the nodes in the idle state from the physical resources to execute the tasks.
In one embodiment, invoking the node in the idle state from one or more of the physical resources to perform the task according to the number of tasks includes:
and when the number of the nodes in the idle state in each physical resource is smaller than the number of the tasks, respectively calling a plurality of the nodes in the idle state from a plurality of the physical resources to execute each task.
In a second aspect, an embodiment of the present invention provides a resource allocation method, including:
the user sends a task request to a resource center;
the resource center calls nodes in an idle state in physical resources to execute tasks carried in the task requests according to the task requests, and the states of the called nodes are modified into occupied states;
when the resource center detects that the called node executes the task, modifying the state of the called node into an idle state;
and the resource center sends the execution result of the task request to the user side.
In a third aspect, an embodiment of the present invention provides a resource allocation apparatus, including:
the receiving module is used for receiving a task request sent by the user side;
the calling module is used for calling the node in the idle state in the physical resource to execute the task carried in the task request according to the task request and modifying the state of the called node into an occupied state;
and the state modifying module is used for modifying the state of the called node into an idle state after the called node executes the task.
In one embodiment, the method further comprises:
the marking module is used for logically marking the nodes in the physical resource, marking the state of the node currently executing the task as an occupied state, and marking the state of the node not currently executing the task as an idle state.
In one embodiment, the calling module includes:
the acquisition sub-module is used for acquiring the number of the tasks carried in the task request;
and the calling sub-module is used for calling the node in the idle state from one or more physical resources to execute the task according to the number of the tasks.
In a fourth aspect, an embodiment of the present invention provides a resource allocation system, including:
a resource center employing the resource allocation apparatus according to any of the embodiments of the third aspect;
the user end is used for sending the task request to the resource center and receiving the execution result of the task request sent by the resource center.
In a fifth aspect, an embodiment of the present invention provides a terminal for resource allocation, including:
the functions may be implemented by hardware, or may be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the functions described above.
In one possible design, the structure of the terminal for resource allocation includes a processor and a memory, where the memory is configured to store a program for executing the method for resource allocation in the first aspect by the terminal for supporting resource allocation, and the processor is configured to execute the program stored in the memory. The resource-configured terminal may also include a communication interface for the resource-configured terminal to communicate with other devices or communication networks.
In a sixth aspect, an embodiment of the present invention provides a computer readable storage medium for storing computer software instructions for a terminal configured with resources, where the computer software instructions include a program for executing the method of configuring resources in the first aspect, where the program is related to the terminal configured with resources.
One of the above technical solutions has the following advantages or beneficial effects: according to the embodiment of the invention, the node in the idle state can be quickly called for task requests to execute tasks according to the states of the nodes in the physical resources, and after the called node executes the tasks, the state of the called node is modified into the idle state, so that the node modified into the idle state can be called again to execute other tasks, and the resource utilization rate and the task processing efficiency are improved.
The foregoing summary is for the purpose of the specification only and is not intended to be limiting in any way. In addition to the illustrative aspects, embodiments, and features described above, further aspects, embodiments, and features of the present invention will become apparent by reference to the drawings and the following detailed description.
Drawings
In the drawings, the same reference numerals refer to the same or similar parts or elements throughout the several views unless otherwise specified. The figures are not necessarily drawn to scale. It is appreciated that these drawings depict only some embodiments according to the disclosure and are not therefore to be considered limiting of its scope.
Fig. 1 is a flowchart of a resource allocation method according to an embodiment of the first aspect of the present invention.
Fig. 2 is a flowchart of a resource allocation method according to another embodiment of the first aspect of the present invention.
Fig. 3 is a flowchart of a resource allocation method according to an embodiment of the second aspect of the present invention.
Fig. 4 is a flowchart of a resource allocation method according to another embodiment of the second aspect of the present invention.
Fig. 5 is a schematic structural diagram of a resource allocation device according to an embodiment of the third aspect of the present invention.
Fig. 6 is a schematic diagram of a specific structure of the calling module in fig. 5.
Fig. 7 is a schematic structural diagram of a resource allocation terminal according to an embodiment of the present invention.
Detailed Description
Hereinafter, only certain exemplary embodiments are briefly described. As will be recognized by those of skill in the pertinent art, the described embodiments may be modified in various different ways without departing from the spirit or scope of the present invention. Accordingly, the drawings and description are to be regarded as illustrative in nature and not as restrictive.
In a first aspect, an embodiment of the present invention provides a resource allocation method, as shown in fig. 1, including the following steps:
s100: and receiving a task request sent by the user terminal.
S200: and according to the task request, calling the node in the idle state in the physical resource to execute the task carried in the task request, and modifying the state of the called node into an occupied state.
S300: after the called node performs the task, the state of the called node is modified to be an idle state. The nodes modified to the idle state can be called again to execute other tasks carried in the task request or to execute tasks carried in other task requests.
It should be noted that the number of tasks carried in the task request may be one or more. The called node may be from the same physical resource or from multiple physical resources, respectively. The specific configuration mode is selected preferentially according to the number and the state of the nodes in each physical resource of the application. Physical resources are understood to be any resources with arithmetic processing capability such as distributed networks, computers, memories, CPUs, etc. A node may be understood as each computer in a distributed network, each processing unit in a computer, multiple sub-memories in a memory, multiple CPUs in a computer, etc.
In one embodiment, the task request may also carry node number requirement information, i.e., the user may specify the number of nodes to use to perform the task.
In one embodiment, before receiving the task request sent by the user side, the method further includes the following steps:
s400: and logically marking nodes in the physical resource, marking the state of the node currently executing the task as an occupied state, and marking the state of the node not currently executing the task as an idle state.
In one embodiment, the steps S100-S400 described above may be performed by a resource center. Before the resource center is executing step S400, the method further includes:
all physical resources corresponding to the physical resources are acquired at one time. The node of each physical resource acquired at this time is never called, i.e. any task is not executed.
It should be noted that, all physical resources corresponding to the physical resources are acquired at one time, it is understood that all physical resources having a mapping relationship with the resource center (i.e., being able to be applied by the resource center) are applied, and each physical resource may be continuously used. The application of physical resources is not required to be carried out again when the resource center processes a new task request, the time consumption of the resource center for applying the physical resources is obviously reduced, and the task processing efficiency is effectively improved.
In an alternative embodiment, before the resource center is executing step S400, the method further includes:
and acquiring the preset number of physical resources from all the physical resources with the mapping relation with the resource center at one time so as to avoid resource waste caused by applying for all the physical resources with the mapping relation. The specific preset number may be adaptively selected according to the working requirements, and is not particularly limited herein.
In one embodiment, the resource center applies for physical resources to the resource manager, and the resource manager allocates the physical resources having a mapping relationship with the resource center to the resource center according to the application request.
In one embodiment, according to a task request, a node in an idle state in a physical resource is called to execute a task carried in the task request, and the method comprises the following steps:
and acquiring the number of the tasks carried in the task request.
The nodes in an idle state are invoked from one or more physical resources to perform tasks according to the number of tasks.
In a specific embodiment, when the number of nodes in an idle state in any physical resource is greater than or equal to the number of tasks, a plurality of nodes in an idle state are preferentially called from the physical resource to execute each task.
In another embodiment, when the number of nodes in idle state in each physical resource is smaller than the number of tasks, a plurality of nodes in idle state are respectively called from a plurality of physical resources to execute each task.
In a second aspect, an embodiment of the present invention provides a resource allocation method, as shown in fig. 3, including the following steps:
s10: and the user sends a task request to the resource center.
S20: and the resource center calls the node in the idle state in the physical resource to execute the task carried in the task request according to the task request, and changes the state of the called node into the occupied state.
S30: when the resource center detects that the called node finishes executing the task, the state of the called node is modified into an idle state.
S40: after each node executes all tasks carried in the task request, the resource center sends the execution result of the task request to the user side.
In one embodiment, before the user side sends the task request to the resource center, as shown in fig. 4, the method further includes the following steps:
s50: the resource center carries out logic marking on nodes in the physical resource, marks the state of the node which is currently executing the task as an occupied state, and marks the state of the node which is not currently executing the task as an idle state.
In a third aspect, an embodiment of the present invention provides a resource allocation apparatus, as shown in fig. 5, including:
and the receiving module 11 is used for receiving the task request sent by the user side.
And the calling module 12 is used for calling the node in the idle state in the physical resource to execute the task carried in the task request according to the task request, and modifying the state of the called node into the occupied state.
And the state modifying module 13 is used for modifying the state of the called node into an idle state after the called node performs the task.
In one embodiment, the resource allocation apparatus further comprises:
the marking module 14 is configured to logically mark nodes in the physical resource, mark a state of a node currently executing a task as an occupied state, and mark a state of a node not currently executing a task as an idle state.
In one embodiment, as shown in FIG. 6, the calling module 12 includes:
an acquiring sub-module 121, configured to acquire the number of tasks carried in the task request;
the invoking sub-module 122 is configured to invoke a node in an idle state from one or more physical resources to execute a task according to the number of tasks.
It should be noted that, the resource allocation device according to the embodiment of the present invention at least includes modules for implementing the methods and functions of the embodiments in the first aspect.
In a fourth aspect, an embodiment of the present invention provides a resource allocation system, including:
and a resource center adopting the resource allocation device of the third aspect.
The user end is used for sending the task request to the resource center and receiving the final execution result sent by the resource center.
An embodiment of the present invention provides a terminal for resource allocation, as shown in fig. 7, including:
A communication interface 930 for communicating between the memory 910 and the processor 920 and the outside.
The memory 910 may include high-speed RAM memory or may further include non-volatile memory (non-volatile memory), such as at least one disk memory.
If the memory 910, the processor 920, and the communication interface 930 are implemented independently, the memory 910, the processor 920, and the communication interface 930 may be connected to each other and perform communication with each other through buses. The bus may be an industry standard architecture (ISA, industry Standard Architecture) bus, a peripheral component interconnect (PCI, peripheral Component Interconnec) bus, or an extended industry standard architecture (EISA, extended Industry Standard Component) bus, among others. The buses may be divided into address buses, data buses, control buses, etc. For ease of illustration, only one thick line is shown in fig. 7, but not only one bus or one type of bus.
Alternatively, in a specific implementation, if the memory 910, the processor 920, and the communication interface 930 are integrated on a chip, the memory 910, the processor 920, and the communication interface 930 may communicate with each other through internal interfaces.
An embodiment of the present invention provides a computer-readable storage medium storing a computer program which, when executed by a processor, implements a method of resource allocation as in any one of the first embodiments.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present invention. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In the description of the present invention, the meaning of "a plurality" is two or more, unless explicitly defined otherwise.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and further implementations are included within the scope of the preferred embodiment of the present invention in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present invention.
Logic and/or steps represented in the flowcharts or otherwise described herein, e.g., a ordered listing of executable instructions for implementing logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable read-only memory (CDROM). In addition, the computer readable medium may even be paper or other suitable medium on which the program is printed, as the program may be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.
It is to be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above-described embodiments, the various steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, may be implemented using any one or combination of the following techniques, as is well known in the art: discrete logic circuits having logic gates for implementing logic functions on data signals, application specific integrated circuits having suitable combinational logic gates, programmable Gate Arrays (PGAs), field Programmable Gate Arrays (FPGAs), and the like.
Those of ordinary skill in the art will appreciate that all or a portion of the steps carried out in the method of the above-described embodiments may be implemented by a program to instruct related hardware, where the program may be stored in a computer readable storage medium, and where the program, when executed, includes one or a combination of the steps of the method embodiments.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing module, or each unit may exist alone physically, or two or more units may be integrated in one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules may also be stored in a computer readable storage medium if implemented in the form of software functional modules and sold or used as a stand-alone product. The storage medium may be a read-only memory, a magnetic or optical disk, or the like.
The foregoing is merely illustrative of the present invention, and the present invention is not limited thereto, and any person skilled in the art will readily recognize that various changes and substitutions are possible within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (11)
1. A method for resource allocation, comprising:
acquiring a preset number of physical resources from all physical resources with a mapping relation with a resource center at one time, wherein the physical resources comprise a CPU (central processing unit), and the preset number of physical resources are not called;
receiving a task request sent by a user side;
according to the task request, calling a node in an idle state in the physical resource to execute a task carried in the task request, and modifying the state of the called node into an occupied state;
after the called node executes the task, modifying the state of the called node into an idle state;
wherein the preset number of physical resources are sustainable used resources, and the resource center does not need to reapply the physical resources when processing a new task request;
the step of calling the node in the idle state in the physical resource to execute the task carried in the task request according to the task request comprises the following steps:
acquiring the number of tasks carried in the task request;
and calling the nodes in the idle state from one or more physical resources to execute the tasks according to the number of the tasks.
2. The method of claim 1, further comprising, prior to receiving the task request sent by the client:
and logically marking the nodes in the physical resource, marking the state of the node currently executing the task as an occupied state, and marking the state of the node not currently executing the task as an idle state.
3. The method of claim 1, wherein invoking the node in the idle state from one or more of the physical resources to perform the task based on the number of tasks comprises:
and when the number of the nodes in the idle state in any one of the physical resources is greater than or equal to the number of the tasks, calling a plurality of the nodes in the idle state from the physical resources to execute the tasks.
4. The method of claim 1, wherein invoking the node in the idle state from one or more of the physical resources to perform the task based on the number of tasks comprises:
and when the number of the nodes in the idle state in each physical resource is smaller than the number of the tasks, respectively calling a plurality of the nodes in the idle state from a plurality of the physical resources to execute each task.
5. A method for resource allocation, comprising:
the resource center acquires a preset number of physical resources from all physical resources with mapping relation, wherein the physical resources comprise a CPU (central processing unit), and the preset number of physical resources are not called;
the user sends a task request to the resource center;
the resource center calls a node in an idle state in the physical resource to execute a task carried in the task request according to the task request, and modifies the state of the called node into an occupied state;
when the resource center detects that the called node executes the task, modifying the state of the called node into an idle state;
the resource center sends the execution result of the task request to the user side;
wherein the preset number of physical resources are sustainable used resources, and the resource center does not need to reapply the physical resources when processing a new task request;
the resource center acquires the number of tasks carried in the task request; and calling the nodes in the idle state from one or more physical resources to execute the tasks according to the number of the tasks.
6. A resource allocation device is characterized in that,
the device is used for acquiring a preset number of physical resources from all physical resources with mapping relation with a resource center at one time, wherein the physical resources comprise a CPU (central processing unit), and the preset number of physical resources are not called;
the apparatus further comprises:
the receiving module is used for receiving a task request sent by the user side;
the calling module is used for calling the node in the idle state in the physical resource to execute the task carried in the task request according to the task request and modifying the state of the called node into an occupied state;
the state modifying module is used for modifying the state of the called node into an idle state after the called node executes the task;
wherein the preset number of physical resources are sustainable used resources, and the resource center does not need to reapply the physical resources when processing a new task request;
wherein, the calling module is used for: acquiring the number of tasks carried in the task request; and calling the nodes in the idle state from one or more physical resources to execute the tasks according to the number of the tasks.
7. The apparatus as recited in claim 6, further comprising:
the marking module is used for logically marking the nodes in the physical resource, marking the state of the node currently executing the task as an occupied state, and marking the state of the node not currently executing the task as an idle state.
8. The apparatus of claim 6, wherein the invoking module comprises:
the acquisition sub-module is used for acquiring the number of the tasks carried in the task request;
and the calling sub-module is used for calling the node in the idle state from one or more physical resources to execute the task according to the number of the tasks.
9. A resource allocation system, comprising:
a resource centre employing a resource allocation apparatus according to any of claims 6 to 8;
the user end is used for sending the task request to the resource center and receiving the execution result of the task request sent by the resource center.
10. A resource allocation terminal, comprising:
one or more processors;
a storage means for storing one or more programs;
the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of any of claims 1-5.
11. A computer readable storage medium storing a computer program, which when executed by a processor implements the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811517238.6A CN111314401B (en) | 2018-12-12 | 2018-12-12 | Resource allocation method, device, system, terminal and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811517238.6A CN111314401B (en) | 2018-12-12 | 2018-12-12 | Resource allocation method, device, system, terminal and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111314401A CN111314401A (en) | 2020-06-19 |
| CN111314401B true CN111314401B (en) | 2023-06-23 |
Family
ID=71159578
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811517238.6A Active CN111314401B (en) | 2018-12-12 | 2018-12-12 | Resource allocation method, device, system, terminal and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111314401B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112233081A (en) * | 2020-10-13 | 2021-01-15 | 南京泊纳莱电子科技有限公司 | Image processing method and device and electronic equipment |
| CN112667385A (en) * | 2021-01-15 | 2021-04-16 | 北京金和网络股份有限公司 | Cloud service system, task execution method and device thereof, and server |
| CN113553178A (en) * | 2021-07-15 | 2021-10-26 | 北京字跳网络技术有限公司 | Task processing method and device and electronic equipment |
| CN113658351B (en) * | 2021-08-10 | 2023-04-28 | 北京全路通信信号研究设计院集团有限公司 | Method and device for producing product, electronic equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107368367A (en) * | 2017-05-23 | 2017-11-21 | 阿里巴巴集团控股有限公司 | Processing method, device and the electronic equipment of resource allocation |
| CN108874549A (en) * | 2018-07-19 | 2018-11-23 | 北京百度网讯科技有限公司 | resource multiplexing method, device, terminal and computer readable storage medium |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100085871A1 (en) * | 2008-10-02 | 2010-04-08 | International Business Machines Corporation | Resource leak recovery in a multi-node computer system |
| CN103279390B (en) * | 2012-08-21 | 2016-09-28 | 中国科学院信息工程研究所 | A kind of parallel processing system (PPS) towards little optimization of job |
| CN106161643B (en) * | 2016-07-25 | 2019-09-06 | 镇江惠通电子有限公司 | Task distribution formula processing method, device and Cloud Server |
| CN106293950B (en) * | 2016-08-23 | 2019-08-13 | 成都卡莱博尔信息技术股份有限公司 | A kind of resource optimization management method towards group system |
| CN107809323B (en) * | 2016-09-08 | 2022-10-21 | 中兴通讯股份有限公司 | Resource control method, device and system |
| CN108268316A (en) * | 2016-12-30 | 2018-07-10 | 北京国双科技有限公司 | The method and device of job scheduling |
| CN108345501B (en) * | 2017-01-24 | 2021-10-29 | 全球能源互联网研究院有限公司 | Distributed resource scheduling method and system |
| CN107168782A (en) * | 2017-04-24 | 2017-09-15 | 复旦大学 | A kind of concurrent computational system based on Spark and GPU |
| CN108363623A (en) * | 2018-02-27 | 2018-08-03 | 郑州云海信息技术有限公司 | GPU resource dispatching method, device, equipment and computer readable storage medium |
-
2018
- 2018-12-12 CN CN201811517238.6A patent/CN111314401B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107368367A (en) * | 2017-05-23 | 2017-11-21 | 阿里巴巴集团控股有限公司 | Processing method, device and the electronic equipment of resource allocation |
| CN108874549A (en) * | 2018-07-19 | 2018-11-23 | 北京百度网讯科技有限公司 | resource multiplexing method, device, terminal and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111314401A (en) | 2020-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111314401B (en) | Resource allocation method, device, system, terminal and computer readable storage medium | |
| CN108874549B (en) | Resource multiplexing method, device, terminal and computer readable storage medium | |
| KR102466984B1 (en) | Improved function callback mechanism between a central processing unit (cpu) and an auxiliary processor | |
| US8677362B2 (en) | Apparatus for reconfiguring, mapping method and scheduling method in reconfigurable multi-processor system | |
| CN107688495B (en) | Method and apparatus for scheduling processors | |
| CN111104208B (en) | Process scheduling management method, device, computer equipment and storage medium | |
| US9164799B2 (en) | Multiprocessor system | |
| US9256465B2 (en) | Process device context switching | |
| CN109933430B (en) | Method and apparatus for distributing graphics processor | |
| US20170344398A1 (en) | Accelerator control device, accelerator control method, and program storage medium | |
| WO2017185285A1 (en) | Method and device for assigning graphics processing unit task | |
| CN110659131B (en) | Task processing method, electronic device, computer equipment and storage medium | |
| US20190377612A1 (en) | VCPU Thread Scheduling Method and Apparatus | |
| CN110704084A (en) | Method and device for dynamically allocating memory in firmware upgrade, computer equipment and storage medium | |
| CN112559173A (en) | Resource adjusting method and device, electronic equipment and readable storage medium | |
| US9122522B2 (en) | Software mechanisms for managing task scheduling on an accelerated processing device (APD) | |
| CN114816709A (en) | Task scheduling method, device, server and readable storage medium | |
| WO2017166997A1 (en) | Inic-side exception handling method and device | |
| CN113760543A (en) | Resource management method and device, electronic equipment and computer readable storage medium | |
| CN110990116B (en) | Method, device and system for transmitting data between intelligent network card and virtual machine | |
| CN117078495A (en) | Memory allocation method, device, equipment and storage medium of graphic processor | |
| CN113268356B (en) | LINUX system-based multi-GPU board card bounding system, method and medium | |
| CN111352710B (en) | Process management method and device, computing equipment and storage medium | |
| US7996848B1 (en) | Systems and methods for suspending and resuming threads | |
| CN109408407B (en) | Display memory allocation method and device |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |