CN118656203A - Computing power access capability assessment system for supercomputing - Google Patents
Computing power access capability assessment system for supercomputing Download PDFInfo
- Publication number
- CN118656203A CN118656203A CN202410656568.2A CN202410656568A CN118656203A CN 118656203 A CN118656203 A CN 118656203A CN 202410656568 A CN202410656568 A CN 202410656568A CN 118656203 A CN118656203 A CN 118656203A
- Authority
- CN
- China
- Prior art keywords
- computing
- task
- node
- calculation
- access capability
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000004364 calculation method Methods 0.000 claims abstract description 101
- 238000011156 evaluation Methods 0.000 claims abstract description 68
- 238000000034 method Methods 0.000 claims abstract description 32
- 238000012544 monitoring process Methods 0.000 claims abstract description 7
- 238000012216 screening Methods 0.000 claims abstract description 5
- 238000004590 computer program Methods 0.000 claims description 5
- 238000002372 labelling Methods 0.000 claims description 2
- 238000012545 processing Methods 0.000 abstract description 8
- 230000006870 function Effects 0.000 description 5
- 238000003491 array Methods 0.000 description 2
- 238000013475 authorization Methods 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 239000000470 constituent Substances 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
Classifications
-
- 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
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application provides a computing power access capability assessment system for super computing, which relates to the technical field of computing power assessment and comprises the following steps: the first evaluation module is used for performing first evaluation according to the calculation tasks in the system database and the matching degree information of the calculation nodes through a first evaluation formula so as to screen out a first calculation node to be selected; the monitoring module is used for acquiring parameter data in the process that each first computing node to be selected finishes the computing task; the second evaluation module is used for performing second evaluation according to the parameter data in the process of completing the calculation task of each first to-be-selected calculation node through a second evaluation formula so as to obtain a second to-be-selected calculation node through screening; and the third evaluation module is used for selecting a target computing node according to the second to-be-selected computing node so as to complete the computing task. The computing capacity of each computing node is evaluated through the three evaluation modules, so that the processing nodes can be more accurately selected for computing tasks, and the task processing efficiency is improved.
Description
Technical Field
The application relates to the technical field of calculation power evaluation, in particular to a calculation power access capability evaluation system for super calculation.
Background
Supercomputers are generally referred to as supercomputers, which are computers capable of performing large amounts of data and high-speed operations that cannot be handled by a typical personal computer. The constituent components are substantially identical in terms of the composition of the supercomputer and the general computer, but differ in terms of performance and scale. The main characteristics of the supercomputer comprise two aspects: the data storage capacity and the data processing speed are extremely high, so that the data storage device can perform work which cannot be performed by some people or common computers in various fields.
The existing super-calculation access capability assessment process mainly sets related requirements according to calculation tasks, a calculation node judges whether to access the related tasks according to whether the calculation power of the calculation node reaches the related requirements, if the requirements are too low, the calculation node is too high in pressure, if the requirements are too high, the calculation tasks cannot be responded later, and particularly on the premise that the calculation time requirements are relatively tight, how to efficiently assess the access capability of each calculation node is a problem to be solved.
Disclosure of Invention
The present application aims to solve at least one of the technical problems in the related art to some extent.
To this end, a first object of the application is to propose a computing power access capability assessment system for supercomputing.
A second object of the application is to propose an electronic device.
A third object of the present application is to propose a computer readable storage medium.
A fourth object of the application is to propose a computer programme product.
To achieve the above object, an embodiment of a first aspect of the present application provides a computing power access capability assessment system for super computing, including:
the system comprises a first evaluation module, a monitoring module, a second evaluation module and a third evaluation module;
The first evaluation module is used for performing first evaluation according to the calculation tasks in the system database and the matching degree information of the calculation nodes through a first evaluation formula so as to screen out a first calculation node to be selected; the matching degree information comprises content matching degree C, memory matching degree M and operation environment matching degree E;
The monitoring module is used for acquiring parameter data in the process that each first computing node to be selected finishes the computing task;
The second evaluation module is used for performing second evaluation according to the parameter data in the process of completing the calculation task of each first to-be-selected calculation node through a second evaluation formula so as to obtain a second to-be-selected calculation node through screening;
and the third evaluation module is used for selecting a target computing node according to the second to-be-selected computing node so as to complete the computing task.
Optionally, the first evaluation module is configured to:
Acquiring data information of each computing node and a currently-to-be-performed computing task in a system database in real time, and acquiring content matching degree C, memory matching degree M and operating environment matching degree E based on the acquired data information;
substituting the content matching degree C, the memory matching degree M and the operation environment matching degree E into a first evaluation formula to calculate a first calculation force access capability value K:
Wherein, alpha 1、α2、α3 is a weight coefficient, and alpha 1＝α2＝α3 is defaulted, and the weight proportion can be selected according to the task content to be calculated;
According to the formula Obtaining a first computing power access capability value K i of an ith computing node;
Comparing the first computing power access capability value K i with a first computing power access capability value threshold K 0, if the first computing power access capability value K i is greater than or equal to the first computing power access capability value threshold K 0, the computing node meets the first computing power access capability value requirement, and determining that the computing node is a first computing node to be selected, otherwise, the computing node does not meet the first computing power access capability value requirement.
Optionally, the content matching degree C is related to the content of the computing task to be performed and the computing task content processed by the computing node, and if the content of the computing task to be performed is completely within the computing task content range processed by the computing node, c=1; if the content of the calculation task to be performed is not in the calculation task content range processed by the calculation node, X=0; if the content of the computing task to be processed is partially overlapped with the computing task content range processed by the computing node, x=0.5;
The memory matching degree M is related to the memory required by the task to be calculated and the current residual memory of the computing node, and if the memory required by the task to be calculated is far smaller than the current residual memory of the computing node, M=1; if the memory required by the computing task is greater than the current residual memory of the computing node, M=0; if the calculation task demand memory is smaller than the current residual memory of the calculation node and the calculation task demand memory subtracted from the current residual memory of the calculation node is lower than a set value, M=0.5;
The operation environment matching degree E is related to an operation environment required by a to-be-calculated task and an operation system of the calculation node, and if the operation environment required by the to-be-calculated task is lower than the operation system version of the calculation node, E=1; if the operating environment in which the computing task needs to be performed is higher than the operating system version of the computing node, e=0.
Optionally, the first computing power access capability value K i is ordered from large to small according to the value of the first computing power access capability value K i, and the first candidate computing node with the top n rank is intercepted as the first evaluation result.
Optionally, the second matching module is configured to:
Acquiring operation parameter data of the first computing node to be selected in the first evaluation result;
The operating parameter data includes: the method comprises the steps of calculating the number m of tasks processed by a node, the time length T j for the calculation node to process the j-th calculation task to complete, the calculation time length T 0j for the j-th calculation task to demand, the total time length T S for the calculation node to process the m-th task, the completion degree C j for the j-th calculation task and the completion degree C 0j for the j-th calculation task to demand;
substituting the acquired parameters into a second evaluation formula to calculate a second calculation power access capability value Q:
And sequentially acquiring a second computing power access capability value Q of the first computing node to be selected according to a second evaluation formula, comparing the second computing power access capability value Q with a second computing power access capability value threshold Q 0, and if the second computing power access capability value Q is larger than the second computing power access capability value threshold Q 0, enabling the current node to meet the second computing power access capability value requirement, and taking the first computing node to be selected, which meets the second computing power access capability value requirement, as a second computing node to be selected, and taking the first computing node to be selected as a second evaluation result.
Optionally, the third evaluation module is configured to:
acquiring the second to-be-selected computing nodes and sequentially labeling;
The current computing task sends a computing request to a nearest second to-be-selected computing node, if the second to-be-selected computing node is in an idle state, the current computing task is added into a computing list to process the task, otherwise, the current computing task is transferred to an adjacent second to-be-selected computing node;
When all the second to-be-selected computing nodes receive the computing request of the current computing task, the computing request is not responded yet, and the current computing task continues to send a second computing request to the nearest second to-be-selected computing node; until the computing request is responded to by joining the task list of the computing node.
Optionally, the computing request has a life cycle, is immediately discarded if not responded to within the life cycle, and all computing nodes do not forward the current computing request.
To achieve the above object, an embodiment of a second aspect of the present application provides an electronic device, including: a processor, and a memory communicatively coupled to the processor;
the memory stores computer-executable instructions;
The processor executes computer-executable instructions stored by the memory to implement the system of any one of the first aspects.
To achieve the above object, an embodiment of a third aspect of the present application proposes a computer-readable storage medium having stored therein computer-executable instructions for implementing the system according to any of the first aspects when being executed by a processor.
To achieve the above object, an embodiment of a fourth aspect of the present application proposes a computer program product implementing the system according to any one of the first aspects when being executed by a processor.
According to the computing power access capability assessment system method, the computing power access capability assessment device, the electronic equipment and the storage medium for the super computing, a first computing power access capability value is calculated through a first assessment formula, then the first computing power access capability value is compared with a first computing power access capability value threshold value, a group of computing nodes are screened out, and the computing nodes are output as a first assessment result; sequentially obtaining second computing power access capability values of all first computing nodes which meet the first evaluation result through a second evaluation formula, and further screening a group of second computing nodes to be selected as the second evaluation result; acquiring all second to-be-selected computing nodes meeting the second evaluation result, and sending a computing request to the nearest computing node by a computing task; if the nearest computing node is not idle, forwarding the computing request to the adjacent computing node until the computing request is responded and added into the task list of the computing node, acquiring the nearest computing node which meets the computing requirement and accessing the computing task, and more accurately selecting the processing node for the computing task, thereby improving the task processing efficiency.
Additional aspects and advantages of the application will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the application.
Drawings
The foregoing and/or additional aspects and advantages of the application will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings, in which:
fig. 1 is a schematic structural diagram of a computing power access capability assessment system for super computing according to an embodiment of the present application.
Detailed Description
Embodiments of the present application are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are illustrative and intended to explain the present application and should not be construed as limiting the application.
In the existing super-calculation access capability assessment process, related requirements are set mainly according to calculation tasks, and a calculation node judges whether to access the related tasks according to whether the calculation power of the calculation node reaches the related requirements.
If the related requirements of the calculation task setting are too low, the pressure of the calculation nodes is too high, if the related requirements of the calculation task setting are too high, the calculation tasks cannot be responded later, and particularly on the premise that the calculation time requirements are relatively tight, how to efficiently evaluate the access capability of each calculation node is a problem to be solved.
In order to solve the problem, the embodiment of the application provides a computing power access capability assessment system for super-computing, and fig. 1 is a schematic flow chart of the computing power access capability assessment system for super-computing. As shown in fig. 1, the system includes:
A first evaluation module 110, a monitoring module 120, a second evaluation module 130, and a third evaluation module 140;
The first evaluation module is used for performing first evaluation according to the calculation tasks in the system database and the matching degree information of the calculation nodes through a first evaluation formula so as to screen out a first calculation node to be selected; the matching degree information comprises content matching degree C, memory matching degree M and operation environment matching degree E;
The monitoring module is used for acquiring parameter data in the process that each first computing node to be selected finishes the computing task;
The second evaluation module is used for performing second evaluation according to the parameter data in the process of completing the calculation task of each first to-be-selected calculation node through a second evaluation formula so as to obtain a second to-be-selected calculation node through screening;
and the third evaluation module is used for selecting a target computing node according to the second to-be-selected computing node so as to complete the computing task.
Optionally, the first evaluation module is configured to:
Acquiring data information of each computing node and a currently-to-be-performed computing task in a system database in real time, and acquiring content matching degree C, memory matching degree M and operating environment matching degree E based on the acquired data information;
substituting the content matching degree C, the memory matching degree M and the operation environment matching degree E into a first evaluation formula to calculate a first calculation force access capability value K:
wherein, alpha 1、α2、Δ3 is a weight coefficient, and the default delta 1＝Δ2＝α3 can select weight proportion according to the task content to be calculated;
According to the formula Obtaining a first computing power access capability value K i of an ith computing node;
Comparing the first computing power access capability value K i with a first computing power access capability value threshold K 0, if the first computing power access capability value K i is greater than or equal to the first computing power access capability value threshold K 0, the computing node meets the first computing power access capability value requirement, and determining that the computing node is a first computing node to be selected, otherwise, the computing node does not meet the first computing power access capability value requirement.
Optionally, the content matching degree C is related to the content of the computing task to be performed and the computing task content processed by the computing node, and if the content of the computing task to be performed is completely within the computing task content range processed by the computing node, c=1; if the content of the calculation task to be performed is not in the calculation task content range processed by the calculation node, X=0; if the content of the computing task to be processed is partially overlapped with the computing task content range processed by the computing node, x=0.5;
The memory matching degree M is related to the memory required by the task to be calculated and the current residual memory of the computing node, and if the memory required by the task to be calculated is far smaller than the current residual memory of the computing node, M=1; if the memory required by the computing task is greater than the current residual memory of the computing node, M=0; if the calculation task demand memory is smaller than the current residual memory of the calculation node and the calculation task demand memory subtracted from the current residual memory of the calculation node is lower than a set value, M=0.5;
The operation environment matching degree E is related to an operation environment required by a to-be-calculated task and an operation system of the calculation node, and if the operation environment required by the to-be-calculated task is lower than the operation system version of the calculation node, E=1; if the operating environment in which the computing task needs to be performed is higher than the operating system version of the computing node, e=0.
Optionally, the first computing power access capability value K i is ordered from large to small according to the value of the first computing power access capability value K i, and the first candidate computing node with the top n rank is intercepted as the first evaluation result.
Optionally, the second matching module is configured to:
Acquiring operation parameter data of the first computing node to be selected in the first evaluation result;
The operating parameter data includes: the method comprises the steps of calculating the number m of tasks processed by a node, the time length T j for the calculation node to process the j-th calculation task to complete, the calculation time length T 0j for the j-th calculation task to demand, the total time length T S for the calculation node to process the m-th task, the completion degree C j for the j-th calculation task and the completion degree C 0j for the j-th calculation task to demand;
substituting the acquired parameters into a second evaluation formula to calculate a second calculation power access capability value Q:
And sequentially acquiring a second computing power access capability value Q of the first computing node to be selected according to a second evaluation formula, comparing the second computing power access capability value Q with a second computing power access capability value threshold Q 0, and if the second computing power access capability value Q is larger than the second computing power access capability value threshold Q 0, enabling the current node to meet the second computing power access capability value requirement, and taking the first computing node to be selected, which meets the second computing power access capability value requirement, as a second computing node to be selected, and taking the first computing node to be selected as a second evaluation result.
Optionally, the third evaluation module is configured to:
acquiring the second to-be-selected computing node and sequentially marking 1,2 and 3 … p;
The current computing task sends a computing request to a nearest second to-be-selected computing node, if the second to-be-selected computing node is in an idle state, the current computing task is added into a computing list to process the task, otherwise, the current computing task is transferred to an adjacent second to-be-selected computing node;
When all the second to-be-selected computing nodes receive the computing request of the current computing task, the computing request is not responded yet, and the current computing task continues to send a second computing request to the nearest second to-be-selected computing node; until the computing request is responded to by joining the task list of the computing node.
Optionally, the method for judging whether the computing node is idle is as follows: a task list of a second candidate computing node is obtained, and if there are no pending tasks in the list, the node is considered to be idle.
Optionally, the computing request has a life cycle, is immediately discarded if not responded to within the life cycle, and all computing nodes do not forward the current computing request.
In order to achieve the above embodiment, the present application further provides an electronic device, including: a processor, and a memory communicatively coupled to the processor; the memory stores computer-executable instructions; the processor executes the computer-executable instructions stored in the memory to implement the system provided by the previous embodiments.
In order to implement the above-described embodiments, the present application also proposes a computer-readable storage medium having stored therein computer-executable instructions that, when executed by a processor, are configured to implement the system provided by the above-described embodiments.
In order to implement the above embodiments, the present application also proposes a computer program product comprising a computer program which, when executed by a processor, implements the system provided by the above embodiments.
The processing of collecting, storing, using, processing, transmitting, providing, disclosing and the like of the personal information of the user in the application accords with the regulations of related laws and regulations and does not violate the popular regulations of the public order.
It should be noted that personal information from users should be collected for legitimate and reasonable uses and not shared or sold outside of these legitimate uses. In addition, such collection/sharing should be performed after receiving user informed consent, including but not limited to informing the user to read user agreements/user notifications and signing agreements/authorizations including authorization-related user information before the user uses the functionality. In addition, any necessary steps are taken to safeguard and ensure access to such personal information data and to ensure that other persons having access to the personal information data adhere to their privacy policies and procedures.
The present application contemplates embodiments that may provide a user with selective prevention of use or access to personal information data. That is, the present disclosure contemplates that hardware and/or software may be provided to prevent or block access to such personal information data. Once personal information data is no longer needed, risk can be minimized by limiting data collection and deleting data. In addition, personal identification is removed from such personal information, as applicable, to protect the privacy of the user.
In the foregoing description of embodiments, reference has been made to the terms "one embodiment," "some embodiments," "example," "a particular example," or "some examples," etc., meaning 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 application. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. 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 application, the meaning of "plurality" means at least two, for example, two, three, etc., unless specifically 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 additional implementations are included within the scope of the preferred embodiment of the present application in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order from that shown or discussed, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the embodiments of the present application.
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 compact disc 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 application 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. As with the other embodiments, if implemented in hardware, 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 application 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 above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, or the like. While embodiments of the present application have been shown and described above, it will be understood that the above embodiments are illustrative and not to be construed as limiting the application, and that variations, modifications, alternatives and variations may be made to the above embodiments by one of ordinary skill in the art within the scope of the application.
Claims (10)
1. A computing power access capability assessment system for supercomputing, comprising: the system comprises a first evaluation module, a monitoring module, a second evaluation module and a third evaluation module;
The first evaluation module is used for performing first evaluation according to the calculation tasks in the system database and the matching degree information of the calculation nodes through a first evaluation formula so as to screen out a first calculation node to be selected; the matching degree information comprises content matching degree C, memory matching degree M and operation environment matching degree E;
The monitoring module is used for acquiring parameter data in the process that each first computing node to be selected finishes the computing task;
The second evaluation module is used for performing second evaluation according to the parameter data in the process of completing the calculation task of each first to-be-selected calculation node through a second evaluation formula so as to obtain a second to-be-selected calculation node through screening;
and the third evaluation module is used for selecting a target computing node according to the second to-be-selected computing node so as to complete the computing task.
2. The system of claim 1, wherein the first evaluation module is configured to:
Acquiring data information of each computing node and a currently-to-be-performed computing task in a system database in real time, and acquiring content matching degree C, memory matching degree M and operating environment matching degree E based on the acquired data information;
substituting the content matching degree C, the memory matching degree M and the operation environment matching degree E into a first evaluation formula to calculate a first calculation force access capability value K:
Wherein, alpha 1、α2、α3 is a weight coefficient, and alpha 1＝α2＝α3 is defaulted, and the weight proportion can be selected according to the task content to be calculated;
According to the formula Obtaining a first computing power access capability value K i of an ith computing node;
Comparing the first computing power access capability value K i with a first computing power access capability value threshold K 0, if the first computing power access capability value K i is greater than or equal to the first computing power access capability value threshold K 0, the computing node meets the first computing power access capability value requirement, and determining that the computing node is a first computing node to be selected, otherwise, the computing node does not meet the first computing power access capability value requirement.
3. The system of claim 2, wherein the content matching degree C is related to the content of the computing task to be performed and the content of the computing task processed by the computing node, and c=1 if the content of the computing task to be performed is completely within the range of the content of the computing task processed by the computing node; if the content of the calculation task to be performed is not in the calculation task content range processed by the calculation node, X=0; if the content of the computing task to be processed is partially overlapped with the computing task content range processed by the computing node, x=0.5;
The memory matching degree M is related to the memory required by the task to be calculated and the current residual memory of the computing node, and if the memory required by the task to be calculated is far smaller than the current residual memory of the computing node, M=1; if the memory required by the computing task is greater than the current residual memory of the computing node, M=0; if the calculation task demand memory is smaller than the current residual memory of the calculation node and the calculation task demand memory subtracted from the current residual memory of the calculation node is lower than a set value, M=0.5;
The operation environment matching degree E is related to an operation environment required by a to-be-calculated task and an operation system of the calculation node, and if the operation environment required by the to-be-calculated task is lower than the operation system version of the calculation node, E=1; if the operating environment in which the computing task needs to be performed is higher than the operating system version of the computing node, e=0.
4. The system of claim 2, wherein the first computing force access capability value K i is ordered from a large value to a small value of the first computing force access capability value K i, and a first candidate computing node n in front of the rank is intercepted as the first evaluation result.
5. The system of claim 4, wherein the second matching module is configured to:
Acquiring operation parameter data of the first computing node to be selected in the first evaluation result;
The operating parameter data includes: the method comprises the steps of calculating the number m of tasks processed by a node, the time length T j for the calculation node to process the j-th calculation task to complete, the calculation time length T 0j for the j-th calculation task to demand, the total time length T S for the calculation node to process the m-th task, the completion degree C j for the j-th calculation task and the completion degree C 0j for the j-th calculation task to demand;
substituting the acquired parameters into a second evaluation formula to calculate a second calculation power access capability value Q:
And sequentially acquiring a second computing power access capability value Q of the first computing node to be selected according to a second evaluation formula, comparing the second computing power access capability value Q with a second computing power access capability value threshold Q 0, and if the second computing power access capability value Q is larger than the second computing power access capability value threshold Q 0, enabling the current node to meet the second computing power access capability value requirement, and taking the first computing node to be selected, which meets the second computing power access capability value requirement, as a second computing node to be selected, and taking the first computing node to be selected as a second evaluation result.
6. The system of claim 5, wherein the third evaluation module is configured to:
acquiring the second to-be-selected computing nodes and sequentially labeling;
The current computing task sends a computing request to a nearest second to-be-selected computing node, if the second to-be-selected computing node is in an idle state, the current computing task is added into a computing list to process the task, otherwise, the current computing task is transferred to an adjacent second to-be-selected computing node;
When all the second to-be-selected computing nodes receive the computing request of the current computing task, the computing request is not responded yet, and the current computing task continues to send a second computing request to the nearest second to-be-selected computing node; until the computing request is responded to by joining the task list of the computing node.
7. The system of claim 1, wherein the compute request has a lifecycle that is immediately discarded if not responded to within the lifecycle, and wherein none of the compute nodes forward the current compute request.
8. An electronic device, comprising: a processor, and a memory communicatively coupled to the processor;
the memory stores computer-executable instructions;
The processor executes computer-executable instructions stored by the memory to implement the system of any one of claims 1-7.
9. A computer readable storage medium having stored therein computer executable instructions which when executed by a processor are for implementing the system of any of claims 1-7.
10. A computer program product comprising a computer program which, when executed by a processor, implements the system of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410656568.2A CN118656203A (en) | 2024-05-24 | 2024-05-24 | Computing power access capability assessment system for supercomputing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410656568.2A CN118656203A (en) | 2024-05-24 | 2024-05-24 | Computing power access capability assessment system for supercomputing |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN118656203A true CN118656203A (en) | 2024-09-17 |
Family
ID=92699837
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410656568.2A Pending CN118656203A (en) | 2024-05-24 | 2024-05-24 | Computing power access capability assessment system for supercomputing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118656203A (en) |
-
2024
- 2024-05-24 CN CN202410656568.2A patent/CN118656203A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6542881B1 (en) | System and method for revealing necessary and sufficient conditions for database analysis | |
| KR101781450B1 (en) | Method and Apparatus for Calculating Risk of Cyber Attack | |
| US20090019546A1 (en) | Method and Apparatus for Modeling Computer Program Behaviour for Behavioural Detection of Malicious Program | |
| CN112667778A (en) | Information input method, device, equipment and storage medium combining RPA and AI | |
| CN106452858B (en) | A kind of method, apparatus and calculating equipment of the identification network user | |
| CN112839014B (en) | Method, system, equipment and medium for establishing abnormal visitor identification model | |
| CN110633120A (en) | Configuration software control processing method, device, server, user terminal and system | |
| KR101421136B1 (en) | Method and apparatus for modeling computer program behavior for behavioral detection of malicious program | |
| CN105893471B (en) | Data processing method and electronic equipment | |
| CN110543756B (en) | Device identification method and device, storage medium and electronic device | |
| CN114785616A (en) | Data risk detection method and device, computer equipment and storage medium | |
| CN116226865A (en) | Security detection method, device, server, medium and product of cloud native application | |
| CN108536812B (en) | Method, device and equipment for clearing invalid data resources and computer readable medium | |
| CN114064168A (en) | Interface optimization method and medical equipment | |
| CN118656203A (en) | Computing power access capability assessment system for supercomputing | |
| CN110852384A (en) | Medical image quality detection method, device and storage medium | |
| Alherbawi et al. | JPEG image classification in digital forensic via DCT coefficient analysis | |
| US7603376B1 (en) | File and folder scanning method and apparatus | |
| CN111104963B (en) | Target user determining method and device, storage medium and electronic equipment | |
| CN111142898A (en) | Data leakage-proof terminal upgrading method and system based on group intelligent mode | |
| CN110968467A (en) | Remote automatic test method for GPU and algorithm | |
| CN114756467B (en) | Buried data detection method, buried data detection device, storage medium and storage device | |
| CN117395616B (en) | Method, device, equipment and storage medium for identifying non-trusted code | |
| JP2629412B2 (en) | Data extraction device for performance evaluation | |
| CN118484323A (en) | Computing force reliability evaluation system for intelligent computing force access and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination |