CN-115994657-B - Unit division optimization method and system adopting universal detection tool for detection

CN115994657BCN 115994657 BCN115994657 BCN 115994657BCN-115994657-B

Abstract

The invention discloses a unit division optimizing method and system adopting a universal detection tool for detection, and belongs to the field of electronic equipment fault investigation. The invention constructs a candidate division set by traversing group leader units and preferentially selecting group member units, wherein the group leader units are units with longest unit inspection time consumption, when the group leader units are preferentially selected, a plurality of units with highest fault probability, which are not more than the group leader unit state inspection time consumption, are selected from all current non-inspected units, are used as the group member units, a feasible unit division for the jth detection is jointly formed with the feasible group leader units, the division with the smallest overall equivalent detection time is selected from all candidate feasible unit division modes as the current division, the optimal division of all units is finally realized, the division optimization method realizes the globally optimal neighborhood solution, and the average inspection time is greatly reduced.

Inventors

ZHANG NING
SUN QIANG
LI JIAKUAN
Rao zhe
CHEN WENXU
LI HUA

Assignees

中国人民解放军海军工程大学

Dates

Publication Date: 20260505
Application Date: 20221212

Claims (4)

1. The unit division optimizing method adopting the universal detection tool for detection is characterized by comprising the following steps: S1, acquiring capacity m of a general detection tool, the number of electronic class units forming electronic equipment, the state detection time of each electronic class unit and the probability of failure of each electronic class unit in task time; S2, the ratio of the number of the electronic class units to the capacity is rounded upwards, the maximum detection times nm is used, the detection sequence j=1 is initialized, and an undetected unit set is initialized to form all electronic class units of the electronic equipment; S3, finding out all feasible group leader units from the current undetected unit set, wherein the group leader units are units with the longest unit inspection time consumption, selecting m-1 units with the highest fault probability and not more than the group leader unit state inspection time consumption for each feasible group leader unit, and forming a feasible unit division for the jth detection together with the feasible group leader units, wherein all the feasible unit divisions form a feasible unit division candidate set for the jth detection together; S4, selecting a division mode with minimum overall equivalent detection time from a feasible unit division candidate set detected at the j-th time as a unit division result detected at the j-th time, and updating an undetected unit set into a difference set between a current undetected unit set and the unit division result detected at the j-th time; S5, updating j=j+1, if j is less than nm, entering S3, otherwise, taking the current undetected unit set as a unit division result of the last 1 times of detection; S6, calculating average fault detection time detected by adopting general detection tool : Wherein, the For the j-th check of the sum of the failure probabilities of all the cells, For the accumulated check time of the first j detections, The probability of failure of the unit r is given, and n is the number of electronic class units constituting the electronic equipment; Wherein, step S3 includes: s31, initializing the grouping number , The number of currently undetected Unit set elements na=n- (j-1) m; S32, initializing the group leader unit number The number of the unit of the candidate member, which is the rest elements except z, in the undetected unit set A is marked as At; s33, finding out that the check time of all units is not more than At Is arranged in an array In the case of an array If the length is not less than m-1, entering S34, otherwise, directly entering S36; S34, pairing groups After descending order, the unit numbers corresponding to the first m-1 elements with the largest value are arranged in an array Wherein, among them, The panelist units are numbered and, Numbering all units in an array The unit fault probability corresponding to the unit in (a); S35, updating Handle Placed in matrix zall The row and calculating the whole equivalent detection time; S36, updating If (if) S32 is entered, otherwise S4 is entered; The overall equivalent detection time The calculation formula of (2) is as follows: Wherein, the For the inspection time of the group leader unit, For the probability of failure of the group leader unit, And dividing the result into the accumulated result of the fault probabilities of all units except the group length unit in the result for the feasible unit.
2. The method of claim 1, wherein the cumulative check time of the previous j checks The calculation formula of (2) is as follows: Wherein, the The maximum value of the inspection time in all the units is inspected for the r-th time.
3. The method of claim 1, further comprising calculating a troubleshooting probability distribution for detection using a generic detection tool: Wherein, the Is the probability of finding the faulty piece the first j times.
4. A unit partition optimisation system utilising a universal detection tool comprising a processor and a memory, the memory for storing computer executable instructions, the processor for executing the computer executable instructions such that the method of any one of claims 1 to 3 is performed.

Description

Unit division optimization method and system adopting universal detection tool for detection Technical Field The invention belongs to the field of electronic equipment fault detection, and particularly relates to a unit division optimizing method and system for detecting by using a universal detection tool. Background The interfaces of electronic devices are easy to standardize, and detection tools capable of detecting the same general type but different specific specification and models exist, and are called universal detection tools. For example, a device has a plurality of hard disks, and each hard disk is loaded with a respective program and data file, when a part of a hard disk is damaged, an occasional fault is caused, and the model of each hard disk is not identical, but is a standard interface, so that a universal detection tool can be adopted at the moment, and meanwhile, a disk damage check or a random data reading test can be performed on a plurality of hard disks. As equipment/systems become more powerful and more advanced in performance, the equipment/systems become more complex. When a certain fault phenomenon occurs in the complex equipment/system, the possible reasons behind the fault phenomenon are numerous, and the workload of searching the fault unit is huge. The inspection tool is an important maintenance resource and the number of units that can be inspected at most at one time by the universal inspection tool is called the capacity of the inspection tool. Generally, the larger the capacity of the inspection tool, the more quickly the failure-causing unit can be inspected, but at the same time the more costly the inspection tool is to be used, such as for cost, space occupation, and the like. The decision process of selecting together check elements for use with a common detection tool when formulating an investigation scheme is referred to as element partitioning. When formulating a troubleshooting solution, the basic problem faced is how to select a plurality of units to be tested preferentially every time a detection tool is used, how quickly to find a faulty unit. Especially for complex equipment or systems, the number of units to be examined is few tens or more than hundred. The unit division can be regarded as an arrangement and combination problem of the units to be checked, for example, when the number of the units is 16 and the capacity of the detection tool is 4, the division number exceeds 6300 ten thousand, and the traversing mode can not be adopted to effectively optimize the checking scheme. At present, units are divided mainly by virtue of self experience of first-line maintenance personnel, the divided quality is uneven, and a more accurate time equivalent result for completing fault detection is difficult to give, so that a scientific fault detection scheme is not facilitated to be formulated. Disclosure of Invention Aiming at the defects of the prior art, the invention aims to provide a unit division optimizing method and system detected by a universal detection tool, and aims to solve the problems that the existing unit division method depends on experience and the division quality is uneven. To achieve the above object, in a first aspect, the present invention provides a unit division optimizing method using a general detection tool, the method comprising: S1, acquiring capacity m of a general detection tool, the number of electronic class units forming electronic equipment, the state detection time of each electronic class unit and the probability of failure of each electronic class unit in task time; S2, the ratio of the number of the electronic class units to the capacity is rounded upwards, the maximum detection times nm is used, the detection sequence j=1 is initialized, and an undetected unit set is initialized to form all electronic class units of the electronic equipment; S3, finding out all feasible group leader units from the current undetected unit set, wherein the group leader units are units with the longest unit inspection time consumption, selecting m-1 units with the highest fault probability and not more than the group leader unit state inspection time consumption for each feasible group leader unit, and forming a feasible unit division for the jth detection together with the feasible group leader units, wherein all the feasible unit divisions form a feasible unit division candidate set for the jth detection together; S4, selecting a division mode with minimum overall equivalent detection time from a feasible unit division candidate set detected at the j-th time as a unit division result detected at the j-th time, and updating an undetected unit set into a difference set between a current undetected unit set and the unit division result detected at the j-th time; S5, updating j=j+1, if j is less than nm, entering S3, otherwise, taking the current undetected unit set as a unit division result of the last 1 times of detection. Preferably, step S3 inclu