Fast system state cloning
    151.
    发明授权

    公开(公告)号:US09817728B2

    公开(公告)日:2017-11-14

    申请号:US15089837

    申请日:2016-04-04

    Abstract: A system and method to create a clone of a source computing system, the system including the steps of selecting a memory space coupled to the source computing system, retrieving uncoded data from the selected memory space, encoding the uncoded data by use of a bit-marker-based encoding process executing on a backup server, storing encoded data in a protected memory coupled to the backup server, wherein the protected memory is protected from a power interruption, retrieving the encoded data from the protected memory; and decoding the encoded data onto a target computing system, wherein the target computing system is separate from the source computing system.

    CONTINUING OPERATION OF A QUORUM BASED SYSTEM AFTER FAILURES

    公开(公告)号:US20170322848A1

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

    申请号:US15144950

    申请日:2016-05-03

    CPC classification number: G06F11/142 G06F2201/805 G06F2201/85

    Abstract: A processor-implemented method, for continuing operation of a quorum based system is provided. The method detects a loss of quorum. A plurality of speculative configurations is created, whereby each speculative configuration is isolated from other speculative configurations in the quorum based system. Each speculative configuration continues to order requests during the creation of speculative configurations. The method selects and starts one of the plurality of speculative configurations as a new operational configuration. Ordered requests continue to the new operational configuration. The original configuration of the quorum based system is restarted in response to the plurality of speculative configurations not being isolated.

    EFFICIENT REPAIR OF B+ TREE DATABASES WITH VARIABLE-LENGTH RECORDS

    公开(公告)号:US20170315881A1

    公开(公告)日:2017-11-02

    申请号:US15142850

    申请日:2016-04-29

    Applicant: NetApp, Inc.

    CPC classification number: G06F11/1471 G06F2201/80 G06F2201/805

    Abstract: Presented herein are methods, non-transitory computer readable media, and devices for efficiently repairing tree databases with variable-length records. Methods for repairing tree databases with variable-length records are disclosed which include: iterating the tree database, detecting at least one recoverable leaf block, reducing the at least one recoverable leaf block to its legally formatted contents, and writing the at least one recoverable leaf block back into the tree database; processing the at least one recoverable leaf block to ensure the at least one recoverable leaf block represents a disjoint region within a record space within the tree database; and rebuilding branch blocks as necessary to provide a lookup and organizational index for the at least one recoverable leaf block.

Patent Agency Ranking