CN112465359A - Calculation power calling method and device - Google Patents
Calculation power calling method and device Download PDFInfo
- Publication number
- CN112465359A CN112465359A CN202011383427.6A CN202011383427A CN112465359A CN 112465359 A CN112465359 A CN 112465359A CN 202011383427 A CN202011383427 A CN 202011383427A CN 112465359 A CN112465359 A CN 112465359A
- Authority
- CN
- China
- Prior art keywords
- computing power
- identification
- force
- calculation
- node
- 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.)
- Granted
Links
- 238000004364 calculation method Methods 0.000 title claims abstract description 96
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000003860 storage Methods 0.000 claims description 32
- 238000012545 processing Methods 0.000 claims description 25
- 238000012360 testing method Methods 0.000 claims description 14
- 238000012790 confirmation Methods 0.000 claims description 5
- 238000010606 normalization Methods 0.000 claims description 4
- 238000004891 communication Methods 0.000 abstract description 17
- 230000006870 function Effects 0.000 description 14
- 238000013473 artificial intelligence Methods 0.000 description 10
- 238000005516 engineering process Methods 0.000 description 10
- 238000004590 computer program Methods 0.000 description 5
- 238000013528 artificial neural network Methods 0.000 description 4
- 238000011161 development Methods 0.000 description 4
- 230000001133 acceleration Effects 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000013135 deep learning Methods 0.000 description 2
- 239000003814 drug Substances 0.000 description 2
- 238000007689 inspection Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000005259 measurement Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000013139 quantization Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000012549 training Methods 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000006386 memory function Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/24—Classification techniques
- G06F18/241—Classification techniques relating to the classification model, e.g. parametric or non-parametric approaches
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N20/00—Machine learning
Abstract
The embodiment of the invention provides a computing power calling method and device, relates to the field of communication, and is used for rapidly and reasonably managing and scheduling computing power resources. The method comprises the following steps: the calculation force calling device firstly receives calculation force information sent by the calculation force node, then adds a classification identifier for the calculation force information, and calls the calculation force of the calculation force node according to the classification identifier of the calculation force information. Wherein the classification identifier is used to identify a type of computing power.
Description
Technical Field
The invention relates to the field of communication, in particular to a calculation power calling method and device.
Background
In recent years, with the wide application of artificial intelligence technologies such as deep learning, big data, group intelligence and the like in the fields of intelligent medicine, intelligent education, intelligent security, intelligent manufacturing, intelligent inspection and the like, the artificial intelligence technology has become a general technology in the contemporary society and is also an indispensable technology in the future intelligent society. For the artificial intelligence technology, the computing resources are the technical support for the development of the artificial intelligence and the power and engine for the development of the artificial intelligence.
In order to ensure the utilization rate of computing resources and improve the service experience of users, how to manage and schedule computing resources quickly and reasonably is a technical problem which needs to be solved urgently at present.
Disclosure of Invention
The embodiment of the invention provides a computing power calling method and a computing power calling device, which are used for rapidly and reasonably managing and scheduling computing power resources.
In order to achieve the above purpose, the embodiment of the invention adopts the following technical scheme:
in a first aspect, a computing power calling method is provided, including: the calculation force calling device firstly receives calculation force information sent by the calculation force node, then adds a classification identifier for the calculation force information, and calls the calculation force of the calculation force node according to the classification identifier of the calculation force information. Wherein the classification identifier is used to identify a type of computing power.
In a second aspect, a computing power calling device is provided, which includes a receiving unit, a processing unit and a calling unit; the receiving unit is used for receiving the computing power information sent by the computing power node; the processing unit is used for adding classification identification to the calculation force information received by the receiving unit; the classification identification is used for identifying the type of computing power; and the calling unit is used for calling the computing power of the computing power node according to the classification identification of the computing power information.
In a third aspect, a computing power calling apparatus is provided, including: a memory, a processor, a bus, and a communication interface; the memory is used for storing computer execution instructions, and the processor is connected with the memory through a bus; when the computing power invocation means is running, the processor executes computer-executable instructions stored in the memory to cause the computing power invocation means to perform the computing power invocation method as provided in the first aspect.
In a fourth aspect, a computer-readable storage medium is provided, the computer-readable storage medium comprising computer-executable instructions that, when executed on a computer, cause the computer to perform the computational power calling method as provided in the first aspect.
The calculation power calling method provided by the embodiment of the invention comprises the following steps: the calculation force calling device firstly receives calculation force information sent by the calculation force node, then adds a classification identifier for the calculation force information, and calls the calculation force of the calculation force node according to the classification identifier of the calculation force information. Wherein the classification identifier is used to identify a type of computing power. Therefore, when the computing power calling device receives the service request and calls the computing power of the computing power node, the computing power resource corresponding to the service request can be quickly and accurately determined and called according to the classification identification of the computing power information, and the utilization rate of the computing power resource is ensured.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a scene schematic diagram of computation power invocation according to an embodiment of the present invention;
fig. 2 is a schematic flowchart of a computing power calling apparatus according to an embodiment of the present invention;
fig. 3 is a schematic flowchart of another computing power calling apparatus according to an embodiment of the present invention;
fig. 4 is a schematic flowchart of a calculation power calling method according to an embodiment of the present invention;
fig. 5 is a schematic flowchart of a calculation power calling apparatus according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the 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 invention.
It should be noted that, in the embodiments of the present invention, words such as "exemplary" or "for example" are used to indicate examples, illustrations or explanations. Any embodiment or design described as "exemplary" or "e.g.," an embodiment of the present invention is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present concepts related in a concrete fashion.
For the convenience of clearly describing the technical solutions of the embodiments of the present invention, in the embodiments of the present invention, the words "first", "second", and the like are used for distinguishing the same items or similar items with basically the same functions and actions, and those skilled in the art can understand that the words "first", "second", and the like are not limited in number or execution order.
In recent years, with the wide application of artificial intelligence technologies such as deep learning, big data, group intelligence and the like in the fields of intelligent medicine, intelligent education, intelligent security, intelligent manufacturing, intelligent inspection and the like, the artificial intelligence technology has become a general technology in the contemporary society and is also an indispensable technology in the future intelligent society. For the artificial intelligence technology, the computing resources are the technical support for the development of the artificial intelligence and the power and engine for the development of the artificial intelligence.
In order to ensure the utilization rate of computing resources and improve the service experience of users, how to manage and schedule computing resources quickly and reasonably is a technical problem which needs to be solved urgently at present.
Based on the problems existing in the background art, the embodiment of the invention provides a computing power scheduling method and device. Wherein the classification identifier is used to identify a type of computing power. Therefore, when the computing power calling device receives the service request and calls the computing power of the computing power node, the computing power resource corresponding to the service request can be quickly and accurately determined and called according to the classification identification of the computing power information, and the utilization rate of the computing power resource is ensured.
The calculation power scheduling method provided by the embodiment of the invention is applied to the calculation power scheduling scene shown in fig. 1. Specifically, the device in the computational power scheduling system 10 (i.e., the computational power scheduling apparatus 101) schedules an appropriate computational power node for the target computational power. Specifically, when a user (or user equipment) needs to process a certain service, the UE sends calculation power demand information to the calculation power scheduling apparatus 101 in the calculation power scheduling system 10; when the computing power scheduling device 101 acquires the computing power demand information of the target service, a target computing power node for processing the target service may be determined from the data processing system 20. A plurality of force nodes may be included in the data processing system 20, including, for example, force node 201, force node 202, and force node 203. Wherein a force node may be composed of one or more devices. Illustratively, as shown in fig. 1, device 2011, device 2012 and device 2013 are included in force node 201, device 2021 and device 2022 are included in force node 202, and device 2031, device 2032, device 2033 and device 2034 are included in force node 203. In general, in practical applications, the connections between the above-mentioned devices or service functions may be wireless connections, and fig. 1 illustrates the connections between the devices by solid lines for convenience of intuitively representing the connections between the devices.
Specifically, the calculation force node 201, the calculation force node 202, and the calculation force node 203 are all connected to the calculation force scheduling device 101. The effort node 201, the effort node 202 or the effort node 203 may be used to process the traffic, i.e. to provide the user (or UE) with the effort corresponding to the traffic. In the embodiment of the present invention, when receiving the service request and invoking the computing power of the computing power node, the computing power scheduling device 101 may quickly and accurately determine and invoke the computing power resource corresponding to the service request according to the classification identifier of the computing power information based on the computing power node (including the computing power node 201, the computing power node 202, and the computing power node 203), thereby ensuring the utilization rate of the computing power resource.
In an embodiment of the present invention, the computation nodes included in the data processing system 20 may be one or more of a terminal device, a Mobile Edge Computing (MEC) device, or a data center device.
Optionally, the data processing system may include one or more computational nodes, and one computational node may also include one or more devices. The embodiment of the invention does not limit the number of each computational power node and equipment in the data processing system.
Each of the devices in fig. 1 includes the elements included in the computing power scheduling apparatus shown in fig. 2. The hardware configuration of each device in fig. 1 will be described below by taking the computing power scheduling apparatus shown in fig. 2 as an example.
Fig. 2 shows a hardware structure diagram of a computational power scheduling apparatus provided in an embodiment of the present application. As shown in fig. 2, the computing power scheduling apparatus includes a processor 21, a memory 22, a communication interface 23, and a bus 24. The processor 21, the memory 22 and the communication interface 23 may be connected by a bus 24.
The processor 21 is a control center of the computing power scheduling apparatus, and may be a single processor or a collective term for a plurality of processing elements. For example, the processor 21 may be a Central Processing Unit (CPU), other general-purpose processors, or the like. Wherein a general purpose processor may be a microprocessor or any conventional processor or the like.
For one embodiment, processor 21 may include one or more CPUs, such as CPU 0 and CPU 1 shown in FIG. 2.
The memory 22 may be, but is not limited to, a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a Random Access Memory (RAM) or other type of dynamic storage device that may store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
In a possible implementation, the memory 22 may exist separately from the processor 21, and the memory 22 may be connected to the processor 21 via a bus 24 for storing instructions or program codes. The computational scheduling method provided by embodiments of the present invention can be implemented when the processor 21 invokes and executes instructions or program code stored in the memory 22.
In another possible implementation, the memory 22 may also be integrated with the processor 21.
And a communication interface 23 for connecting with other devices through a communication network. The communication network may be an ethernet network, a radio access network, a Wireless Local Area Network (WLAN), or the like. The communication interface 23 may include a receiving unit for receiving data, and a transmitting unit for transmitting data.
The bus 24 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 2, but it is not intended that there be only one bus or one type of bus.
It is to be noted that the structure shown in fig. 2 does not constitute a limitation of the computational power scheduling device. In addition to the components shown in fig. 2, the computational force scheduling apparatus may include more or fewer components than shown, or combine certain components, or a different arrangement of components.
Fig. 3 shows another hardware configuration of the computational power scheduling apparatus in the embodiment of the present application. As shown in fig. 3, the computing power scheduling means may include a processor 31 and a communication interface 32. The processor 31 is coupled to a communication interface 32.
The function of the processor 31 may refer to the description of the processor 21 above. The processor 31 also has a memory function, and the function of the memory 22 can be referred to.
The communication interface 32 is used to provide data to the processor 31. The communication interface 32 may be an internal interface of the power calculating scheduling apparatus, or may be an external interface (corresponding to the communication interface 23) of the power calculating scheduling apparatus.
It is noted that the structure shown in fig. 2 (or fig. 3) does not constitute a limitation of the computational force scheduling apparatus, which may include more or less components than those shown in fig. 2 (or fig. 3), or combine some components, or a different arrangement of components, in addition to the components shown in fig. 2 (or fig. 3).
The computing power scheduling method provided by the embodiment of the present application is described in detail below with reference to the communication system shown in fig. 1 and the computing power scheduling apparatus shown in fig. 2 (or fig. 3).
As shown in fig. 4, the computational power scheduling method provided by the embodiment of the present invention may include S401 to S406.
S401, receiving a registration request message sent by the computing power node.
Specifically, the contributors with zero computing power (i.e., computing power nodes) send idle computing power to the system, such as a mobile phone terminal, an idle computer, or a small data center of an enterprise, to send a registration request message. Wherein the registration request message includes: GPU, CPU, NPU and available time period of the computational power node, storage information and the like.
S402, sending a test message to the force node according to the registration request message.
After receiving the registration request message sent by the computational power node, the computational power scheduling device sends a test message to the computational power node according to the registration request message.
Specifically, after receiving a registration request message sent by a computational power node, the computational power scheduling device sends a computational power test program to the computational power node according to the registration request message, tests resources of registered equipment, including computational resources, storage resources and the like, simultaneously tests the network condition from the computational power node to a computational power network system platform, and confirms the test result with a user.
And S403, receiving a confirmation message sent by the computing power node according to the test message.
And after receiving the test message, the force calculation node confirms the user corresponding to the force calculation node. After the user confirms, the computing power node sends a confirmation message to the computing power scheduling device.
And S404, receiving the force calculation information sent by the force calculation node.
Specifically, after receiving the confirmation message sent by the computation node according to the test message, the computation scheduling device obtains the computation information of the computation node. Wherein, calculating the strength information includes: at least one of computing power, computing power node identification, network quality, storage capacity, or idle time.
Optionally, after receiving the computing power information sent by the computing power node, the computing power scheduling device stores the computing power information in the database.
And S405, adding a classification identifier for the calculation force information.
Wherein the classification identifier is used to identify a type of computing power. The classification identification comprises: service identification, computing power type identification, network quality identification, storage capacity identification and idle time identification.
Specifically, since the calculation force information includes a plurality of items of calculation force sub information, the calculation force scheduling apparatus adds a classification identifier to each calculation force sub information in the calculation force information.
Optionally, the calculation force scheduling device may add a service identifier to the calculation force information.
Optionally, the calculation force scheduling device may also add a calculation force type identifier to the calculation force.
Further optionally, when the computing power scheduling device adds the computing power type identifier to the computing power, the computing power scheduling device firstly performs normalization processing on the computing power to obtain the processed computing power, and then adds the computing power type identifier to the processed computing power, because various measurement standards of different manufacturer chips are different and the original computing power description provided by each computing power node cannot be directly used.
Specifically, computing resources may be classified into three categories: logic operation capability, parallel computing capability and neural network acceleration capability. Because various measurement standards of different manufacturer chips are different, the original computing power description provided by each computing power node cannot be directly used, and therefore, the computing power scheduling device maps the original computing power provided by the computing power node to a uniform dimension. Illustratively, for logical operation capability, typically a CPU chip. Different chips can provide logic operation capability, such as a CPU, and an ASIC chip can provide logic operation capability. In this case, the computation scheduling means determines the logical computation power after the uniform quantization according to the following formula: a ═ B × C + D. Wherein, A is the logic operation capability after unified quantization, B is the conversion coefficient, C is the original logic operation capability, and D is the compensation coefficient. Similarly, the parallel computing capability and the neural network acceleration capability are mapped to a uniform dimension in the same way.
Optionally, the computational power scheduling apparatus may further add a network quality identifier to the network quality.
Optionally, the computing power scheduling device may further add a storage capability identifier to the storage capability.
Optionally, the computing power scheduling device may also add an idle time identifier to the idle time.
Illustratively, specific label entries and label values for adding classification identifiers to the computing power information of the first computing power node are shown in table 1. The label item is calculation force sub information in calculation force node information, and the label value is a classification identification of the calculation force information.
TABLE 1
Optionally, when the computing power contains neural network acceleration resources, the service identifier of the computing power node is a neural network training service. And when the computing power contains parallel computing resources, the service identifier of the computing power node is a rendering engineering or model training service. And when the calculation power is that the network bandwidth delay is within a certain value range, the service identifier of the calculation power node is a live broadcast service.
And S406, invoking the computing power of the computing power node according to the classification identification of the computing power information.
After the classification identification is added to the calculation force information, the calculation force scheduling device adds the calculation force node added with the classification identification into a calculation force resource pool, and the resource pool issues that the calculation force node is available. And after receiving the computing power requests sent by other terminals, the computing power scheduling device calls the computing power of the computing power node according to the classification identification of the computing power information.
The application provides a calculation power calling method, which comprises the following steps: the calculation force calling device firstly receives calculation force information sent by the calculation force node, then adds a classification identifier for the calculation force information, and calls the calculation force of the calculation force node according to the classification identifier of the calculation force information. Wherein the classification identifier is used to identify a type of computing power.
As can be seen from the above, the calculation power calling device first receives the calculation power information sent by the calculation power node, then adds the classification identifier to the calculation power information, and calls the calculation power of the calculation power node according to the classification identifier of the calculation power information. Wherein the classification identifier is used to identify a type of computing power. Therefore, when the computing power calling device receives the service request and calls the computing power of the computing power node, the computing power resource corresponding to the service request can be quickly and accurately determined and called according to the classification identification of the computing power information, and the utilization rate of the computing power resource is ensured.
The scheme provided by the embodiment of the application is mainly introduced from the perspective of a method. To implement the above functions, it includes hardware structures and/or software modules for performing the respective functions. Those of skill in the art will readily appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the embodiment of the present application, the computing power scheduling apparatus may be divided into functional modules according to the above method example, for example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. Optionally, the division of the modules in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
Fig. 5 is a schematic structural diagram of a computing power scheduling apparatus 50 according to an embodiment of the present application. The computing power scheduling device 50 is used to solve the technical problem how to manage and schedule computing power resources quickly and reasonably, which is currently in urgent need of solution, for example, to execute the computing power scheduling method shown in fig. 4. The calculation power scheduling device 50 includes: a receiving unit 501, a processing unit 502 and a calling unit 503.
The receiving unit 501 is configured to receive computing power information sent by a computing power node. For example, the receiving unit 501 is configured to execute S404 in fig. 4.
A processing unit 502, configured to add a classification identifier to the calculation power information received by the receiving unit 501. The class identifier is used to identify the type of computing power. For example, the processing unit 502 is configured to execute S405 in fig. 4.
The invoking unit 503 is configured to invoke the computing power of the computing power node according to the classification identifier of the computing power information. For example, the calling unit 503 is used to execute S406 in fig. 4.
Optionally, the calculation force information includes: at least one of computing power, computing power node identification, network quality, storage capacity, or idle time.
Optionally, the classification identifier includes: service identification, computing power type identification, network quality identification, storage capacity identification and idle time identification. The processing unit 502 is specifically configured to: adding a service identifier for the calculation force information; adding a calculation power type identifier for calculation power; adding a network quality identifier for the network quality; adding a storage capacity identification for the storage capacity; and adding an idle time identifier for the idle time.
Optionally, the processing unit 502 is specifically configured to: carrying out normalization processing on the calculated force to obtain the processed calculated force; and adding an computational power type identifier for the processed computational power.
The optional receiving unit 501 is further configured to receive a registration request message sent by the force node. For example, the receiving unit 501 is configured to execute S401 in fig. 4.
The calculation force calling device 50 further includes: a transmitting unit 504.
A sending unit 504, configured to send a test message to the computation node according to the registration request message received by the receiving unit 501. For example, the transmitting unit 504 is configured to execute S402 in fig. 4.
The receiving unit 501 is further configured to receive an acknowledgement message sent by the force node according to the test message sent by the sending unit 504. For example, the receiving unit 501 is configured to execute S403 in fig. 4.
Embodiments of the present application also provide a computer-readable storage medium, which includes computer-executable instructions. When the computer execution instructions are run on a computer, the computer is caused to execute the steps executed by the thread scheduling device in the thread scheduling method provided by the embodiment.
The embodiments of the present application further provide a computer program product, where the computer program product can be directly loaded into the memory and contains software codes, and after the computer program product is loaded and executed by the computer, the steps executed by the thread scheduling device in the thread scheduling method provided in the foregoing embodiments can be implemented.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented using a software program, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. The processes or functions according to the embodiments of the present application are generated in whole or in part when the computer-executable instructions are loaded and executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). Computer-readable storage media can be any available media that can be accessed by a computer or can comprise one or more data storage devices, such as servers, data centers, and the like, that can be integrated with the media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
Through the above description of the embodiments, it is clear to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the above function distribution may be completed by different functional modules according to needs, that is, the internal structure of the device may be divided into different functional modules to complete all or part of the above described functions.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules or units is only one logical function division, and there may be other division ways in actual implementation. For example, various elements or components may be combined or may be integrated into another device, or some features may be omitted, or not implemented. 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, devices or units, and may be in an electrical, mechanical or other form. Units described as separate parts may or may not be physically separate, and parts displayed as units may be one physical unit or a plurality of physical units, may be located in one place, or may be distributed to a plurality of different places. 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 invention 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 readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present application may be essentially or partially contributed to by the prior art, or all or part of the technical solutions may be embodied in the form of a software product, where the software product is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.
The above description is only for the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in 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 (10)
1. A computing power calling method, comprising:
receiving computing power information sent by a computing power node;
adding a classification identifier for the calculation force information; the classification identification is used for identifying the type of the computing power;
and calling the computing power of the computing power node according to the classification identification of the computing power information.
2. The computing power calling method according to claim 1, wherein the computing power information includes: the computing power, computing power node identification, network quality, storage capacity, or idle time.
3. The effort calling method according to claim 2, wherein the classification identification comprises: service identification, computing power type identification, network quality identification, storage capacity identification and idle time identification; adding a classification identifier for the calculation force information comprises:
adding the service identifier to the computing power information;
adding the calculation type identification to the calculation force;
adding the network quality identification for the network quality;
adding the storage capacity identification to the storage capacity;
and adding the idle time identification for the idle time.
4. The computing power calling method according to claim 3, wherein the adding the computing power type identifier for the computing power comprises:
carrying out normalization processing on the calculated force to obtain the processed calculated force;
and adding the calculation force type identification to the processed calculation force.
5. The computing power calling method according to any one of claims 1 to 4, wherein before receiving computing power information sent by the computing power node, the method further comprises:
receiving a registration request message sent by the computing node;
sending a test message to the computational power node according to the registration request message;
and receiving a confirmation message sent by the computational power node according to the test message.
6. An effort calling device, comprising: the system comprises a receiving unit, a processing unit and a calling unit;
the receiving unit is used for receiving the computing power information sent by the computing power node;
the processing unit is used for adding a classification identifier to the calculation force information received by the receiving unit; the classification identification is used for identifying the type of the computing power;
and the calling unit is used for calling the computing power of the computing power node according to the classification identification of the computing power information.
7. The computing force calling apparatus according to claim 6, wherein the computing force information includes: the computing power, computing power node identification, network quality, storage capacity, or idle time.
8. The computing power calling device of claim 7, wherein the classification identifier comprises: service identification, computing power type identification, network quality identification, storage capacity identification and idle time identification; the processing unit is specifically configured to:
adding the service identifier to the computing power information;
adding the calculation type identification to the calculation force;
adding the network quality identification for the network quality;
adding the storage capacity identification to the storage capacity;
and adding the idle time identification for the idle time.
9. The computing power calling device of claim 8, wherein the processing unit is specifically configured to:
carrying out normalization processing on the calculated force to obtain the processed calculated force;
and adding the calculation force type identification to the processed calculation force.
10. The computing force calling apparatus according to any one of claims 6 to 9,
the receiving unit is further configured to receive a registration request message sent by the computation force node;
the calculation force calling device further includes: a transmitting unit;
the sending unit is used for sending a test message to the computational power node according to the registration request message received by the receiving unit;
the receiving unit is further configured to receive a confirmation message sent by the computation node according to the test message sent by the sending unit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011383427.6A CN112465359B (en) | 2020-12-01 | 2020-12-01 | Calculation force calling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011383427.6A CN112465359B (en) | 2020-12-01 | 2020-12-01 | Calculation force calling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112465359A true CN112465359A (en) | 2021-03-09 |
| CN112465359B CN112465359B (en) | 2024-03-15 |
Family
ID=74805983
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011383427.6A Active CN112465359B (en) | 2020-12-01 | 2020-12-01 | Calculation force calling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112465359B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113535410A (en) * | 2021-09-15 | 2021-10-22 | 航天宏图信息技术股份有限公司 | Load balancing method and system for GIS space vector distributed computation |
| WO2021244343A1 (en) * | 2020-06-01 | 2021-12-09 | 杭州嘉楠耘智信息科技有限公司 | Cloud computing power allocation method, user terminal, cloud computing power platform and system |
| WO2023273957A1 (en) * | 2021-06-28 | 2023-01-05 | 华为技术有限公司 | Computing power release method and apparatus, and computing power update method and apparatus |
| WO2023083138A1 (en) * | 2021-11-12 | 2023-05-19 | 索尼集团公司 | Electronic device and method for communication system and storage medium |
| CN116302568A (en) * | 2023-05-17 | 2023-06-23 | 算力互联(北京)科技有限公司 | Computing power resource scheduling method and system, scheduling center and data center |
| WO2023130897A1 (en) * | 2022-01-06 | 2023-07-13 | 华为技术有限公司 | Communication method, apparatus and system |
| CN116501501A (en) * | 2023-06-21 | 2023-07-28 | 亚信科技（中国）有限公司 | Method and device for managing and arranging computing power resources, electronic equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102694849A (en) * | 2012-05-14 | 2012-09-26 | 中国科学院计算机网络信息中心 | IOT (Internet of Things) resource information acquiring method, terminal equipment and system |
| CN103747018A (en) * | 2014-02-10 | 2014-04-23 | 重庆邮电大学 | RESTful-based ubiquitous network resource identification method and registration flow |
| CN109002342A (en) * | 2017-06-07 | 2018-12-14 | 中国科学院信息工程研究所 | A kind of computing resource orientation dispatching method and system based on OpenStack |
| CN109408399A (en) * | 2018-12-14 | 2019-03-01 | 武汉斗鱼鱼乐网络科技有限公司 | A kind of calculation power estimation method, device, equipment and storage medium |
| CN110348830A (en) * | 2019-06-20 | 2019-10-18 | 国家信息中心 | A kind of network system based on block chain, authentication method, equipment and storage medium |
| US20200104375A1 (en) * | 2018-09-28 | 2020-04-02 | Oracle International Corporation | Data Migration Using Source Classification and Mapping |
| CN111367679A (en) * | 2020-03-31 | 2020-07-03 | 中国建设银行股份有限公司 | Artificial intelligence computing power resource multiplexing method and device |
| CN111651253A (en) * | 2020-05-28 | 2020-09-11 | 中国联合网络通信集团有限公司 | Computing resource scheduling method and device |
-
2020
- 2020-12-01 CN CN202011383427.6A patent/CN112465359B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102694849A (en) * | 2012-05-14 | 2012-09-26 | 中国科学院计算机网络信息中心 | IOT (Internet of Things) resource information acquiring method, terminal equipment and system |
| CN103747018A (en) * | 2014-02-10 | 2014-04-23 | 重庆邮电大学 | RESTful-based ubiquitous network resource identification method and registration flow |
| CN109002342A (en) * | 2017-06-07 | 2018-12-14 | 中国科学院信息工程研究所 | A kind of computing resource orientation dispatching method and system based on OpenStack |
| US20200104375A1 (en) * | 2018-09-28 | 2020-04-02 | Oracle International Corporation | Data Migration Using Source Classification and Mapping |
| CN109408399A (en) * | 2018-12-14 | 2019-03-01 | 武汉斗鱼鱼乐网络科技有限公司 | A kind of calculation power estimation method, device, equipment and storage medium |
| CN110348830A (en) * | 2019-06-20 | 2019-10-18 | 国家信息中心 | A kind of network system based on block chain, authentication method, equipment and storage medium |
| CN111367679A (en) * | 2020-03-31 | 2020-07-03 | 中国建设银行股份有限公司 | Artificial intelligence computing power resource multiplexing method and device |
| CN111651253A (en) * | 2020-05-28 | 2020-09-11 | 中国联合网络通信集团有限公司 | Computing resource scheduling method and device |
Non-Patent Citations (4)
| Title |
|---|
| TENG LI等: "A Power-Aware Symbiotic Scheduling Algorithm for Concurrent GPU Kernels", 《2015 IEEE 21ST INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS)》, 18 January 2016 (2016-01-18), pages 562 - 569 * |
| ZHANG HENG等: "Energy-Efficient Online Resource Management and Allocation Optimization in Multi-User Multi-Task Mobile-Edge Computing Systems with Hybrid Energy Harvesting", 《SENSORS》, vol. 18, no. 09, 29 October 2018 (2018-10-29), pages 1 - 23 * |
| 刘雅东: "基于区块链的溯源信息存储平台的研究与实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》, no. 08, 15 August 2019 (2019-08-15), pages 138 - 502 * |
| 曹畅等: "面向算力网络的边缘资源调度解决方案研究", 《数据与计算发展前沿》, vol. 02, no. 04, 31 August 2020 (2020-08-31), pages 80 - 91 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021244343A1 (en) * | 2020-06-01 | 2021-12-09 | 杭州嘉楠耘智信息科技有限公司 | Cloud computing power allocation method, user terminal, cloud computing power platform and system |
| WO2023273957A1 (en) * | 2021-06-28 | 2023-01-05 | 华为技术有限公司 | Computing power release method and apparatus, and computing power update method and apparatus |
| CN113535410A (en) * | 2021-09-15 | 2021-10-22 | 航天宏图信息技术股份有限公司 | Load balancing method and system for GIS space vector distributed computation |
| WO2023083138A1 (en) * | 2021-11-12 | 2023-05-19 | 索尼集团公司 | Electronic device and method for communication system and storage medium |
| WO2023130897A1 (en) * | 2022-01-06 | 2023-07-13 | 华为技术有限公司 | Communication method, apparatus and system |
| CN116302568A (en) * | 2023-05-17 | 2023-06-23 | 算力互联(北京)科技有限公司 | Computing power resource scheduling method and system, scheduling center and data center |
| CN116501501A (en) * | 2023-06-21 | 2023-07-28 | 亚信科技（中国）有限公司 | Method and device for managing and arranging computing power resources, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112465359B (en) | 2024-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112465359A (en) | Calculation power calling method and device | |
| CN109495524B (en) | Method, equipment and system for subscribing resources of Internet of things | |
| CN110958281B (en) | Data transmission method and communication device based on Internet of things | |
| CN112363813A (en) | Resource scheduling method and device, electronic equipment and computer readable medium | |
| CN114827248A (en) | Micro-service resource allocation method and device, electronic equipment and storage medium | |
| CN114816738A (en) | Method, device and equipment for determining calculation force node and computer readable storage medium | |
| CN106713353A (en) | Intelligent seamless aggregation method and system for geographic information service | |
| Xu et al. | Design of oneM2M-based fog computing architecture | |
| CN112835632A (en) | Method and device for calling end capability and computer storage medium | |
| CA3202557A1 (en) | A data distribution method, apparatus, device and storage medium | |
| CN114979148B (en) | Data transmission method, device and computer readable storage medium | |
| WO2022143505A1 (en) | Group type identification method and apparatus, computer device, and medium | |
| CN115277707A (en) | Service processing method, device, electronic equipment and storage medium | |
| CN113541981B (en) | Member management method and system for network slice | |
| CN114125936A (en) | Resource scheduling method, device and storage medium | |
| CN114173318A (en) | Method, device and equipment for identifying to-be-optimized area | |
| CN114040422A (en) | Network parameter configuration method and device | |
| CN115994022B (en) | Algorithm service calling method and device, electronic equipment and storage medium | |
| CN116760885B (en) | Method, device, equipment, medium and program product for managing computing power network business | |
| CN116501383B (en) | Micro-service distribution method and device, electronic equipment and readable storage medium | |
| US20240160469A1 (en) | Batch scheduling-based application scheduling method, apparatus, and system | |
| CN115981872B (en) | Method and device for calling algorithm resources, electronic equipment and storage medium | |
| CN112311833B (en) | Data updating method and device | |
| CN114979153A (en) | Load balancing method, computer equipment and storage device | |
| CN113992751A (en) | Resource sharing method and device in heterogeneous network and related products |
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 |