CN114356240B - Method for rapidly and efficiently checking capacity flow - Google Patents
Method for rapidly and efficiently checking capacity flow Download PDFInfo
- Publication number
- CN114356240B CN114356240B CN202111682409.2A CN202111682409A CN114356240B CN 114356240 B CN114356240 B CN 114356240B CN 202111682409 A CN202111682409 A CN 202111682409A CN 114356240 B CN114356240 B CN 114356240B
- Authority
- CN
- China
- Prior art keywords
- capacity
- flow
- current
- information
- 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.)
- Active
Links
Abstract
The invention relates to the technical field of capacity inspection, and discloses a method for rapidly and efficiently inspecting a capacity flow, which comprises the following steps: s1, receiving a capacity dispatching request, selecting an optimal transmission line under the current capacity dispatching request from the Internet, and determining the attribute and the type of the current capacity; s2, acquiring a special scheduling echelon which is associated with the capacity allocation information and has a unique identifier, and generating a flow program and a flow script corresponding to the flow identifier under the current capacity information through information analysis. The method can predict the resource capacity and analyze the content in real time, establishes the final allocation task of the resource capacity by utilizing a mode of repeatedly checking a plurality of groups of schemes, avoids the phenomenon of uneven allocation of the resource capacity, ensures that the resource capacity is allocated more efficiently and intelligently, can check the target mirror image area according to mapping modes under different internal memories, can accurately judge whether the current memory capacity exceeds the standard, and reduces the research and development cost.
Description
Technical Field
The invention relates to the technical field of capacity inspection, in particular to a method for rapidly and efficiently inspecting a capacity flow.
Background
The system is widely applied to the measurement of reserves of computer hard disks, batteries and the like, along with the rapid development of computers, artificial intelligence and big data technologies, traditional rule or flow business is transferred from off-line to on-line, namely, the rule or flow business is realized based on the computer technology, and because most of rule or flow business logics are complex, correspondingly, capacity flow configuration is complex, if configuration flows are not strictly tested and are very easy to make mistakes, the correctness of the flows cannot be guaranteed, the operation of the businesses is influenced, and immeasurable loss and negative influence are caused, especially, the management flows, wind control flows, approval flows and the like are more strict to node control flows.
In the existing capacity flow checking process, the resource capacity cannot be predicted and analyzed in real time, the phenomenon of nonuniform resource capacity allocation is easy to occur, meanwhile, the target mirror image area is difficult to check according to the mapping modes under different memories, and whether the memory capacity exceeds the standard cannot be judged. Accordingly, one skilled in the art provides a method for rapidly and efficiently inspecting a capacity flow to solve the problems set forth in the background art.
Disclosure of Invention
The invention aims to provide a method for rapidly and efficiently checking a capacity flow, which can predict the capacity of a resource and analyze the content in real time, determine an executable configuration scheme of current capacity information according to the change trend and possible change value of capacity data under current historical stream data, establish a final resource capacity allocation task by using a mode of repeated checking of a plurality of groups of schemes, avoid the phenomenon of uneven resource capacity allocation, ensure that the resource capacity allocation is more efficient and intelligent, and can check a target mirror image area according to mapping modes under different memories, accurately judge whether the current memory capacity exceeds the standard, and reduce the research and development cost.
In order to achieve the above purpose, the present invention provides the following technical solutions:
a method for rapidly and efficiently verifying a capacity flow, comprising the steps of:
s1, receiving a capacity dispatching request, selecting an optimal transmission line under the current capacity dispatching request from the Internet, and determining the attribute and the type of the current capacity;
s2, acquiring a special scheduling echelon which is associated with the capacity allocation information and has a unique identifier from the capacity allocation information, and generating a flow program and a flow script corresponding to the flow identifier under the current capacity information through information analysis;
s3, executing the current flow program and the flow script, determining a flow node in the current system flow, and simultaneously acquiring node information of the non-executed flow node in the system flow and a flow execution result;
s4, monitoring the flow execution result and node information of the executed flow nodes in real time, displaying the monitoring result after generating the monitoring result, and performing flow verification on the monitoring result;
s5, determining a mapping state and a minimum storage capacity under the current capacity flow, and predicting an optimal storage position and an optimal addressing range of a suspected mirror area of the current capacity flow after identifying the mapping state and the minimum storage capacity;
s6, carrying out gradual cleaning and analysis on capacity information in the optimal storage position and the optimal addressing range, carrying out flattening and optimizing treatment on the cleaned and analyzed capacity information, then determining an executable configuration scheme of the current capacity information according to the change trend and possible change value of capacity class data in the current historical stream data, and simultaneously establishing a resource capacity final allocation task by using a mode of repeated inspection of a plurality of groups of schemes.
As still further aspects of the invention: the flow script is a visual flow script, and the visual flow script comprises a flow identifier, a flow memory, flow nodes, flow endpoints, flow distribution diagrams and position relations among the nodes.
As still further aspects of the invention: after the flow verification, the visualized flow script is analyzed into capacity preset thresholds in multiple time periods and multiple states, meanwhile, the highest threshold point and the lowest threshold point under the current capacity preset threshold are established, and an execution model under the current capacity flow operation is established.
As still further aspects of the invention: the node information includes node identification, node location, node number, node type, node status, and node response parameters.
As still further aspects of the invention: in the step S5, after the mapping state and the minimum storage capacity are identified, time sequence analysis is performed on the resource types of each capacity information deployed in the same environment, and capacity information acquisition is performed by using a virtualization analysis mode.
As still further aspects of the invention: and after the optimal addressing range in the S5 is predicted, determining the starting position of the current optimal addressing range, establishing a first information node and a second information node according to the starting position, and finally checking whether a target mirror image area exists in the current addressing range according to the established first information node and second information node.
As still further aspects of the invention: and when a target mirror image area exists in the current addressing range, actively marking the target mirror image area, and meanwhile, after grouping inspection is carried out on the target mirror image area under the active marking, identifying the address length in the target mirror image area.
As still further aspects of the invention: after the execution model is created, generating model data under the current execution model, judging and classifying the current model data, then checking the model data in a sequential prediction mode, and finally outputting a predicted value in real time.
Compared with the prior art, the invention has the beneficial effects that: the method can predict the resource capacity and analyze the content in real time, and determine the executable configuration scheme of the current capacity information according to the change trend and the possible change value of the capacity class data under the current historical stream data, and simultaneously establish the final resource capacity allocation task by using a mode of repeated inspection of a plurality of groups of schemes, thereby avoiding the phenomenon of uneven resource capacity allocation, ensuring that the resource capacity allocation is more efficient and intelligent, simultaneously inspecting the target mirror image area according to the mapping modes under different memories, accurately judging whether the current memory capacity exceeds the standard, and reducing the research and development cost.
Detailed Description
Example 1
A method for rapidly and efficiently verifying a capacity flow, comprising the steps of:
s1, receiving a capacity dispatching request, selecting an optimal transmission line under the current capacity dispatching request from the Internet, and determining the attribute and the type of the current capacity;
s2, acquiring a special scheduling echelon which is associated with the capacity allocation information and has a unique identifier from the capacity allocation information, and generating a flow program and a flow script corresponding to the flow identifier under the current capacity information through information analysis;
s3, executing the current flow program and the flow script, determining a flow node in the current system flow, and simultaneously acquiring node information of the non-executed flow node in the system flow and a flow execution result;
s4, monitoring the flow execution result and node information of the executed flow nodes in real time, displaying the monitoring result after generating the monitoring result, and performing flow verification on the monitoring result;
s5, determining a mapping state and a minimum storage capacity under the current capacity flow, and predicting an optimal storage position and an optimal addressing range of a suspected mirror area of the current capacity flow after identifying the mapping state and the minimum storage capacity;
s6, carrying out gradual cleaning and analysis on capacity information in the optimal storage position and the optimal addressing range, carrying out flattening and optimizing treatment on the cleaned and analyzed capacity information, then determining an executable configuration scheme of the current capacity information according to the change trend and possible change value of capacity class data in the current historical stream data, and simultaneously establishing a resource capacity final allocation task by using a mode of repeated inspection of a plurality of groups of schemes.
Preferably: the flow script is a visual flow script, and the visual flow script comprises a flow identifier, a flow memory, flow nodes, flow endpoints, a flow distribution diagram and a position relation among all the nodes.
Preferably: after the flow verification, the visualized flow script is analyzed into capacity preset thresholds in multiple time periods and multiple states, meanwhile, the highest threshold point and the lowest threshold point under the current capacity preset threshold are established, and an execution model under the current capacity flow operation is established.
Preferably: the node information includes node identification, node location, number of nodes, node type, node status, and node response parameters.
Preferably: and S5, after the mapping state and the minimum storage capacity are identified, performing time sequence analysis on the resource types of the capacity information deployed in the same environment, and performing capacity information acquisition in a virtualization analysis mode.
Preferably: and S5, after the optimal addressing range is predicted, determining a starting position under the current optimal addressing range, establishing a first information node and a second information node according to the starting position, and finally checking whether a target mirror image area exists in the current addressing range according to the established first information node and second information node.
Preferably: and when the target mirror image area exists in the current addressing range, actively marking the target mirror image area, and meanwhile, after grouping inspection is carried out on the target mirror image area under the active marking, identifying the address length in the target mirror image area.
Preferably: after the execution model is created, generating model data under the current execution model, judging and classifying the current model data, then checking the model data in a sequential prediction mode, and finally outputting a predicted value in real time.
The method can predict the resource capacity and analyze the content in real time, and determine the executable configuration scheme of the current capacity information according to the change trend and the possible change value of the capacity class data under the current historical stream data, and simultaneously establish the final resource capacity allocation task by using a mode of repeated inspection of a plurality of groups of schemes, thereby avoiding the phenomenon of uneven resource capacity allocation, ensuring that the resource capacity allocation is more efficient and intelligent, simultaneously inspecting the target mirror image area according to the mapping modes under different memories, accurately judging whether the current memory capacity exceeds the standard, and reducing the research and development cost.
The foregoing has shown and described the basic principles, principal features and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, and that the above embodiments and descriptions are merely illustrative of the principles of the present invention, and various changes and modifications may be made without departing from the spirit and scope of the invention, which is defined in the appended claims.
Claims (8)
1. A method for rapidly and efficiently checking a capacity flow, comprising the steps of:
s1, receiving a capacity dispatching request, selecting an optimal transmission line under the current capacity dispatching request from the Internet, and determining the attribute and the type of the current capacity;
s2, acquiring a special scheduling echelon which is associated with the capacity allocation information and has a unique identifier from the capacity allocation information, and generating a flow program and a flow script corresponding to the flow identifier under the current capacity information through information analysis;
s3, executing the current flow program and the flow script, determining a flow node in the current system flow, and simultaneously acquiring node information of the non-executed flow node in the system flow and a flow execution result;
s4, monitoring the flow execution result and node information of the executed flow nodes in real time, displaying the monitoring result after generating the monitoring result, and performing flow verification on the monitoring result;
s5, determining a mapping state and a minimum storage capacity under the current capacity flow, and predicting an optimal storage position and an optimal addressing range of a suspected mirror area of the current capacity flow after identifying the mapping state and the minimum storage capacity;
s6, carrying out gradual cleaning and analysis on capacity information in the optimal storage position and the optimal addressing range, carrying out flattening and optimizing treatment on the cleaned and analyzed capacity information, then determining an executable configuration scheme of the current capacity information according to the change trend and possible change value of capacity class data in the current historical stream data, and simultaneously establishing a resource capacity final allocation task by using a mode of repeated inspection of a plurality of groups of schemes.
2. The method of claim 1, wherein the flow script is a visual flow script comprising a flow identifier, a flow memory, a flow node, a flow endpoint, a flow profile, and a positional relationship between nodes.
3. The method for quickly and efficiently checking a capacity flow according to claim 1, wherein after the flow checking, the visualized flow script is parsed into capacity preset thresholds in multiple time periods and multiple states, and a highest threshold point and a lowest threshold point under the current capacity preset threshold are established at the same time, and an execution model under the current capacity flow operation is created.
4. The method of claim 1, wherein the node information includes node identification, node location, number of nodes, node type, node status, and node response parameters.
5. The method for rapidly and efficiently checking capacity flow according to claim 1, wherein in S5, after identifying the mapping state and the minimum storage capacity, time sequence analysis is further performed on the resource types of each capacity information deployed in the same environment, and capacity information collection is performed by using a virtualization analysis manner.
6. The method according to claim 1, wherein after the optimal addressing realm is predicted in S5, determining a start position under the current optimal addressing realm, establishing a first information node and a second information node according to the start position, and finally checking whether a target image area exists in the current addressing realm according to the established first information node and second information node.
7. The method for quickly and efficiently checking a capacity flow according to claim 6, wherein the target image area exists in the current addressing area, the target image area is actively marked, and the address length in the target image area is identified after the target image area under the active mark is subjected to packet inspection.
8. A method for rapidly and efficiently checking a capacity flow according to claim 3, wherein after the execution model is created, model data under the current execution model is generated, the current model data is judged and classified, then the model data is checked by means of sequential prediction, and finally a predicted value is output in real time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111682409.2A CN114356240B (en) | 2021-12-30 | 2021-12-30 | Method for rapidly and efficiently checking capacity flow |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111682409.2A CN114356240B (en) | 2021-12-30 | 2021-12-30 | Method for rapidly and efficiently checking capacity flow |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114356240A CN114356240A (en) | 2022-04-15 |
| CN114356240B true CN114356240B (en) | 2023-09-26 |
Family
ID=81106128
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111682409.2A Active CN114356240B (en) | 2021-12-30 | 2021-12-30 | Method for rapidly and efficiently checking capacity flow |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114356240B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102365855A (en) * | 2009-01-28 | 2012-02-29 | 海德沃特合作I有限公司 | Network based ambient services |
| CN102929787A (en) * | 2011-09-12 | 2013-02-13 | 微软公司 | Allocation strategies for storage device sets |
| CN105897865A (en) * | 2016-03-29 | 2016-08-24 | 北京轻元科技有限公司 | Protocol-independent network file service management system and method |
| CN107908475A (en) * | 2017-11-09 | 2018-04-13 | 深圳市创维软件有限公司 | A kind of memory size determination methods, server and storage medium |
| US9996573B1 (en) * | 2014-03-21 | 2018-06-12 | Amazon Technologies, Inc. | Distributed system capacity dial-up |
| CN110234146A (en) * | 2019-05-25 | 2019-09-13 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Distributed self-adaption cluster-dividing method suitable for self-organizing network |
| CN110765479A (en) * | 2019-11-03 | 2020-02-07 | 长沙豆芽文化科技有限公司 | Big data loss prevention method, device and equipment |
| CN112085412A (en) * | 2020-09-21 | 2020-12-15 | 王渡江 | Resource optimization distribution system and distribution method |
| CN113795826A (en) * | 2019-06-27 | 2021-12-14 | 英特尔公司 | Automated resource management for distributed computing |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3015981B1 (en) * | 2014-10-31 | 2018-07-25 | Khalifa University of Science, Technology and Research | Networked resource provisioning system |
| JP7304215B2 (en) * | 2019-06-18 | 2023-07-06 | 株式会社日立製作所 | Storage system and history information management method |
| US11435910B2 (en) * | 2019-10-31 | 2022-09-06 | EMC IP Holding Company LLC | Heterogeneous mapped redundant array of independent nodes for data storage |
-
2021
- 2021-12-30 CN CN202111682409.2A patent/CN114356240B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102365855A (en) * | 2009-01-28 | 2012-02-29 | 海德沃特合作I有限公司 | Network based ambient services |
| CN102929787A (en) * | 2011-09-12 | 2013-02-13 | 微软公司 | Allocation strategies for storage device sets |
| US9996573B1 (en) * | 2014-03-21 | 2018-06-12 | Amazon Technologies, Inc. | Distributed system capacity dial-up |
| CN105897865A (en) * | 2016-03-29 | 2016-08-24 | 北京轻元科技有限公司 | Protocol-independent network file service management system and method |
| CN107908475A (en) * | 2017-11-09 | 2018-04-13 | 深圳市创维软件有限公司 | A kind of memory size determination methods, server and storage medium |
| CN110234146A (en) * | 2019-05-25 | 2019-09-13 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Distributed self-adaption cluster-dividing method suitable for self-organizing network |
| CN113795826A (en) * | 2019-06-27 | 2021-12-14 | 英特尔公司 | Automated resource management for distributed computing |
| CN110765479A (en) * | 2019-11-03 | 2020-02-07 | 长沙豆芽文化科技有限公司 | Big data loss prevention method, device and equipment |
| CN112085412A (en) * | 2020-09-21 | 2020-12-15 | 王渡江 | Resource optimization distribution system and distribution method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114356240A (en) | 2022-04-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3557819B1 (en) | Server failure detection method and system | |
| CN106886485B (en) | System capacity analysis and prediction method and device | |
| CN111835582B (en) | Configuration method and device of Internet of things inspection equipment and computer equipment | |
| CN112382582A (en) | Wafer test classification method and system | |
| CN110691009B (en) | Network equipment inspection method and device | |
| CN101882105A (en) | Method for testing response time of Web page under concurrent environment | |
| CN110388773A (en) | Fault detection method, system and the water cooler of water cooler | |
| CN105184886A (en) | Cloud data center intelligence inspection system and cloud data center intelligence inspection method | |
| CN112183780A (en) | Fault maintenance guiding method, device and system and storage medium | |
| CN105426915A (en) | Support vector machine-based prediction method and system | |
| CN114356240B (en) | Method for rapidly and efficiently checking capacity flow | |
| CN113395182B (en) | Intelligent network equipment management system and method with fault prediction | |
| CN114202179A (en) | Target enterprise identification method and device | |
| CN102567351B (en) | Testing method and testing device for database modification effects | |
| CN110399926B (en) | Street lamp fault diagnosis method and device | |
| CN102546652B (en) | System and method for server load balancing | |
| Ahmed et al. | Automated diagnostic of virtualized service performance degradation | |
| EP4152715A1 (en) | Method and apparatus for determining resource configuration of cloud service system | |
| CN109740766B (en) | Industrial equipment maintenance service planning method | |
| CN116346395A (en) | Industrial control network asset identification method, system, equipment and storage medium | |
| CN111614504A (en) | Power grid regulation and control data center service characteristic fault positioning method and system based on time sequence and fault tree analysis | |
| CN116628381A (en) | AI prediction-based web page data design module fault lossless recovery method | |
| CN105469141A (en) | Neural-network-based prediction method and system | |
| CN105227410A (en) | Based on the method and system that the server load of adaptive neural network detects | |
| CN110875834A (en) | Wind control model creating method, wind control evaluation method and related device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |