CN109491604A - A kind of processing method of disk identifier of hard disk replication problem, apparatus and system - Google Patents
A kind of processing method of disk identifier of hard disk replication problem, apparatus and system Download PDFInfo
- Publication number
- CN109491604A CN109491604A CN201811295865.XA CN201811295865A CN109491604A CN 109491604 A CN109491604 A CN 109491604A CN 201811295865 A CN201811295865 A CN 201811295865A CN 109491604 A CN109491604 A CN 109491604A
- Authority
- CN
- China
- Prior art keywords
- drive
- preset number
- backboard
- preset
- hard disk
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
- G06F21/71—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information
- G06F21/73—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information by creating or determining hardware identification, e.g. serial numbers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/062—Securing storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
- G06F21/44—Program or device authentication
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0644—Management of space entities, e.g. partitions, extents, pools
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0674—Disk device
- G06F3/0676—Magnetic disk device
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
Abstract
The invention discloses a kind of processing methods of disk identifier of hard disk replication problem, second drive of the second preset number in cascade chip in the first drive and cascade backboard including obtaining the first preset number in the postposition chip in postposition backboard, wherein, first preset number is the hard disk number of postposition backboard management, and the second preset number is the hard disk number for cascading backboard management；When the first drive and the second drive have the case where repeating, the third drive for being different from the second preset number of the first all drives is generated；Second drive of the second preset number in the cascade chip cascaded in backboard is revised as to the third drive of the second preset number using preset language.Cascading the hard disk of backboard and the management of postposition backboard, there is no duplicate drives, just will not read error data, eliminate the security risk generated by data read errors.The invention also discloses the processing units and system of a kind of disk identifier of hard disk replication problem, have the identical beneficial effect of processing method as above.
Description
Technical field
The present invention relates to field of hard disks, and more particularly to a kind of processing method of disk identifier of hard disk replication problem, the present invention is also
It is related to the processing unit and system of a kind of disk identifier of hard disk replication problem.
Background technique
With the development of big data technology, the requirement for server data storage capacity is higher and higher, and server is usual
Using the hard-disc storage structure of preposition backboard and postposition composition of backboards, need to carry out preposition backboard and postposition backboard at cascade
Reason, preposition backboard at this time are cascade backboard, cascade backboard and postposition backboard is used to manage multiple hard disks, cascade backboard pipe
The hard disk of reason and the hard disk of postposition backboard management have respective drive, and with the presence of duplicate drive in multiple drives,
In this case, the processor in staff and server is when reading the data in some hard disk, just probably due to weight
Multiple drive and there is a situation where data read errors, but in the prior art without a kind of solution of maturation, there are all
More security risks.
Therefore, how to provide a kind of scheme of solution above-mentioned technical problem is that those skilled in the art need to solve at present
Problem.
Summary of the invention
The object of the present invention is to provide a kind of processing methods of disk identifier of hard disk replication problem, reduce data read errors
Probability eliminates security risk；It is a further object of the present invention to provide a kind of processing unit of disk identifier of hard disk replication problem and it is
System, reduces the probability of data read errors, eliminates security risk.
In order to solve the above technical problems, the present invention provides a kind of processing methods of disk identifier of hard disk replication problem, comprising:
Obtain the grade in the first drive and cascade backboard of the first preset number in the postposition chip in postposition backboard
Joining the second drive of the second preset number in chip, wherein first preset number is the hard disk number of postposition backboard management,
Second preset number is the hard disk number for cascading backboard management；
When first drive and second drive have the case where repeating, generates and be different from all described first
The third drive of second preset number of drive；
The second drive for cascading second preset number in the cascade chip in backboard is modified using preset language
For the third drive of second preset number.
Preferably, first drive, second drive and the third drive are number.
Preferably, the first all drive are as follows:
First preset number incremental one by one of starting from scratch is digital；
The then third drive of second preset number different from all first drives specifically:
Incremental second preset number number one by one, wherein the smallest third drive is more described than maximum
First drive is big by 1.
Preferably, described to cascade the of second preset number in the cascade chip in backboard using preset language
Two drives are revised as second preset number being incremented by one by one number specifically:
It will be cascaded second described in the port in the cascade chip in backboard and logic interface mapping table using presetting method
Preset number logic interface is revised as second preset number being incremented by one by one number；
Wherein, the second preset number number is equal with the number of the second preset number port in the mapping table
It is corresponded according to incremental sequence, the logic interface is the drive.
Preferably, the preset language is expandable mark language XML.
In order to solve the above technical problems, the present invention also provides a kind of processing units of disk identifier of hard disk replication problem, comprising:
Module is obtained, the first drive and cascade back of the first preset number in the postposition chip in postposition backboard are obtained
Second drive of the second preset number in the cascade chip in plate, wherein first preset number is the management of postposition backboard
Hard disk number, second preset number be cascade backboard management hard disk number；
Generation module generates when first drive has the case where repeating with second drive and is different from owning
First drive second preset number third drive；
Modified module will cascade second of second preset number in the cascade chip in backboard using preset language
Drive is revised as the third drive of second preset number.
Preferably, first drive, second drive and the third drive are number.
Preferably, the first all drive are as follows:
First preset number incremental one by one of starting from scratch is digital；
The then third drive of second preset number different from all first drives specifically:
Incremental second preset number number one by one, wherein the smallest third drive is more described than maximum
First drive is big by 1.
Preferably, the modified module is specifically used for:
It will be cascaded second described in the port in the cascade chip in backboard and logic interface mapping table using presetting method
Preset number logic interface is revised as second preset number being incremented by one by one number；
Wherein, the second preset number number is equal with the number of the second preset number port in the mapping table
It is corresponded according to incremental sequence, the logic interface is the drive.
In order to solve the above technical problems, the present invention also provides a kind of processing systems of disk identifier of hard disk replication problem, comprising:
Memory, for storing computer program；
Processor realizes the place of the as above any one disk identifier of hard disk replication problem when for executing the computer program
The step of reason method.
The present invention provides a kind of processing methods of disk identifier of hard disk replication problem, including obtaining the postposition core in postposition backboard
Second disk of the first drive of the first preset number in piece and the second preset number in the cascade chip in cascade backboard
Symbol, wherein the first preset number is the hard disk number of postposition backboard management, and the second preset number is the hard disk for cascading backboard management
Number；When the first drive and the second drive have the case where repeating, the second present count for being different from the first all drives is generated
Purpose third drive；The second drive for cascading the second preset number in the cascade chip in backboard is modified using preset language
For the third drive of the second preset number.
As it can be seen that in the present invention, the first disk of the first preset number in postposition backboard available first in postposition chip
Second drive of the second preset number in cascade chip in symbol and cascade backboard, when the first drive and the second drive exist
When the case where repeating, the third drive of the second preset number different from the first all drives then can be generated out, finally
Second drive of the second preset number in cascade chip is revised as i.e. by the third drive of the second preset number using preset language
Can, in such cases, just there is no duplicate disk identifier of hard disk, work in all hard disks of cascade backboard and the management of postposition backboard
Processor in personnel and server just will not be again because the data of duplicate disk identifier of hard disk and read error, eliminate by counting
A series of security risks generated according to read error.
The present invention also provides the processing units and system of a kind of disk identifier of hard disk replication problem, have processing method phase as above
Same beneficial effect.
Detailed description of the invention
It to describe the technical solutions in the embodiments of the present invention more clearly, below will be to institute in the prior art and embodiment
Attached drawing to be used is needed to be briefly described, it should be apparent that, the accompanying drawings in the following description is only some implementations of the invention
Example, for those of ordinary skill in the art, without creative efforts, can also obtain according to these attached drawings
Obtain other attached drawings.
Fig. 1 is a kind of flow diagram of the processing method of disk identifier of hard disk replication problem provided by the invention；
Fig. 2 is a kind of structural schematic diagram of the processing unit of disk identifier of hard disk replication problem provided by the invention；
Fig. 3 is a kind of structural schematic diagram of the processing system of disk identifier of hard disk replication problem provided by the invention.
Specific embodiment
Core of the invention is to provide a kind of processing method of disk identifier of hard disk replication problem, reduces data read errors
Probability eliminates security risk；Another core of the invention is to provide a kind of processing unit of disk identifier of hard disk replication problem and is
System, reduces the probability of data read errors, eliminates security risk.
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without making creative work, shall fall within the protection scope of the present invention.
Referring to FIG. 1, Fig. 1 is a kind of process signal of processing method of disk identifier of hard disk replication problem provided by the invention
Figure, comprising:
Step S1: the first drive and cascade backboard of the first preset number in the postposition chip in postposition backboard are obtained
In cascade chip in the second preset number the second drive, wherein the first preset number be the management of postposition backboard hard disk
Number, the second preset number are the hard disk number for cascading backboard management；
Specifically, having respective managing chip in postposition backboard and cascade backboard, wherein the management in postposition backboard
Chip is postposition chip, and cascading the managing chip in backboard is cascade chip, and it is respectively right to can be used for connecting and managing respectively
The multiple hard disks answered, an important management role possessed by the two is the drive for managing each hard disk, for example, for cascade
For chip, the second preset number hard disk of cascade chip management is connected to cascade core by the port on cascade chip
On piece, each hard disk are correspondingly connected with a port, and for each port, in cascade chip factory, inside
Drive corresponding with each port is set；Similarly, same for the postposition chip in postposition backboard, because
This, when two chips dispatch from the factory inside initial drive there are when identical drive, if postposition backboard and cascade backboard grade are associated in one
It rises and carries out using the problem of will generating the case where drive repeats, and then lead to data read errors.
Specifically, the maximum value for the hard disk quantity that the first preset number can manage for postposition chip, second is default
The maximum value for the hard disk quantity that number can manage for postposition chip can obtain all drives in such cases,
And repeat the modification of drive, in this case, no matter postposition chip and cascade chip be actually connected to how many it is hard
Disk, will not there is a situation where drives to repeat.
Certainly, the first preset number can also be the practical hard disk number connected of postposition backboard, and the second preset number can be with
To cascade the practical hard disk number connected of backboard, the first drive obtained at this time can be to be connected with the physics of hard disk for postposition backboard
The first drive corresponding to mouthful, and the second drive can be to be connected with the second disk corresponding to the port of hard disk for cascade backboard
Symbol, the embodiment of the present invention is it is not limited here.
Step S2: it when the first drive and the second drive have the case where repeating, generates and is different from the first all drives
The second preset number third drive；
Specifically, the second drive of the first drive of the first preset number and the second preset number can be carried out pair first
Than when the case where the first drive and the presence repetition of the second drive, i.e., any first drive has weight in the second all drives
Multiple situation exists, then generates the third drive for being different from the second preset number of the first all drives.
Specifically, when generating third drive, can there are many types, such as can be only by the second of the second preset number
In drive, the second drive for being different from the first all drives, such as first are replaced with duplicate second drive of the first drive
Drive is 0 and 1, and the second drive is 0,1,2,3 and 4, can only be fallen 0 and 1 modification in the second drive at this time, and is repaired
Drive after changing cannot include 0 and 1.
It is of course also possible to other kinds of third drive is generated, such as third drive is different from all the second drives etc.,
The embodiment of the present invention is it is not limited here.
Step S3: the second drive of the second preset number in the cascade chip cascaded in backboard is repaired using preset language
It is changed to the third drive of the second preset number.
Specifically, the second drive of the second preset number in the cascade chip cascaded in backboard is revised as generate the
The third drive of two preset numbers, can be realized the modification of repetition drive, solve the problems, such as repetition drive, and that modifies at this time can
Think the FW (Firmware, firmware) inside cascade chip, in such cases, the first drive of the hard disk that postposition backboard is managed
And the third drive of hard disk that is managed of cascade backboard does not just have duplicate drive and exists, processor in server and
Staff just will not avoid again there is a situation where read error because data are read when reading some hard disc data
A series of safety problems for taking mistake and generating.
Wherein, in modification, if the second drive of the second preset number that step S1 is obtained is cascade, backboard is connected with firmly
Drive corresponding to the port of disk, when modification, the port corresponding that can will cascade backboard and be connected with hard disk
Two drives are modified.
It wherein, in embodiments of the present invention, can be when cascading backboard and postposition backboard is not cascaded in cascade chip
The FW in portion modifies, and can also modify again to the FW inside cascade chip after cascade is good, the embodiment of the present invention exists
This is without limitation.
In addition, cascade backboard can also be called scalability expander backboard.
The present invention provides a kind of processing methods of disk identifier of hard disk replication problem, including obtaining the postposition core in postposition backboard
Second disk of the first drive of the first preset number in piece and the second preset number in the cascade chip in cascade backboard
Symbol, wherein the first preset number is the hard disk number of postposition backboard management, and the second preset number is the hard disk for cascading backboard management
Number；When the first drive and the second drive have the case where repeating, the second present count for being different from the first all drives is generated
Purpose third drive；The second drive for cascading the second preset number in the cascade chip in backboard is modified using preset language
For the third drive of the second preset number.
As it can be seen that in the present invention, the first disk of the first preset number in postposition backboard available first in postposition chip
Second drive of the second preset number in cascade chip in symbol and cascade backboard, when the first drive and the second drive exist
When the case where repeating, the third drive of the second preset number different from the first all drives then can be designed that, finally
Second drive of the second preset number in cascade chip is revised as i.e. by the third drive of the second preset number using preset language
Can, in such cases, just there is no duplicate disk identifier of hard disk, work in all hard disks of cascade backboard and the management of postposition backboard
Processor in personnel and server just will not be again because the data of duplicate disk identifier of hard disk and read error, eliminate by counting
A series of security risks generated according to read error.
On the basis of the above embodiments:
Embodiment as one preferred, the first drive, the second drive and third drive are number.
Specifically, in the embodiment of the present invention, it is excellent that the drive of digital form has data volume small and facilitates management through figures etc.
Point.
Certainly, other than number, the first drive, the second drive and third drive can also be other kinds of character,
Such as letter etc., the embodiment of the present invention is it is not limited here.
Embodiment as one preferred, the first all drives are as follows:
The first incremental one by one preset number of starting from scratch is digital；
Specifically, preset first drive in internal postposition chip is usually number in the factory of postposition backboard,
And in the form of being incremented by one by one, such as 0,1,2 ... .. etc., facilitate management.
Certainly, other than the first preset number number incremental one by one of starting from scratch, the first drive can also be other
Form, such as the number successively decreased one by one or the number of random ordering etc., the embodiment of the present invention is it is not limited here.
Then different from the third drive of the second preset number of the first all drives specifically:
The second incremental preset number number one by one, wherein the smallest third drive is bigger by 1 than maximum first drive.
Specifically, what the third drive that will differ from the second preset number of the first all drives was set as being incremented by one by one
Second preset number number, and the smallest third drive is bigger by 1 than maximum first drive, facilitates management postposition in this case
All hard disks that backboard and cascade backboard are connected, such as the first drive is 0 and 1, and third drive is 2-12, such feelings
Under condition, the drive of all hard disks that postposition backboard and cascade backboard are managed in cascade is just 0 to 12 totally 13 disks
Symbol, namely 13 hard disks are represented, further facilitate the management of hard disk.
Certainly, third drive may be arranged as other forms, and the embodiment of the present invention is it is not limited here.
Embodiment as one preferred will cascade the second present count in the cascade chip in backboard using preset language
The second drive of purpose is revised as the second preset number being incremented by one by one number specifically:
The port in the cascade chip cascaded in backboard is preset in logic interface mapping table second using presetting method
Number logic interface is revised as the second preset number being incremented by one by one number；
Wherein, the second preset number number is with the number of the second preset number port in mapping table according to incremental
Sequence correspond, logic interface is drive.
In order to preferably be illustrated to the embodiment of the present invention, the following table 1 is please referred to, table 1 is a kind of grade provided by the invention
Join the mapping table of the port and logic interface when chip factory.
Table 1
Specifically, when leaving the factory, the FW inside cascade chip defines port (phy) and logic interface on cascade chip
The corresponding relationship of Logic, wherein logic interface is just drive, and the second preset drive of modification cascade chip is to modify mapping table
In logic interface, in table 1, if the first drive in postposition chip is 0 and 1 at this time, then incremental one by one second generated
Preset number number is just 2 to 15, only the numerical value in the logic interface Logic in table 1 need to be revised as 2 to 15.
Wherein it is possible to which the second preset number number and the number of the second preset number port in mapping table are pressed
It is corresponded according to incremental sequence, concrete form can be table 2, and table 2 is that a kind of cascade chip provided by the invention is modified
The mapping table of port and logic interface.
Table 2
Specifically, corresponding to the cascade chip in table 2, when hard disk is connected to No. 0 port, the disk that is showed
Symbol can with for 2, when hard disk is connected to No. 1 port, the drive that is showed can with for 3, and so on, more just
Just for the management of hard disk.
Certainly, other than the modification mode in the embodiment of the present invention, the modification of other modes can also be carried out to mapping table,
The embodiment of the present invention is it is not limited here.
Embodiment as one preferred, preset language be XML (Extensible Markup Language, it is expansible
Markup language).
Specifically, XML has friendly strong and advantages of simple structure and simple.
Certainly, it other than XML, can also be modified using other kinds of language to the second drive, the present invention is implemented
Example is it is not limited here.
Referring to FIG. 2, Fig. 2 is a kind of structural representation of the processing unit of disk identifier of hard disk replication problem provided by the invention
Figure, comprising:
Module 1 is obtained, the first drive and the cascade of the first preset number in the postposition chip in postposition backboard are obtained
Second drive of the second preset number in the cascade chip in backboard, wherein the first preset number is the management of postposition backboard
Hard disk number, the second preset number are the hard disk number for cascading backboard management；
Generation module 2 generates when the case where the first drive and the presence repetition of the second drive and is different from the first all disks
The third drive of second preset number of symbol；
Modified module 3 will cascade the second disk of the second preset number in the cascade chip in backboard using preset language
Symbol is revised as the third drive of the second preset number.
Embodiment as one preferred, the first drive, the second drive and third drive are number.
Embodiment as one preferred, the first all drives are as follows:
The first incremental one by one preset number of starting from scratch is digital；
Then different from the third drive of the second preset number of the first all drives specifically:
The second incremental preset number number one by one, wherein the smallest third drive is bigger by 1 than maximum first drive.
Embodiment as one preferred, modified module 3 are specifically used for:
The port in the cascade chip cascaded in backboard is preset in logic interface mapping table second using presetting method
Number logic interface is revised as the second preset number being incremented by one by one number；
Wherein, the second preset number number is with the number of the second preset number port in mapping table according to incremental
Sequence correspond, logic interface is drive.
Aforementioned processing is please referred to for the introduction of the processing unit of disk identifier of hard disk replication problem provided in an embodiment of the present invention
The embodiment of method, details are not described herein for the embodiment of the present invention.
Referring to FIG. 3, Fig. 3 is a kind of structural representation of the processing system of disk identifier of hard disk replication problem provided by the invention
Figure, comprising:
Memory 4, for storing computer program；
Processor 5 realizes the processing such as disk identifier of hard disk replication problem in previous embodiment when for executing computer program
The step of method.
Aforementioned processing is please referred to for the introduction of the processing system of disk identifier of hard disk replication problem provided in an embodiment of the present invention
The embodiment of method, details are not described herein for the embodiment of the present invention.
Each embodiment in this specification is described in a progressive manner, the highlights of each of the examples are with other
The difference of embodiment, the same or similar parts in each embodiment may refer to each other.For device disclosed in embodiment
For, since it is corresponded to the methods disclosed in the examples, so being described relatively simple, related place is said referring to method part
It is bright.
It should also be noted that, in the present specification, relational terms such as first and second and the like be used merely to by
One entity or operation are distinguished with another entity or operation, without necessarily requiring or implying these entities or operation
Between there are any actual relationship or orders.Moreover, the terms "include", "comprise" or its any other variant meaning
Covering non-exclusive inclusion, so that the process, method, article or equipment for including a series of elements not only includes that
A little elements, but also including other elements that are not explicitly listed, or further include for this process, method, article or
The intrinsic element of equipment.In the absence of more restrictions, the element limited by sentence "including a ...", is not arranged
Except there is also other identical elements in the process, method, article or equipment for including the element.
The foregoing description of the disclosed embodiments enables those skilled in the art to implement or use the present invention.
Various modifications to these embodiments will be readily apparent to those skilled in the art, as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, of the invention
It is not intended to be limited to the embodiments shown herein, and is to fit to and the principles and novel features disclosed herein phase one
The widest scope of cause.
Claims (10)
1. a kind of processing method of disk identifier of hard disk replication problem characterized by comprising
Obtain the cascade core in the first drive and cascade backboard of the first preset number in the postposition chip in postposition backboard
Second drive of the second preset number in piece, wherein first preset number is the hard disk number of postposition backboard management, described
Second preset number is the hard disk number for cascading backboard management；
When first drive and second drive have the case where repeating, generates and be different from all first drives
Second preset number third drive；
Second drive of second preset number in the cascade chip cascaded in backboard is revised as by institute using preset language
State the third drive of the second preset number.
2. processing method according to claim 1, which is characterized in that first drive, second drive and institute
Stating third drive is number.
3. processing method according to claim 2, which is characterized in that the first all drive are as follows:
First preset number incremental one by one of starting from scratch is digital；
The then third drive of second preset number different from all first drives specifically:
Incremental second preset number number one by one, wherein the smallest third drive is than maximum described first
Drive is big by 1.
4. processing method according to claim 3, which is characterized in that described to cascade the grade in backboard using preset language
Second drive of second preset number in connection chip is revised as second preset number being incremented by one by one number tool
Body are as follows:
The port in the cascade chip cascaded in backboard is preset with described in logic interface mapping table second using presetting method
Number logic interface is revised as second preset number being incremented by one by one number；
Wherein, the number of second preset number number and the second preset number port in the mapping table according to
Incremental sequence corresponds, and the logic interface is the drive.
5. processing method according to any one of claims 1 to 4, which is characterized in that the preset language is expansible mark
Remember Language XML.
6. a kind of processing unit of disk identifier of hard disk replication problem characterized by comprising
Module is obtained, is obtained in the first drive and cascade backboard of the first preset number in the postposition chip in postposition backboard
Cascade chip in the second preset number the second drive, wherein first preset number be the management of postposition backboard it is hard
Disk number, second preset number are the hard disk number for cascading backboard management；
Generation module generates when first drive has the case where repeating with second drive and is different from all institutes
State the third drive of second preset number of the first drive；
Modified module will cascade the second drive of second preset number in the cascade chip in backboard using preset language
It is revised as the third drive of second preset number.
7. processing unit according to claim 6, which is characterized in that first drive, second drive and institute
Stating third drive is number.
8. processing unit according to claim 7, which is characterized in that the first all drive are as follows:
First preset number incremental one by one of starting from scratch is digital；
The then third drive of second preset number different from all first drives specifically:
Incremental second preset number number one by one, wherein the smallest third drive is than maximum described first
Drive is big by 1.
9. processing unit according to claim 8, which is characterized in that the modified module is specifically used for:
The port in the cascade chip cascaded in backboard is preset with described in logic interface mapping table second using presetting method
Number logic interface is revised as second preset number being incremented by one by one number；
Wherein, the number of second preset number number and the second preset number port in the mapping table according to
Incremental sequence corresponds, and the logic interface is the drive.
10. a kind of processing system of disk identifier of hard disk replication problem characterized by comprising
Memory, for storing computer program；
Processor realizes that the disk identifier of hard disk as described in any one of claim 1 to 5 repeats to ask when for executing the computer program
The step of processing method of topic.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811295865.XA CN109491604B (en) | 2018-11-01 | 2018-11-01 | Method, device and system for processing hard disk drive letter repetition problem |
| PCT/CN2019/093357 WO2020087955A1 (en) | 2018-11-01 | 2019-06-27 | Method, apparatus and system for processing hard disk identifier duplication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811295865.XA CN109491604B (en) | 2018-11-01 | 2018-11-01 | Method, device and system for processing hard disk drive letter repetition problem |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109491604A true CN109491604A (en) | 2019-03-19 |
| CN109491604B CN109491604B (en) | 2021-07-02 |
Family
ID=65692258
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811295865.XA Active CN109491604B (en) | 2018-11-01 | 2018-11-01 | Method, device and system for processing hard disk drive letter repetition problem |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109491604B (en) |
| WO (1) | WO2020087955A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020087955A1 (en) * | 2018-11-01 | 2020-05-07 | 郑州云海信息技术有限公司 | Method, apparatus and system for processing hard disk identifier duplication |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000322327A (en) * | 1999-05-10 | 2000-11-24 | Mitsubishi Electric Corp | File restoring device and information storing medium |
| CN104281498A (en) * | 2014-09-18 | 2015-01-14 | 飞天诚信科技股份有限公司 | Method for automatically restoring logical drive in windows system |
| CN104699423A (en) * | 2015-03-13 | 2015-06-10 | 华为技术有限公司 | Method and device for binding disk drive in Linux system |
| CN106681799A (en) * | 2017-01-03 | 2017-05-17 | 北京百度网讯科技有限公司 | Disk inserting method, device and system |
| CN107239273A (en) * | 2017-05-02 | 2017-10-10 | 杭州沃趣科技股份有限公司 | A kind of disk drive binding method of server |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102789371A (en) * | 2012-07-27 | 2012-11-21 | 曙光信息产业(北京)有限公司 | Method for distributing disk identifier of hard disk |
| CN106469103B (en) * | 2015-08-14 | 2019-10-18 | 华为软件技术有限公司 | The maintaining method and device of hard disk |
| CN105205009B (en) * | 2015-09-30 | 2018-05-11 | 华为技术有限公司 | A kind of address mapping method and device based on large capacity solid-state storage |
| CN107239231B (en) * | 2017-05-03 | 2020-12-04 | 深圳市同泰怡信息技术有限公司 | Method for fixing mapping relation between disk slot position number and disk identifier |
| CN109491604B (en) * | 2018-11-01 | 2021-07-02 | 郑州云海信息技术有限公司 | Method, device and system for processing hard disk drive letter repetition problem |
-
2018
- 2018-11-01 CN CN201811295865.XA patent/CN109491604B/en active Active
-
2019
- 2019-06-27 WO PCT/CN2019/093357 patent/WO2020087955A1/en active Application Filing
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000322327A (en) * | 1999-05-10 | 2000-11-24 | Mitsubishi Electric Corp | File restoring device and information storing medium |
| CN104281498A (en) * | 2014-09-18 | 2015-01-14 | 飞天诚信科技股份有限公司 | Method for automatically restoring logical drive in windows system |
| CN104699423A (en) * | 2015-03-13 | 2015-06-10 | 华为技术有限公司 | Method and device for binding disk drive in Linux system |
| CN106681799A (en) * | 2017-01-03 | 2017-05-17 | 北京百度网讯科技有限公司 | Disk inserting method, device and system |
| US20180188990A1 (en) * | 2017-01-03 | 2018-07-05 | Beijing Baidu Netcom Science And Technology Co., Ltd. | Method, apparatus and system for inserting disk |
| CN107239273A (en) * | 2017-05-02 | 2017-10-10 | 杭州沃趣科技股份有限公司 | A kind of disk drive binding method of server |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020087955A1 (en) * | 2018-11-01 | 2020-05-07 | 郑州云海信息技术有限公司 | Method, apparatus and system for processing hard disk identifier duplication |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109491604B (en) | 2021-07-02 |
| WO2020087955A1 (en) | 2020-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8380759B2 (en) | Type projection query of an instance space | |
| US7707369B2 (en) | System for creating and tracking unique identifications of electronic components | |
| CN106033437A (en) | Method and system for processing distributed transaction | |
| US7958299B2 (en) | Hard disk system state monitoring method | |
| CN102567451B (en) | Generating data models | |
| US20090164525A1 (en) | Online Recovery of User Tables Using Flashback Table | |
| US9069818B2 (en) | Textual search for numerical properties | |
| US8914352B2 (en) | Non-equijoin metadata | |
| CN107463692A (en) | Super large text data is synchronized to the method and system of search engine | |
| CN104503701A (en) | Magnetic disk naming method and device suitable for multi-stage expansion cabinet | |
| US8990165B2 (en) | Methods, apparatus and articles of manufacture to archive data | |
| CN109491604A (en) | A kind of processing method of disk identifier of hard disk replication problem, apparatus and system | |
| US11175993B2 (en) | Managing data storage system | |
| CN111581183A (en) | Data migration method and device based on data model | |
| JP2018514886A (en) | Aggregate large amounts of time data from many overlapping sources | |
| US9354953B2 (en) | System integrator and system integration method with reliability optimized integrated circuit chip selection | |
| CN109344169A (en) | Data processing method and device | |
| CN109240869A (en) | A kind of method and apparatus of determining target hard disk backboard | |
| CN104699811A (en) | Method and device for recording and backtracking variation of form data in non-invasion manner | |
| CN111177141A (en) | Method, equipment and system for recovering data by utilizing MySQL (MySQL structured query language) parallel copying | |
| CN105593846A (en) | No rollback threshold for audit trail | |
| CN107643960A (en) | Solr full-text retrieval dynamic configuration system and method | |
| TW200424849A (en) | Method and system for optimized first-in-first-out full condition control | |
| CN109241027B (en) | Data migration method, device, electronic equipment and computer readable storage medium | |
| TWI717909B (en) | Data verification method |
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 |