WO2020087955A1 - 一种硬盘盘符重复问题的处理方法、装置及系统 - Google Patents

一种硬盘盘符重复问题的处理方法、装置及系统 Download PDF

Info

Publication number
WO2020087955A1
WO2020087955A1 PCT/CN2019/093357 CN2019093357W WO2020087955A1 WO 2020087955 A1 WO2020087955 A1 WO 2020087955A1 CN 2019093357 W CN2019093357 W CN 2019093357W WO 2020087955 A1 WO2020087955 A1 WO 2020087955A1
Authority
WO
WIPO (PCT)
Prior art keywords
preset number
drive
backplane
letters
preset
Prior art date
Application number
PCT/CN2019/093357
Other languages
English (en)
French (fr)
Inventor
赵大帅
Original Assignee
郑州云海信息技术有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 郑州云海信息技术有限公司 filed Critical 郑州云海信息技术有限公司
Publication of WO2020087955A1 publication Critical patent/WO2020087955A1/zh

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/70Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
    • G06F21/71Protecting 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/73Protecting 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
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/062Securing storage systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/30Authentication, i.e. establishing the identity or authorisation of security principals
    • G06F21/44Program or device authentication
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • G06F3/0644Management of space entities, e.g. partitions, extents, pools
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0673Single storage device
    • G06F3/0674Disk device
    • G06F3/0676Magnetic disk device
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0673Single storage device

Definitions

  • the present invention relates to the field of hard disks, and in particular to a method for processing the problem of repetition of hard disk drive letters.
  • the invention also relates to a device and system for processing the problem of repetition of hard drive letters.
  • Servers usually use a hard disk storage structure that combines a front backplane and a rear backplane.
  • Cascade processing the front backplane at this time is the cascade backplane, the cascade backplane and the rear backplane are used to manage multiple hard drives, the hard drives managed by the cascade backplane and the hard drives managed by the rear backplane are both
  • There are different drive letters and there are duplicate drive letters in multiple drive letters.
  • the staff and the processor in the server read the data in a certain hard disk, they may be because of the duplicate drive.
  • there is a data reading error but there is no mature solution in the prior art, and there are many security risks.
  • the present invention provides a method for processing hard disk drive letter duplication, which includes:
  • the first A preset number is the number of hard drives managed by the rear backplane
  • the second preset number is the number of hard drives managed by the cascaded backplane
  • the first drive letter, the second drive letter and the third drive letter are all numbers.
  • all the first drive letters are:
  • the first preset number of digits increasing one by one from zero;
  • the second predetermined number of third drive letters different from all the first drive letters are specifically:
  • the second preset number of digits is incremented one by one, wherein the smallest third drive letter is one greater than the largest first drive letter.
  • the modification of the second preset number of second drive letters in the cascaded chip in the cascaded backplane to the second preset number of numbers incremented one by one in a preset language is specifically:
  • the second preset number of numbers corresponds to the number of the second preset number of physical ports in the mapping table in an ascending order, and the logical port is the drive letter.
  • the preset language is Extensible Markup Language XML.
  • the present invention also provides a processing device for repetition of hard disk drive letters, including:
  • An obtaining module obtaining a first preset number of first drive letters in the rear chip in the rear backplane and a second preset number of second drive letters in the cascade chip in the cascade backplane, wherein, The first preset number is the number of hard disks managed by the rear backplane, and the second preset number is the number of hard disks managed by the cascaded backplane;
  • a generating module when the first drive letter and the second drive letter overlap, generating a second preset number of third drive letters different from all the first drive letters;
  • the modification module uses a preset language to modify the second preset number of second drive letters in the cascade chip in the cascade backplane to the second preset number of third drive letters.
  • the first drive letter, the second drive letter and the third drive letter are all numbers.
  • all the first drive letters are:
  • the first preset number of digits increasing one by one from zero;
  • the second predetermined number of third drive letters different from all the first drive letters are specifically:
  • the second preset number of digits is incremented one by one, wherein the smallest third drive letter is one greater than the largest first drive letter.
  • the modification module is specifically used for:
  • the second preset number of numbers corresponds to the number of the second preset number of physical ports in the mapping table in an ascending order, and the logical port is the drive letter.
  • the present invention also provides a processing system for repetition of hard disk drive letters, including:
  • Memory used to store computer programs
  • the processor is configured to implement the steps of the method for processing the hard disk drive letter duplication problem described in any one of the above items when the computer program is executed.
  • the present invention provides a method for processing the problem of repetition of hard disk drive letters, which includes obtaining a first preset number of first drive letters in a rear chip in a rear backplane and in a cascaded chip in a cascaded backplane
  • the second preset number of second drive letters where the first preset number is the number of hard drives managed by the rear backplane, and the second preset number is the number of hard drives managed by the cascaded backplane;
  • a third preset number of second preset numbers different from all the first drive letters is generated; the second preset in the cascaded chip in the cascaded backplane is adopted in the preset language
  • the number of second drive letters is changed to the second preset number of third drive letters.
  • the first preset number of first drive letters in the rear chip in the rear backplane and the second preset number of second drives in the cascade chip in the cascaded backplane can be obtained first Character, when the first and second drive letters overlap, then a second preset number of third drive letters that are different from all the first drive letters can be generated, and finally the cascade is connected in the preset language
  • the second preset number of second drive letters in the chip can be modified to the second preset number of third drive letters.
  • all hard drives managed by the cascaded backplane and the rear backplane will not exist. Duplicate hard drive letters, the staff and the processor in the server will no longer read the wrong data because of the duplicate hard drive letters, eliminating a series of security risks caused by data reading errors.
  • the invention also provides a processing device and system for repetition of hard disk drive letter, which has the same beneficial effects as the above processing method.
  • FIG. 1 is a schematic flowchart of a method for processing a duplicate problem of a hard disk drive letter provided by the present invention
  • FIG. 2 is a schematic structural diagram of a processing device for a problem of repetition of hard disk drive letters provided by the present invention
  • FIG. 3 is a schematic structural diagram of a processing system for repetition of a hard disk drive letter provided by the present invention.
  • FIG. 1 is a schematic flowchart of a method for processing a hard disk drive letter duplication problem provided by the present invention, including:
  • Step S1 Obtain a first preset number of first drive letters in the rear chip in the backplane and a second preset number of second drive letters in the cascade chip in the cascade backplane, where, The first preset number is the number of hard drives managed by the rear backplane, and the second preset number is the number of hard drives managed by the cascaded backplane;
  • the rear backplane and the cascaded backplane have their own management chips.
  • the management chip in the rear backplane is the rear chip
  • the management chip in the cascaded backplane is the cascade chip. It can be used to connect and manage multiple corresponding hard disks.
  • An important management role of the two is to manage the drive letter of each hard disk.
  • the second preset number of cascade chip management Each hard disk is connected to the cascade chip through the physical port on the cascade chip.
  • Each hard disk corresponds to a physical port.
  • For each physical port when the cascade chip is shipped from the factory, its internal The drive letter corresponding to each physical port; in the same way, it is the same for the rear chip in the rear backplane.
  • the first preset number may be the maximum number of hard disks that the rear chip can manage
  • the second preset number may be the maximum number of hard disks that the rear chip can manage.
  • the first preset number can also be the number of hard drives actually connected to the rear backplane
  • the second preset number can be the number of hard drives actually connected to the cascaded backplane
  • the first drive letter obtained at this time can be the rear
  • the first drive letter corresponding to the physical port of the hard disk connected to the backplane is the second drive letter corresponding to the physical port of the cascaded backplane connected to the hard disk. Be limited.
  • Step S2 when the first drive letter and the second drive letter overlap, a third preset number of second drive letters different from all the first drive letters is generated;
  • the third drive letter there may be multiple types, for example, only the second preset number of second drive letters may be replaced with the second drive letter that is repeated with the first drive letter to be different from all
  • the second drive letter of the first drive letter for example, the first drive letter is 0 and 1, and the second drive letter is 0, 1, 2, 3, and 4, at this time, only the 0 and 1 in the second drive letter can be changed Modified, and the modified drive letter cannot include 0 and 1.
  • third drive letters can also be generated, for example, the third drive letter is different from all the second drive letters, etc., which is not limited in this embodiment of the present invention.
  • Step S3 Using a preset language to modify the second preset number of second drive letters in the cascade chip in the cascade backplane to a second preset number of third drive letters.
  • the modification of repeated drive letters can be achieved
  • the FW (Firmware) can be modified inside the cascade chip.
  • the first drive letter of the hard disk managed by the rear backplane and the cascade backplane are managed.
  • the processor and staff in the server read a certain hard drive data, there will be no more read errors, avoiding the data.
  • step S1 if the second preset number of second drive letters obtained in step S1 is the drive letter corresponding to the physical port of the cascaded backplane to which the hard disk is connected, during the modification, the cascaded backplane can be connected Modify the second drive letter corresponding to the physical port of the hard drive.
  • the FW inside the cascade chip can be modified when the cascade backplane and the rear backplane are not cascaded, or the FW inside the cascade chip can be changed after the cascade is completed Modifications, the embodiments of the present invention are not limited herein.
  • cascading backplane can also be called the expander backplane.
  • the present invention provides a method for processing the problem of repetition of hard disk drive letters, which includes obtaining a first preset number of first drive letters in a rear chip in a rear backplane and in a cascaded chip in a cascaded backplane
  • the second preset number of second drive letters where the first preset number is the number of hard drives managed by the rear backplane, and the second preset number is the number of hard drives managed by the cascaded backplane;
  • a third preset number of second preset numbers different from all the first drive letters is generated; the second preset in the cascaded chip in the cascaded backplane is adopted in the preset language
  • the number of second drive letters is changed to the second preset number of third drive letters.
  • the first preset number of first drive letters in the rear chip in the rear backplane and the second preset number of second drives in the cascade chip in the cascaded backplane can be obtained first When the first drive letter and the second drive letter overlap, then you can design a third preset number that is different from the second preset number of all the first drive letters, and finally use the preset language to cascade
  • the second preset number of second drive letters in the chip can be modified to the second preset number of third drive letters.
  • all hard drives managed by the cascaded backplane and the rear backplane will not exist. Duplicate hard drive letters, the staff and the processor in the server will no longer read the wrong data because of the duplicate hard drive letters, eliminating a series of security risks caused by data reading errors.
  • the first drive letter, the second drive letter and the third drive letter are numbers.
  • the digital drive letter has the advantages of small data volume and convenient count management.
  • first, second, and third drive letters can also be other types of characters, such as letters, etc., which are not limited in this embodiment of the present invention.
  • all the first drive letters are:
  • the preset first drive letter in the internal rear chip is usually a number, and it is in the form of increasing one by one, such as 0, 1, 2 ... .
  • the first drive letter can also be in other forms, such as a number that decreases one by one or a number that is out of order, and the embodiments of the present invention are not limited herein.
  • the third preset number of the second preset number that is different from all the first letter is specifically:
  • the second preset number of digits is incremented one by one, wherein the smallest third letter is one greater than the largest first letter.
  • the second preset number of third drive letters different from all the first drive letters is set to the second preset number of digits that are incremented one by one, and the smallest third drive letter is larger than the largest first drive letter Big 1, easy to manage all hard drives connected to the backplane and cascaded backplane in this case, for example, the first drive letter is 0 and 1, and the third drive letter is 2-12, in this case, the rear
  • the drive letters of all the hard disks managed by the backplane and the cascaded backplane in the cascade situation are 0 to 12, a total of 13 drive letters, which means 13 hard drives, which further facilitates the management of hard drives.
  • the third drive letter can also be set in other forms, which is not limited in this embodiment of the present invention.
  • the preset language is used to modify the second preset number of second drive letters in the cascade chip in the cascade backplane to a second preset number that increases one by one.
  • the specific number is:
  • a preset method is used to modify the second preset number of logical ports in the mapping table between the physical port and the logical port in the cascade chip in the cascade backplane to a second preset number that increases one by one;
  • the second preset number of numbers and the number of the second preset number of physical ports in the mapping table correspond to each other in increasing order, and the logical port is the drive letter.
  • table 1 is a mapping table of physical ports and logical ports provided by the present invention when a cascade chip is shipped from the factory.
  • the FW inside the cascade chip specifies the correspondence between the physical port (phy) on the cascade chip and the logical port Logic, where the logical port is the drive letter, and the preset number of the cascade chip is modified.
  • the second drive letter is the logical port in the modified mapping table. In Table 1, if the first drive letter in the rear chip is 0 and 1, then the second preset number of digits generated one by one will be 2 to 15, just modify the value in the logic port Logic in Table 1 to 2 to 15.
  • the second preset number of numbers and the number of the second preset number of physical ports in the mapping table may be in one-to-one correspondence in increasing order, and the specific form may be Table 2, which is a type provided by the present invention.
  • the drive letter it can present is 2
  • the drive letter can be 3 and so on, which is more convenient for the management of the hard disk.
  • mapping table may be modified in other ways, and the embodiment of the present invention is not limited herein.
  • the preset language is XML (Extensible Markup Language, Extensible Markup Language).
  • XML has the advantages of strong friendliness and simple structure.
  • FIG. 2 is a schematic structural diagram of a device for processing hard disk drive letter duplication provided by the present invention, including:
  • the obtaining module 1 obtains a first preset number of first drive letters in the rear chip in the rear backplane and a second preset number of second drive letters in the cascade chip in the cascade backplane, wherein ,
  • the first preset number is the number of hard drives managed by the rear backplane
  • the second preset number is the number of hard drives managed by the cascaded backplane
  • the generating module 2 generates a second preset number of third drive letters different from all the first drive letters when the first drive letter and the second drive letter overlap;
  • the modification module 3 uses a preset language to modify the second preset number of second drive letters in the cascade chip in the cascade backplane to a second preset number of third drive letters.
  • the first drive letter, the second drive letter and the third drive letter are numbers.
  • all the first drive letters are:
  • the third preset number of the second preset number that is different from all the first letter is specifically:
  • the second preset number of digits is incremented one by one, wherein the smallest third letter is one greater than the largest first letter.
  • the modification module 3 is specifically used for:
  • a preset method is used to modify the second preset number of logical ports in the mapping table between the physical port and the logical port in the cascade chip in the cascade backplane to a second preset number that increases one by one;
  • the second preset number of numbers and the number of the second preset number of physical ports in the mapping table correspond to each other in increasing order, and the logical port is the drive letter.
  • FIG. 3 is a schematic structural diagram of a system for processing a hard disk drive letter duplication problem provided by the present invention, including:
  • Memory 4 used to store computer programs
  • the processor 5 is configured to implement the steps of the method for processing the problem of repetition of the hard disk drive letter in the foregoing embodiment when the computer program is executed.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Software Systems (AREA)
  • Mathematical Physics (AREA)
  • Signal Processing For Digital Recording And Reproducing (AREA)

Abstract

一种硬盘盘符重复问题的处理方法,包括获取后置背板中的后置芯片内的第一预设数目的第一盘符以及级联背板中的级联芯片内的第二预设数目的第二盘符,其中,第一预设数目为后置背板管理的硬盘数,第二预设数目为级联背板管理的硬盘数;当第一盘符与第二盘符存在重复的情况时,生成不同于所有的第一盘符的第二预设数目的第三盘符;采用预设语言将级联背板中的级联芯片内的第二预设数目的第二盘符修改为第二预设数目的第三盘符。级联背板与后置背板管理的硬盘不会存在重复的盘符,便不会读取错误的数据,消除了由数据读取错误产生的安全隐患。一种硬盘盘符重复问题的处理装置及系统,具有如上处理方法相同的有益效果。

Description

一种硬盘盘符重复问题的处理方法、装置及系统
本申请要求于2018年11月01日提交至中国专利局、申请号为201811295865.X、发明名称为“一种硬盘盘符重复问题的处理方法、装置及系统”的中国专利申请的优先权,其全部内容通过引用结合在本申请中。
技术领域
本发明涉及硬盘领域,特别是涉及一种硬盘盘符重复问题的处理方法,本发明还涉及一种硬盘盘符重复问题的处理装置及系统。
背景技术
随着大数据技术的发展,对于服务器数据存储能力的要求越来越高,服务器通常采用前置背板与后置背板组合的硬盘存储结构,需要将前置背板与后置背板进行级联处理,此时的前置背板为级联背板,级联背板以及后置背板均用于管理多个硬盘,级联背板管理的硬盘以及后置背板管理的硬盘均有各自的盘符,且多个盘符中有重复的盘符存在,在这种情况下,工作人员以及服务器中的处理器在读取某个硬盘中的数据时,便可能因为重复的盘符而发生数据读取错误的情况,但是现有技术中没有一种成熟的解决方案,存在诸多的安全隐患。
因此,如何提供一种解决上述技术问题的方案是本领域技术人员目前需要解决的问题。
发明内容
本发明的目的是提供一种硬盘盘符重复问题的处理方法,降低了数据读取错误的概率,消除了安全隐患;本发明的另一目的是提供一种硬盘盘符重复问题的处理装置及系统,降低了数据读取错误的概率,消除了安全隐患。
为解决上述技术问题,本发明提供了一种硬盘盘符重复问题的处理方法,包括:
获取后置背板中的后置芯片内的第一预设数目的第一盘符以及级联背板中的级联芯片内的第二预设数目的第二盘符,其中,所述第一预设数目为后置背板管理的硬盘数,所述第二预设数目为级联背板管理的硬盘数;
当所述第一盘符与所述第二盘符存在重复的情况时,生成不同于所有的所述第一盘符的所述第二预设数目的第三盘符;
采用预设语言将级联背板中的级联芯片内的所述第二预设数目的第二盘符修改为所述第二预设数目的所述第三盘符。
优选地,所述第一盘符、所述第二盘符以及所述第三盘符均为数字。
优选地,所述所有的第一盘符为:
从零开始逐一递增的所述第一预设数目个数字;
则所述不同于所有的所述第一盘符的第二预设数目的第三盘符具体为:
逐一递增的所述第二预设数目个数字,其中,最小的所述第三盘符比最大的所述第一盘符大1。
优选地,所述采用预设语言将级联背板中的级联芯片内的所述第二预设数目的第二盘符修改为逐一递增的所述第二预设数目个数字具体为:
采用预设方法将级联背板中的级联芯片内的物理口与逻辑口映射表中所述第二预设数目个逻辑口修改为逐一递增的所述第二预设数目个数字;
其中,所述第二预设数目个数字与所述映射表中第二预设数目个物理口的编号均按照递增的顺序一一对应,所述逻辑口即为所述盘符。
优选地,所述预设语言为可扩展标记语言XML。
为解决上述技术问题,本发明还提供了一种硬盘盘符重复问题的处理装置,包括:
获取模块,获取后置背板中的后置芯片内的第一预设数目的第一盘符以及级联背板中的级联芯片内的第二预设数目的第二盘符,其中,所述第一预设数目为后置背板管理的硬盘数,所述第二预设数目为级联背板管理的硬盘数;
生成模块,当所述第一盘符与所述第二盘符存在重复的情况时,生成不同于所有的所述第一盘符的所述第二预设数目的第三盘符;
修改模块,采用预设语言将级联背板中的级联芯片内的所述第二预设数目的第二盘符修改为所述第二预设数目的所述第三盘符。
优选地,所述第一盘符、所述第二盘符以及所述第三盘符均为数字。
优选地,所述所有的第一盘符为:
从零开始逐一递增的所述第一预设数目个数字;
则所述不同于所有的所述第一盘符的第二预设数目的第三盘符具体为:
逐一递增的所述第二预设数目个数字,其中,最小的所述第三盘符比最大的所述第一盘符大1。
优选地,所述修改模块具体用于:
采用预设方法将级联背板中的级联芯片内的物理口与逻辑口映射表中所述第二预设数目个逻辑口修改为逐一递增的所述第二预设数目个数字;
其中,所述第二预设数目个数字与所述映射表中第二预设数目个物理口的编号均按照递增的顺序一一对应,所述逻辑口即为所述盘符。
为解决上述技术问题,本发明还提供了一种硬盘盘符重复问题的处理系统,包括:
存储器,用于存储计算机程序;
处理器,用于执行所述计算机程序时实现如上任一项所述硬盘盘符重复问题的处理方法的步骤。
本发明提供了一种硬盘盘符重复问题的处理方法,包括获取后置背板中的后置芯片内的第一预设数目的第一盘符以及级联背板中的级联芯片内的第二预设数目的第二盘符,其中,第一预设数目为后置背板管理的硬盘数,第二预设数目为级联背板管理的硬盘数;当第一盘符与第二盘符存在重复的情况时,生成不同于所有的第一盘符的第二预设数目的第三盘符;采用预设语言将级联背板中的级联芯片内的第二预设数目的第二盘符修改为第二预设数目的第三盘符。
可见,本发明中,首先可以获取后置背板中后置芯片内的第一预设数目的第一盘符以及级联背板中的级联芯片内的第二预设数目的第二盘符,当第一盘符与第二盘符存在重复的情况时,然后可以生成出不同于所有的 第一盘符的第二预设数目的第三盘符,最后采用预设语言将级联芯片中第二预设数目的第二盘符修改为第二预设数目的第三盘符即可,此种情况下,级联背板与后置背板管理的所有硬盘中便不会存在重复的硬盘盘符,工作人员以及服务器中的处理器便不会再因为重复的硬盘盘符而读取错误的数据,消除了由数据读取错误而产生的一系列安全隐患。
本发明还提供了一种硬盘盘符重复问题的处理装置及系统,具有如上处理方法相同的有益效果。
附图说明
为了更清楚地说明本发明实施例中的技术方案,下面将对现有技术和实施例中所需要使用的附图作简单地介绍,显而易见地,下面描述中的附图仅仅是本发明的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动的前提下,还可以根据这些附图获得其他的附图。
图1为本发明提供的一种硬盘盘符重复问题的处理方法的流程示意图;
图2为本发明提供的一种硬盘盘符重复问题的处理装置的结构示意图;
图3为本发明提供的一种硬盘盘符重复问题的处理系统的结构示意图。
具体实施方式
本发明的核心是提供一种硬盘盘符重复问题的处理方法,降低了数据读取错误的概率,消除了安全隐患;本发明的另一核心是提供一种硬盘盘符重复问题的处理装置及系统,降低了数据读取错误的概率,消除了安全隐患。
为使本发明实施例的目的、技术方案和优点更加清楚,下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、完整地描述,显然,所描述的实施例是本发明一部分实施例,而不是全部的实施例。 基于本发明中的实施例,本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。
请参考图1,图1为本发明提供的一种硬盘盘符重复问题的处理方法的流程示意图,包括:
步骤S1:获取后置背板中的后置芯片内的第一预设数目的第一盘符以及级联背板中的级联芯片内的第二预设数目的第二盘符,其中,第一预设数目为后置背板管理的硬盘数,第二预设数目为级联背板管理的硬盘数;
具体的,后置背板以及级联背板中都有各自的管理芯片,其中,后置背板中的管理芯片为后置芯片,而级联背板中的管理芯片为级联芯片,分别可以用于连接并管理各自对应的多个硬盘,两者所具有的一个重要的管理作用为管理各个硬盘的盘符,例如,对于级联芯片来说,级联芯片管理的第二预设数目个硬盘均通过级联芯片上的物理口连接于级联芯片上,每个硬盘对应连接一个物理口,而对于每个物理口来说,在级联芯片出厂时,其内部已经设置好了与每个物理口对应的盘符;同理,对于后置背板中的后置芯片来说也一样,因此,当两个芯片出厂时内部的初始盘符存在相同盘符时,若后置背板与级联背板级联在一起进行使用,便会产生盘符重复的情况,进而导致数据读取错误的问题。
具体的,第一预设数目可以为后置芯片所能管理的硬盘数量的最大值,第二预设数目可以为后置芯片所能管理的硬盘数量的最大值,此种情况下,便可以获取所有的盘符,并进行重复盘符的修改,这种情况下,无论后置芯片以及级联芯片实际上连接了多少个硬盘,均不会发生盘符重复的情况。
当然,第一预设数目还可以为后置背板实际连接的硬盘数,而第二预设数目可以为级联背板实际连接的硬盘数,此时获取的第一盘符便可以为后置背板连接有硬盘的物理口所对应的第一盘符,而第二盘符便可以为级联背板连接有硬盘的物理口所对应的第二盘符,本发明实施例在此不做限定。
步骤S2:当第一盘符与第二盘符存在重复的情况时,生成不同于所有的第一盘符的第二预设数目的第三盘符;
具体的,可以首先将第一预设数目的第一盘符与第二预设数目的第二盘符进行对比,当第一盘符与第二盘符存在重复的情况时,即任一第一盘符在所有的第二盘符中有重复的情况存在,则生成不同于所有的第一盘符的第二预设数目的第三盘符。
具体的,在生成第三盘符时,可以有多种类型,例如可以仅将第二预设数目的第二盘符中,与第一盘符重复的第二盘符替换为区别于所有的第一盘符的第二盘符,例如第一盘符为0和1,而第二盘符为0、1、2、3以及4,此时可以仅将第二盘符中的0以及1修改掉,而修改后的盘符不能包括0和1。
当然,也可以生成其他类型的第三盘符,例如第三盘符不同于所有的第二盘符等,本发明实施例在此不做限定。
步骤S3:采用预设语言将级联背板中的级联芯片内的第二预设数目的第二盘符修改为第二预设数目的第三盘符。
具体的,将级联背板中的级联芯片内的第二预设数目的第二盘符修改为生成的第二预设数目的第三盘符,即可实现重复盘符的修改,解决了重复盘符的问题,此时修改的可以为级联芯片内部的FW(Firmware,固件),此种情况下,后置背板所管理的硬盘的第一盘符以及级联背板所管理的硬盘的第三盘符便不会有重复的盘符存在,服务器中的处理器以及工作人员在读取某个硬盘数据的时候,便不会再发生读取错误的情况,避免了因为数据读取错误而产生的一系列安全问题。
其中,在修改时,若步骤S1获取的第二预设数目的第二盘符为级联背板连接有硬盘的物理口所对应的盘符,在修改的时候,可以将级联背板连接有硬盘的物理口对应的第二盘符进行修改。
其中,在本发明实施例中,可以在级联背板与后置背板没有级联时对级联芯片内部的FW进行修改,也可以在级联好之后再对级联芯片内部的FW进行修改,本发明实施例在此不做限定。
另外,级联背板还可以叫做可扩展性expander背板。
本发明提供了一种硬盘盘符重复问题的处理方法,包括获取后置背板中的后置芯片内的第一预设数目的第一盘符以及级联背板中的级联芯片内 的第二预设数目的第二盘符,其中,第一预设数目为后置背板管理的硬盘数,第二预设数目为级联背板管理的硬盘数;当第一盘符与第二盘符存在重复的情况时,生成不同于所有的第一盘符的第二预设数目的第三盘符;采用预设语言将级联背板中的级联芯片内的第二预设数目的第二盘符修改为第二预设数目的第三盘符。
可见,本发明中,首先可以获取后置背板中后置芯片内的第一预设数目的第一盘符以及级联背板中的级联芯片内的第二预设数目的第二盘符,当第一盘符与第二盘符存在重复的情况时,然后可以设计出不同于所有的第一盘符的第二预设数目的第三盘符,最后采用预设语言将级联芯片中第二预设数目的第二盘符修改为第二预设数目的第三盘符即可,此种情况下,级联背板与后置背板管理的所有硬盘中便不会存在重复的硬盘盘符,工作人员以及服务器中的处理器便不会再因为重复的硬盘盘符而读取错误的数据,消除了由数据读取错误而产生的一系列安全隐患。
在上述实施例的基础上:
作为一种优选的实施例,第一盘符、第二盘符以及第三盘符均为数字。
具体的,本发明实施例中,数字形式的盘符具有数据量小以及方便计数管理等优点。
当然,除了数字外,第一盘符、第二盘符以及第三盘符还可以为其他类型的字符,例如字母等,本发明实施例在此不做限定。
作为一种优选的实施例,所有的第一盘符为:
从零开始逐一递增的第一预设数目个数字;
具体的,在后置背板出厂时,其内部的后置芯片中的预设的第一盘符通常为数字,且呈逐一递增的形式,例如0、1、2…..等,方便管理。
当然,除了从零开始逐一递增的第一预设数目个数字外,第一盘符还可以为其他形式,例如逐一递减的数字或者乱序的数字等,本发明实施例在此不做限定。
则不同于所有的第一盘符的第二预设数目的第三盘符具体为:
逐一递增的第二预设数目个数字,其中,最小的第三盘符比最大的第一盘符大1。
具体的,将不同于所有的第一盘符的第二预设数目的第三盘符设置为逐一递增的第二预设数目个数字,且最小的第三盘符比最大的第一盘符大1,这种情况下方便管理后置背板以及级联背板所连接的所有硬盘,例如第一盘符为0以及1,而第三盘符为2-12,此种情况下,后置背板以及级联背板在级联情况下所管理的所有硬盘的盘符便为0至12共13个盘符,也即代表13个硬盘,进一步地方便硬盘的管理。
当然,第三盘符还可以设置为其他形式,本发明实施例在此不做限定。
作为一种优选的实施例,采用预设语言将级联背板中的级联芯片内的第二预设数目的第二盘符修改为逐一递增的第二预设数目个数字具体为:
采用预设方法将级联背板中的级联芯片内的物理口与逻辑口映射表中第二预设数目个逻辑口修改为逐一递增的第二预设数目个数字;
其中,第二预设数目个数字与映射表中第二预设数目个物理口的编号均按照递增的顺序一一对应,逻辑口即为盘符。
为了更好地对本发明实施例进行说明,请参考下表1,表1为本发明提供的一种级联芯片出厂时的物理口与逻辑口的映射表。
表1
Figure PCTCN2019093357-appb-000001
具体的,在出厂时,级联芯片内部的FW规定了级联芯片上的物理口(phy)与逻辑口Logic的对应关系,其中,逻辑口便为盘符,修改级联芯片预置的第二盘符即为修改映射表中的逻辑口,在表1中,此时若后置芯片中的第一盘符为0和1,那么生成的逐一递增的第二预设数目个数字便为2至15,只需将表1中的逻辑口Logic中的数值修改为2至15即可。
其中,可以将第二预设数目个数字与映射表中第二预设数目个物理口的编号均按照递增的顺序一一对应,具体形式可以为表2,表2为本发明提供的一种级联芯片修改后的物理口与逻辑口的映射表。
表2
Figure PCTCN2019093357-appb-000002
具体的,对应于表2中的级联芯片,在将硬盘连接在0号物理口时,其所呈现出的盘符便可以为2,当硬盘连接在1号物理口时,其所呈现出的盘符便可以为3,依次类推,更加方便对于硬盘的管理。
当然,除了本发明实施例中的修改方式外,还可以对映射表进行其他方式的修改,本发明实施例在此不做限定。
作为一种优选的实施例,预设语言为XML(Extensible Markup Language,可扩展标记语言)。
具体的,XML具有友好性强以及结构简单等优点。
当然,除了XML外,还可以采用其他类型的语言对第二盘符进行修改,本发明实施例在此不做限定。
请参考图2,图2为本发明提供的一种硬盘盘符重复问题的处理装置的结构示意图,包括:
获取模块1,获取后置背板中的后置芯片内的第一预设数目的第一盘符以及级联背板中的级联芯片内的第二预设数目的第二盘符,其中,第一预设数目为后置背板管理的硬盘数,第二预设数目为级联背板管理的硬盘数;
生成模块2,当第一盘符与第二盘符存在重复的情况时,生成不同于所有的第一盘符的第二预设数目的第三盘符;
修改模块3,采用预设语言将级联背板中的级联芯片内的第二预设数目的第二盘符修改为第二预设数目的第三盘符。
作为一种优选的实施例,第一盘符、第二盘符以及第三盘符均为数字。
作为一种优选的实施例,所有的第一盘符为:
从零开始逐一递增的第一预设数目个数字;
则不同于所有的第一盘符的第二预设数目的第三盘符具体为:
逐一递增的第二预设数目个数字,其中,最小的第三盘符比最大的第一盘符大1。
作为一种优选的实施例,修改模块3具体用于:
采用预设方法将级联背板中的级联芯片内的物理口与逻辑口映射表中第二预设数目个逻辑口修改为逐一递增的第二预设数目个数字;
其中,第二预设数目个数字与映射表中第二预设数目个物理口的编号均按照递增的顺序一一对应,逻辑口即为盘符。
对于本发明实施例提供的硬盘盘符重复问题的处理装置的介绍请参照前述处理方法的实施例,本发明实施例在此不再赘述。
请参考图3,图3为本发明提供的一种硬盘盘符重复问题的处理系统的结构示意图,包括:
存储器4,用于存储计算机程序;
处理器5,用于执行计算机程序时实现如前述实施例中硬盘盘符重复问题的处理方法的步骤。
对于本发明实施例提供的硬盘盘符重复问题的处理系统的介绍请参照前述处理方法的实施例,本发明实施例在此不再赘述。
本说明书中各个实施例采用递进的方式描述,每个实施例重点说明的都是与其他实施例的不同之处,各个实施例之间相同相似部分互相参见即可。对于实施例公开的装置而言,由于其与实施例公开的方法相对应,所以描述的比较简单,相关之处参见方法部分说明即可。
还需要说明的是,在本说明书中,诸如第一和第二等之类的关系术语仅仅用来将一个实体或者操作与另一个实体或操作区分开来,而不一定要求或者暗示这些实体或操作之间存在任何这种实际的关系或者顺序。而且,术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含,从而使得包括一系列要素的过程、方法、物品或者设备不仅包括那些要素,而且还包括没有明确列出的其他要素,或者是还包括为这种过程、方法、物品或者设备所固有的要素。在没有更多限制的情况下,由语句“包括一 个……”限定的要素,并不排除在包括该要素的过程、方法、物品或者设备中还存在另外的相同要素。
对所公开的实施例的上述说明,使本领域专业技术人员能够实现或使用本发明。对这些实施例的多种修改对本领域的专业技术人员来说将是显而易见的,本文中所定义的一般原理可以在不脱离本发明的精神或范围的情况下,在其他实施例中实现。因此,本发明将不会被限制于本文所示的这些实施例,而是要符合与本文所公开的原理和新颖特点相一致的最宽的范围。

Claims (10)

  1. 一种硬盘盘符重复问题的处理方法,其特征在于,包括:
    获取后置背板中的后置芯片内的第一预设数目的第一盘符以及级联背板中的级联芯片内的第二预设数目的第二盘符,其中,所述第一预设数目为后置背板管理的硬盘数,所述第二预设数目为级联背板管理的硬盘数;
    当所述第一盘符与所述第二盘符存在重复的情况时,生成不同于所有的所述第一盘符的所述第二预设数目的第三盘符;
    采用预设语言将级联背板中的级联芯片内的所述第二预设数目的第二盘符修改为所述第二预设数目的所述第三盘符。
  2. 根据权利要求1所述的处理方法,其特征在于,所述第一盘符、所述第二盘符以及所述第三盘符均为数字。
  3. 根据权利要求2所述的处理方法,其特征在于,所述所有的第一盘符为:
    从零开始逐一递增的所述第一预设数目个数字;
    则所述不同于所有的所述第一盘符的第二预设数目的第三盘符具体为:
    逐一递增的所述第二预设数目个数字,其中,最小的所述第三盘符比最大的所述第一盘符大1。
  4. 根据权利要求3所述的处理方法,其特征在于,所述采用预设语言将级联背板中的级联芯片内的所述第二预设数目的第二盘符修改为逐一递增的所述第二预设数目个数字具体为:
    采用预设方法将级联背板中的级联芯片内的物理口与逻辑口映射表中所述第二预设数目个逻辑口修改为逐一递增的所述第二预设数目个数字;
    其中,所述第二预设数目个数字与所述映射表中第二预设数目个物理口的编号均按照递增的顺序一一对应,所述逻辑口即为所述盘符。
  5. 根据权利要求1至4任一项所述的处理方法,其特征在于,所述预设语言为可扩展标记语言XML。
  6. 一种硬盘盘符重复问题的处理装置,其特征在于,包括:
    获取模块,获取后置背板中的后置芯片内的第一预设数目的第一盘符以及级联背板中的级联芯片内的第二预设数目的第二盘符,其中,所述第一预设数目为后置背板管理的硬盘数,所述第二预设数目为级联背板管理的硬盘数;
    生成模块,当所述第一盘符与所述第二盘符存在重复的情况时,生成不同于所有的所述第一盘符的所述第二预设数目的第三盘符;
    修改模块,采用预设语言将级联背板中的级联芯片内的所述第二预设数目的第二盘符修改为所述第二预设数目的所述第三盘符。
  7. 根据权利要求6所述的处理装置,其特征在于,所述第一盘符、所述第二盘符以及所述第三盘符均为数字。
  8. 根据权利要求7所述的处理装置,其特征在于,所述所有的第一盘符为:
    从零开始逐一递增的所述第一预设数目个数字;
    则所述不同于所有的所述第一盘符的第二预设数目的第三盘符具体为:
    逐一递增的所述第二预设数目个数字,其中,最小的所述第三盘符比最大的所述第一盘符大1。
  9. 根据权利要求8所述的处理装置,其特征在于,所述修改模块具体用于:
    采用预设方法将级联背板中的级联芯片内的物理口与逻辑口映射表中所述第二预设数目个逻辑口修改为逐一递增的所述第二预设数目个数字;
    其中,所述第二预设数目个数字与所述映射表中第二预设数目个物理口的编号均按照递增的顺序一一对应,所述逻辑口即为所述盘符。
  10. 一种硬盘盘符重复问题的处理系统,其特征在于,包括:
    存储器,用于存储计算机程序;
    处理器,用于执行所述计算机程序时实现如权利要求1至5任一项所述硬盘盘符重复问题的处理方法的步骤。
PCT/CN2019/093357 2018-11-01 2019-06-27 一种硬盘盘符重复问题的处理方法、装置及系统 WO2020087955A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811295865.X 2018-11-01
CN201811295865.XA CN109491604B (zh) 2018-11-01 2018-11-01 一种硬盘盘符重复问题的处理方法、装置及系统

Publications (1)

Publication Number Publication Date
WO2020087955A1 true WO2020087955A1 (zh) 2020-05-07

Family

ID=65692258

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/093357 WO2020087955A1 (zh) 2018-11-01 2019-06-27 一种硬盘盘符重复问题的处理方法、装置及系统

Country Status (2)

Country Link
CN (1) CN109491604B (zh)
WO (1) WO2020087955A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109491604B (zh) * 2018-11-01 2021-07-02 郑州云海信息技术有限公司 一种硬盘盘符重复问题的处理方法、装置及系统

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102789371A (zh) * 2012-07-27 2012-11-21 曙光信息产业(北京)有限公司 硬盘盘符分配方法
CN104699423A (zh) * 2015-03-13 2015-06-10 华为技术有限公司 Linux系统中绑定盘符的方法和装置
CN106469103A (zh) * 2015-08-14 2017-03-01 华为软件技术有限公司 硬盘的维护方法和装置
WO2017054737A1 (zh) * 2015-09-30 2017-04-06 华为技术有限公司 一种基于大容量固态存储的地址映射方法及装置
CN107239231A (zh) * 2017-05-03 2017-10-10 深圳市同泰怡信息技术有限公司 一种固定磁盘槽位号和磁盘标识符映射关系的方法
CN109491604A (zh) * 2018-11-01 2019-03-19 郑州云海信息技术有限公司 一种硬盘盘符重复问题的处理方法、装置及系统

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000322327A (ja) * 1999-05-10 2000-11-24 Mitsubishi Electric Corp ファイル復旧装置及び情報記憶媒体
CN104281498B (zh) * 2014-09-18 2017-08-11 飞天诚信科技股份有限公司 一种windows系统下自动恢复逻辑驱动器的方法
CN106681799B (zh) * 2017-01-03 2018-05-18 北京百度网讯科技有限公司 插入磁盘的方法、装置和系统
CN107239273B (zh) * 2017-05-02 2020-08-28 杭州沃趣科技股份有限公司 一种服务器的磁盘盘符绑定方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102789371A (zh) * 2012-07-27 2012-11-21 曙光信息产业(北京)有限公司 硬盘盘符分配方法
CN104699423A (zh) * 2015-03-13 2015-06-10 华为技术有限公司 Linux系统中绑定盘符的方法和装置
CN106469103A (zh) * 2015-08-14 2017-03-01 华为软件技术有限公司 硬盘的维护方法和装置
WO2017054737A1 (zh) * 2015-09-30 2017-04-06 华为技术有限公司 一种基于大容量固态存储的地址映射方法及装置
CN107239231A (zh) * 2017-05-03 2017-10-10 深圳市同泰怡信息技术有限公司 一种固定磁盘槽位号和磁盘标识符映射关系的方法
CN109491604A (zh) * 2018-11-01 2019-03-19 郑州云海信息技术有限公司 一种硬盘盘符重复问题的处理方法、装置及系统

Also Published As

Publication number Publication date
CN109491604B (zh) 2021-07-02
CN109491604A (zh) 2019-03-19

Similar Documents

Publication Publication Date Title
US10592672B2 (en) Testing insecure computing environments using random data sets generated from characterizations of real data sets
US9619492B2 (en) Data migration
WO2020233146A1 (zh) 数据操作记录的存储方法、系统、装置及设备
US9128967B2 (en) Storing graph data in a column-oriented data store
WO2021051627A1 (zh) 基于数据库的批量导入方法、装置、设备及存储介质
US10877997B2 (en) Clustering database data
US10997131B1 (en) Using a member attribute to perform a database operation on a computing device
WO2022063223A1 (zh) 数据校验方法、装置和系统
US9262185B2 (en) Scripted dynamic document generation using dynamic document template scripts
JP2022545303A (ja) 概念データモデルからのソフトウェアアーチファクトの生成
WO2017032170A1 (zh) 镜像文件的导入方法及装置
US11093541B2 (en) Transforming an ontology query to an SQL query
WO2019019702A1 (zh) 算法的生成方法、装置、终端设备及存储介质
US20140130175A1 (en) Data Leakage Detection in a Multi-Tenant Data Architecture
US10248668B2 (en) Mapping database structure to software
WO2016086695A1 (zh) 一种多路径设备的命名方法、装置、主机及通信系统
WO2020087955A1 (zh) 一种硬盘盘符重复问题的处理方法、装置及系统
WO2020207008A1 (zh) 一种数据验证方法、装置、电子设备及存储介质
CN104216721A (zh) 一种在操作系统启动之前下发配置的方法
CN108573015A (zh) 变更表格式的方法、装置、电子设备和可读存储介质
WO2024066094A1 (zh) 一种跨数据源数据库视图可视化构建方法及系统
US10747747B2 (en) Interpreting invalid data as valid data
US20140059011A1 (en) Automated data curation for lists
CN111831659B (zh) 一种检查索引的方法、装置及计算设备
TW202242754A (zh) 一種交易平臺留言寫入方法及系統

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19879802

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19879802

Country of ref document: EP

Kind code of ref document: A1