DATA STRIPPING, ALLOCATION AND RECONSTRUCTION

    公开(公告)号:US20180246793A1

    公开(公告)日:2018-08-30

    申请号:US15553976

    申请日:2016-02-26

    Abstract: A method for data stripping, allocation and reconstruction in an active drive storage system including a plurality of active object storage devices, each of the plurality of active object storage devices including one or more storage devices and a controller is provided. The method includes the controller of the identified one of the plurality of active object storage devices segmenting the received data into a plurality of data chunks and generating one or more parity chunks in response to the plurality of data chunks. The method further includes the controller of the identified one of the plurality of active object storage devices reorganizing the plurality of data chunks and the one or more parity chunks in response to a number of the plurality of data chunks and a number of the one or more of the plurality of active object storage devices into which the received data is to be stored. Finally, the method includes the step of the controller of the identified one of the plurality of active object storage devices storing the plurality of data chunks and the one or more parity chunks into the one or more of the plurality of active object storage devices.

    METHOD OF CONSTRUCTING FLAT XOR CODES FROM INTEGER INDEXED TANNER GRAPHS

    公开(公告)号:US20170279462A1

    公开(公告)日:2017-09-28

    申请号:US15508718

    申请日:2015-09-29

    CPC classification number: H03M13/1102 H03M13/036 H03M13/05 H03M13/373

    Abstract: A method for defining an erasure code for system having a predetermined number of data disks is disclosed. The method includes selecting step, constructing step, determining step and repeating step. The selecting step includes selecting a predetermined acceptable number of failures for the system. The constructing step includes constructing a first Tanner graph for two failures acceptable system having predetermined number of data disks. The determining step includes determining erasure code from the first Tanner graph. The repeating step includes repeating the constructing step and the determining step by increasing the acceptable number of failures by one and constructing another Tanner graph in response to the increased acceptable number of failures by increasing number of parity nodes until the predetermined number of failures for the system is reached.

Patent Agency Ranking