CN108154294A - A kind of method of the safe bearing load equilibrium of isomeric group safety supervision equipment - Google Patents
A kind of method of the safe bearing load equilibrium of isomeric group safety supervision equipment Download PDFInfo
- Publication number
- CN108154294A CN108154294A CN201711400903.9A CN201711400903A CN108154294A CN 108154294 A CN108154294 A CN 108154294A CN 201711400903 A CN201711400903 A CN 201711400903A CN 108154294 A CN108154294 A CN 108154294A
- Authority
- CN
- China
- Prior art keywords
- node
- load
- equilibrium
- nodes domains
- balanced
- 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
- 238000000034 method Methods 0.000 title claims abstract description 10
- 238000000638 solvent extraction Methods 0.000 claims abstract description 3
- 238000012544 monitoring process Methods 0.000 claims description 5
- 241001582888 Lobus Species 0.000 claims description 4
- 238000004364 calculation method Methods 0.000 claims 1
- 238000007689 inspection Methods 0.000 claims 1
- 238000005303 weighing Methods 0.000 claims 1
- 238000004519 manufacturing process Methods 0.000 abstract description 5
- 238000013439 planning Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 5
- 230000002035 prolonged effect Effects 0.000 description 2
- 230000032683 aging Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
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
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
- G06Q50/265—Personal security, identity or safety
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Educational Administration (AREA)
- Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Computer Security & Cryptography (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Multi Processors (AREA)
Abstract
The present invention provides a kind of method of isomeric group safety supervision equipment safety load balancing, the safe bearing load field applied to I/O intensity isomeric group safety supervision equipment.It is characterized in that：Partitioning site domain is classified, calculates the load per level-one nodes domains, and according to Node B threshold and actual node loading condition, effective load balancing is carried out to nodes domains interior nodes.The invention is dedicated to how planning as a whole the old and new's equipment, carries out load balancing to safety supervision equipment, reduces the spoilage of safety supervision equipment, improves production safety.
Description
Technical field
The present invention relates to a kind of methods of the safe bearing load equilibrium of isomeric group safety supervision equipment.
Background technology
To development, most basic is to keep the safety in production, and the security of the lives and property of employee and public resource is responsible for for enterprise.
And it is also most important one of defence line that safety supervision equipment, which is first to keep the safety in production,.But due to bankroll problem, most of enterprises
The safety supervision equipment of industry is not a whole set of update, but local updating in batches.This has resulted in the product algebraically of safety supervision equipment not
Together, the load pressure that can carry is different, and the large scale scale heterogeneous property of safety supervision equipment causes excessive in certain average load pressure
In the case of, the old easy excess load delivery of equipment causes the damage of equipment, so as to cause very big potential risk to production safety.
This patent is dedicated to how planning as a whole the old and new's equipment, and load balancing is carried out to safety supervision equipment, so that each safety supervision equipment carrying
Load will be less than its highest load red line, reduce safety supervision equipment spoilage, improve production safety.
Invention content
The present invention provides a kind of method of isomeric group safety supervision equipment safety load balancing：
1. determine the implementation set of node NS of isomeric group safety supervision equipment.
2. the identical block number of copies according to having between node is divided into N number of nodes domains.
3. collect the nominal load L of each node deviceRWith actual loading LS。
4. threshold value M=safety supervision equipment nominal loads L in nodes domains is setR× 125%.
5. in the nodes domains, if there is node actual loading>Threshold value M must then carry out load balancing in nodes domains, otherwise without
Need load balancing (herein and being known as loading successfully).
6. check nodes domains quantity N (N=N+) whether there is N=0, if N ≠ 0, carry out next step operation；If N=0,
Balancing procedure terminates and returns the result.
7. will be more than that the node of threshold value and other several nodes no more than threshold value are carried out shown in algorithm 1 in same nodes domains
Load balancing, while N--.
8. calculate L at this timesWith each equipment M difference H, and judge that H's is positive and negative, while judgment step is 6.：
9. if the arbitrary H of nodes domains is equal after equilibrium<=0, then balanced success；Otherwise H is still had>0 balanced failure, it is existing
Equipment can not carry out the load balancing of effective and safe.
Beneficial outcomes of the present invention are：It can be the load balancing scheme that isomeric group safety supervision equipment carries out effective safety, make
The load that each safety supervision node is operated within conventional load is obtained, ageing equipment caused by due to overload is reduced and damages,
Prevent the safety accident caused by safety supervision equipment damage is the monitoring management deficiency of accident.
【Specific embodiment】
1. determine the implementation set of node NS of isomeric group safety supervision equipment.
The selection of safety supervision set of node NS is not that this patent discusses range, therefore in this patent, it is assumed that it has chosen and has completed
Arbitrary node ns may have any number of job task data block copy in implementation the set of node NS, NS of safety supervision equipment；To
Entire task is completed, NS must include small task block d in the set of data blocks D, D that all completion required by task are wantedi∈ D, i=N+, have
riA copy is randomly dispersed on random ns.
2. partitioning site domain is carried out to NS according to task data block copy.
In original state, if the intersection of two nodes has any one identical data block copy, as one one
Grade nodes domains；Then to each two node in first nodes domain, continue intersection calculating, if there is node that there is any two phase
Same data block copy, then as two-level node domain ..., until having most n between the node of n-th grade of nodes domains
A data block copy, as shown in Figure 1.
3. collect the conventional load L of each node deviceRWith actual loading LS。
By the conventional load L of each node by the way of industrial Internet of ThingsRWith actual loading LSData are uploaded to high in the clouds number
It is stored according to center, in case the processing of next step.
4. threshold value M=safety supervision equipment conventional loads L in nodes domains is setR× 125%.
5. checking in the nodes domains, L is calculatedsWith each M differences H：H=Ls- M, if there are H>It must be carried out in 0 nodes domains
Otherwise load balancing (herein also referred to as loads successfully) without load balancing.
6. check whether nodes domains quantity N has residue：The balanced upward merging treatment of time stage merges carry out " N-- " every time
Operation；If during N=0, representing nodes domains without residue, stop merging treatment at this time, and combine that H is positive and negative to return the result that (result is chatted
It states and sees step 9.)；If N ≠ 0, continue to operate in next step.
7. will be more than that the node of threshold value and other several nodes no more than threshold value are carried out shown in algorithm 1 in same nodes domains
Load balancing.
8. calculate the L after equilibriumsWith each M differences H：H=Ls-M；And judge the positive and negative item as next step operation of H
Part.
9. carrying out step at this time, 6. whether decision node domain N is also remaining and H positive and negative；If N ≠ 0, with upper level section
Point domain merges, and continues to carry out equilibrium according to algorithm 1；If N=0 and H>0, then illustrate that existing nodes domains can not complete isomery safety supervision
The safe bearing load of cluster is balanced, must replace updating apparatus cluster or reduce load total amount；If N=0 and all H<=0, then illustrate
All L in nodes domains at presentsAlready less than equal to threshold value, illustrate load balancing success.
Algorithm 1 (algorithm is operated in inside arbitrary level-one nodes domains) includes the following steps：
1. the load mean value L in calculate node domainavg。
2. by the sequence of node load number progress from small to large in nodes domains.
3. to load number as with reference to criterion, a balanced binary tree is established.
4. it is balanced that pairing is carried out to leafy node, each equilibrium quantity is τ, similarly hereinafter.
If 5. after equilibrium, to the equilibrium result T of any two leaf nodeij, (i, j ∈ N+, TijRepresent i nodes and j
The result of number node equilibrium), TijInterior arbitrary H<=0, then step equilibrium success；If after equilibrium, to any two leaf node
Equilibrium result Tij, there are TijInterior H>0, then the step equilibrium fails.
6. as the equilibrium result T of failureij>At one, continue the equilibrium of step 4. between the equilibrium result of failure；When
The equilibrium result T of failureijQuantity=1 or when P (X is leafy node number) it is secondary it is balanced still can not be into
Work(, at this time no matter balanced success or not, with it is balanced for the first time when node father node equilibrium result carry out balanced, repetition step
4. the and judgement of repetition 5. 6..
7. when being balanced to upwards with root node equilibrium, equilibrium terminates.If H at this time<=0, then balanced success, return
Equilibrium result；Otherwise it is balanced can not to carry out effective safe bearing load for return existing equipments.
1 specific implementation step of algorithm (as shown in Figure 5)：
1. as the load L of i-nodei>During M, which needs to carry out load balancing.Assuming that there are P node, L in nodes domainsiGeneration
(i ∈ N i-th in table nodes domains+) a node load number, then load mean value L in nodes domainsavg：
2. by the sequence of node load number progress from small to large in nodes domains.Establish a complete binary tree；It will carry out at that time
Adjustment, becomes a balanced binary tree, finally formed binary tree left subtree is respectively less than right subtree, as receiving
(receive) side；Right subtree will be used as send (send) side, sender by a part of load balancing to reciever, such as Fig. 4 institutes
Show.
3. most left most lobus dexter child node to binary tree, secondary left lobus dexter child node ... in pairs (Group) into
Row is balanced；If certain node is sky, pairing node is directly merged into father node and between later stage participation carries out father node
Equilibrium, each equilibrium quantity are τ, similarly hereinafter.
If 4. after equilibrium, to the equilibrium result T of any two leaf nodeij, (i, j ∈ N+, TijRepresent i nodes and j
The result of number node equilibrium), TijInterior arbitrary H<=0, then step equilibrium success.If after equilibrium, to any two leaf node
Equilibrium result Tij, there are TijInterior H>0, then the step equilibrium fails.
If 5. because there is the equilibrium result of failure, only there are two types of may：One failure result or multiple results；When failure
Equilibrium result Tij>At 1, continue the equilibrium of step 4. between the equilibrium result of failure；As the equilibrium result T of failureij
Quantity=1 or when P (X is leafy node number) secondary equilibrium still can not succeed, at this time no matter it is balanced into
Whether work(, with it is balanced for the first time when node father node equilibrium result carry out balanced, repeat step 3., and repetition 4. sentencing 5.
It is disconnected.
6. when being balanced to upwards with root node equilibrium, equilibrium terminates；If H at this time<=0, then balanced success, return
Equilibrium result.Otherwise it is balanced can not to carry out effective safe bearing load for return existing equipments.
7. enabling ρ, the actual loading distinctiveness ratio between any two leaf node i, j is for node actual loading distinctiveness ratio：
ρ=Li-Lj；
The distinctiveness ratio parameter important as one is loaded, when operation concurrency is bigger, determining two can be improved not
With the accuracy of equilibrium quantity between load node；It is as shown in Figure 6 that lab diagram can be obtained by measuring and calculating.
When balanced every time, send side actively sends a request to receive, external environment such as network rings during due to balanced node
The interference in border causes to have certain operating lag and packet loss；If receive does not give respond for the first time, as response is prolonged
Late；Request is retransmitted by send side at this time, is responded until receiving.
Data block packet rate is lost in the domain of send requests for ∈, receive operating lags rate is θ, and packet loss is higher, and response is prolonged
Slow rate is higher, and load distinctiveness ratio is higher, then equalization data amount can accordingly increase the equilibrium that strives for success, then each balanced data block
Measuring τ is：
V is safety supervision monitoring grade, V is higher, then equilibrium quantity accordingly improves as coefficient；Known node safety supervision monitoring grade is V,
Value is 1,2,3,4,5.Higher grade, and value is bigger.If no special safety supervision monitoring demand, monitors grade point and takes 1.If have
Specific demand, then according to following criteria Qualitative：
Description of the drawings：
Fig. 1 is that nodes domains divide schematic diagram；
Fig. 2 is the balanced schematic diagram of classification
Fig. 3：Individual node domain schematic internal view (note：Figure therein represents safety supervision heterogeneous nodes equipment)
Fig. 4：Nodes domains inner equilibrium binary tree schematic diagram
Fig. 5：1 schematic diagram of algorithm
Fig. 6：Whether there is differences of the ρ to equally loaded amount
Fig. 7：The method particular flow sheet of the safe bearing load equilibrium of isomeric group safety supervision equipment.
Claims (1)
1. a kind of method of the safe bearing load equilibrium of isomeric group safety supervision equipment, it is characterised in that：
Determine the implementation set of node NS of isomeric group safety supervision equipment.
Classification partitioning site domain is carried out according to the identical rate of the data block copy of each node.
Collect conventional load and the actual loading of each node device.
Calculate the initial load average value per level-one.
Threshold value M in nodes domains is set, and value is safety supervision equipment conventional load LR× 125%.
In the nodes domains, load and the judgement of threshold value are carried out, if there is node load>Threshold value M must then carry out loading in nodes domains
Weighing apparatus, otherwise without load balancing (herein and being known as loading successfully).
Check nodes domains surplus：Variable N is set, per level-one is merged upwards, N--, it is remaining whether final inspection nodes domains have
Method is whether N is equal to 0.
The node that will in same nodes domains be more than threshold value and the in addition load shown in several node progress algorithms 1 no more than threshold value
Equilibrium, algorithm 1 include：
Calculate the mean load value of each nodes domains, collect the load value of each device node, and by the load value of each equipment from
It is small to get up to longer spread.
A complete binary tree is established into load, and is adjusted to a balanced binary tree in real time, left side leaf node conduct
The permanent right side node being less than as sender (send) of reciever (receive), and balanced, equalization methods are carried out to leaf node
For.
(Group) carries out equilibrium in pairs for most left most lobus dexter child node, secondary left lobus dexter child node ... to binary tree；
If certain node is sky, pairing node is directly merged into the equilibrium between father node progress father node, if the result after equilibrium
Entirely reach H<=0, then equilibrium result be：The balanced success of this grade；Otherwise, if the H of several results does not reach after equilibrium<=0,
Then wait for after all leaf node equilibriums finish, between equilibrium result pairing be combined into new node and carry out aforesaid operations again, match
It is constant to principle.
If theX is leafy node number) secondary equilibrium still can not succeed, then no matter success or not, directly
It connects the load balancing result progress between equilibrium result and the father node of leaf node is balanced, calculates L in nodes domains at this timeavg
With M difference H, and judge that H's is positive and negative, corresponding operate in next step.
If H>0, whether decision node domain also has residue, if there is residue, then merges with even higher level of node domain, continues according to above-mentioned
Algorithm carries out balanced；If without residue, illustrate that existing nodes domains can not complete the safe bearing load equilibrium of isomery safety supervision cluster, palpus
It replaces updating apparatus cluster or reduces load total amount.
If H<=0, then illustrate that average load already less than threshold value, also needs to judge whether there is respective nodes at this time in current nodes domains
Load is still higher than threshold value.If still having node higher than threshold value M, nodes domains are interior must to carry out load balancing, otherwise without load
Balanced (herein and being known as loading successfully).
Step is so repeated, until H is equal in first nodes domain<=0 load balancing successfully stop or final step nodes domains in H still
So>0 load balancing unsuccessfully stops.
If the arbitrary H of nodes domains is equal after equilibrium<0, then balanced success；Otherwise H>0 balanced failure, existing equipment can not carry out
The load balancing of effective and safe.
For equilibrium quantity, each equilibrium quantity is τ, and calculation formula is：
Wherein, ρ is node actual loading distinctiveness ratio, and the actual loading distinctiveness ratio between any two leaf node i, j is.
ρ=Li-Lj；
Data block packet rate is lost in the domain of send requests for ∈, receive operating lags rate is θ, and packet loss is higher, operating lag rate
Higher, load distinctiveness ratio is higher, then equalization data amount can accordingly increase the equilibrium that strives for success；V is safety supervision monitoring etc. as coefficient
Grade, V is higher, then equilibrium quantity accordingly improves.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711400903.9A CN108154294A (en) | 2017-12-22 | 2017-12-22 | A kind of method of the safe bearing load equilibrium of isomeric group safety supervision equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711400903.9A CN108154294A (en) | 2017-12-22 | 2017-12-22 | A kind of method of the safe bearing load equilibrium of isomeric group safety supervision equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108154294A true CN108154294A (en) | 2018-06-12 |
Family
ID=62465049
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711400903.9A Pending CN108154294A (en) | 2017-12-22 | 2017-12-22 | A kind of method of the safe bearing load equilibrium of isomeric group safety supervision equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108154294A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109284295A (en) * | 2018-10-17 | 2019-01-29 | 郑州云海信息技术有限公司 | A kind of data-optimized method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102158559A (en) * | 2011-04-18 | 2011-08-17 | 浙江工业大学 | Peer-to-peer (P2P) network-based load balancing method |
| CN103095598A (en) * | 2012-12-17 | 2013-05-08 | 华中科技大学 | Monitoring data aggregate method under large-scale cluster environment |
| CN103412897A (en) * | 2013-07-25 | 2013-11-27 | 中国科学院软件研究所 | Parallel data processing method based on distributed structure |
-
2017
- 2017-12-22 CN CN201711400903.9A patent/CN108154294A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102158559A (en) * | 2011-04-18 | 2011-08-17 | 浙江工业大学 | Peer-to-peer (P2P) network-based load balancing method |
| CN103095598A (en) * | 2012-12-17 | 2013-05-08 | 华中科技大学 | Monitoring data aggregate method under large-scale cluster environment |
| CN103412897A (en) * | 2013-07-25 | 2013-11-27 | 中国科学院软件研究所 | Parallel data processing method based on distributed structure |
Non-Patent Citations (2)
| Title |
|---|
| 彭利民等: "动态结构化P2P网络的负载均衡方案", 《华南理工大学学报(自然科学版 )》 * |
| 郝志军: "面向异步划分地址空间编程模型的集群资源管理与优化技术的研究", 《中国博士学位论文全文数据库 信息科技辑》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109284295A (en) * | 2018-10-17 | 2019-01-29 | 郑州云海信息技术有限公司 | A kind of data-optimized method and device |
| CN109284295B (en) * | 2018-10-17 | 2021-09-17 | 郑州云海信息技术有限公司 | Data optimization method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106201722A (en) | The load regulation method of server and system | |
| CN115907264B (en) | Intelligent gas inspection area generation method, internet of things system, device and medium | |
| CN103428008B (en) | The big data distributing method of facing multiple users group | |
| CN109951537B (en) | Load balancing distribution method facing block chain | |
| Kolesenkov et al. | Anthropogenic situation express monitoring on the base of the fuzzy neural networks | |
| CN107038167A (en) | Big data excavating analysis system and its analysis method based on model evaluation | |
| CN114169010A (en) | Edge privacy protection method based on federal learning | |
| CN105553869A (en) | Method and system for risk balancing for power communication network | |
| CN103595805A (en) | Data placement method based on distributed cluster | |
| CN108154294A (en) | A kind of method of the safe bearing load equilibrium of isomeric group safety supervision equipment | |
| CN116050540B (en) | Self-adaptive federal edge learning method based on joint bi-dimensional user scheduling | |
| CN114301972A (en) | Block chain link point hierarchical deployment method and system based on cloud edge cooperation | |
| CN109951499A (en) | A kind of method for detecting abnormality based on network structure feature | |
| CN109766188A (en) | A kind of load equilibration scheduling method and system | |
| Rose | CONWIP-like lot release for a wafer fabrication facility with dynamic load changes | |
| CN104881436A (en) | Power communication equipment performance analyzing method and device based on big data | |
| CN105868002A (en) | Method for processing retransmission request in distributed calculation and device thereof | |
| CN114500229B (en) | Network alarm positioning and analyzing method based on space-time information | |
| CN110245019A (en) | A kind of the thread concurrent method and device of Adaptable System resource | |
| CN111898917B (en) | Intelligent manufacturing management system based on big data | |
| CN107316056B (en) | Automatic evaluation system and automatic evaluation method for network security level | |
| Barazandeh et al. | Two hierarchical dynamic load balancing algorithms in distributed systems | |
| WO2021072844A1 (en) | Cloud platform host node monitoring method, apparatus, and computer device | |
| US10394208B2 (en) | Server apparatus in energy management system and operating method of thereof | |
| CN111988184B (en) | Broadcast storm detection and processing method based on situation awareness |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180612 |
|
| WD01 | Invention patent application deemed withdrawn after publication |