Patent classifications
G06F16/188
DETERMINING SHARED NODES BETWEEN SNAPSHOTS USING PROBABILISTIC DATA STRUCTURES
The present disclosure is related to methods, systems, and machine-readable media for determining shared nodes between snapshots using probabilistic data structures. A unique identifier can be assigned to each node of a first tree data structure corresponding to a first snapshot of a virtual computing instance (VCI). A first probabilistic data structure representing the first tree data structure can be created that includes hashes of the identifiers assigned to the nodes of the first tree data structure. A unique identifier can be assigned to each node of a second tree data structure corresponding to a second snapshot of the VCI. A second probabilistic data structure representing the second tree data structure can be created that includes hashes of the identifiers assigned to the nodes of the second tree data structure. A particular node of the second tree data structure can be determined to be shared by the first tree data structure responsive to a determination that the first probabilistic data structure includes a hash of an identifier assigned to the particular node.
DETERMINING SHARED NODES BETWEEN SNAPSHOTS USING PROBABILISTIC DATA STRUCTURES
The present disclosure is related to methods, systems, and machine-readable media for determining shared nodes between snapshots using probabilistic data structures. A unique identifier can be assigned to each node of a first tree data structure corresponding to a first snapshot of a virtual computing instance (VCI). A first probabilistic data structure representing the first tree data structure can be created that includes hashes of the identifiers assigned to the nodes of the first tree data structure. A unique identifier can be assigned to each node of a second tree data structure corresponding to a second snapshot of the VCI. A second probabilistic data structure representing the second tree data structure can be created that includes hashes of the identifiers assigned to the nodes of the second tree data structure. A particular node of the second tree data structure can be determined to be shared by the first tree data structure responsive to a determination that the first probabilistic data structure includes a hash of an identifier assigned to the particular node.
HARD LINK HANDLING WITH DIRECTORY SNAPSHOTS
Described is hard link handling when a directory snapshot exists that includes the hard link's connected file object. A hard link is created by allocating a virtual inode number for the hard link, with the virtual inode number mapped to a real inode number that identifies a real inode of the file object; the hard link is assigned weight. A total weight associated with the real inode is increased by the hard link weight, and a hard link data store is updated with an entry for the hard link. Upon receiving data write request to the hard link, weight data determines that the file object is shared as a result of the snapshot; the hard link is disassociated from the real inode file, and associated with a new real inode number and new real inode of a new file object. The data is written based on the new real inode.
HARD LINK HANDLING WITH DIRECTORY SNAPSHOTS
Described is hard link handling when a directory snapshot exists that includes the hard link's connected file object. A hard link is created by allocating a virtual inode number for the hard link, with the virtual inode number mapped to a real inode number that identifies a real inode of the file object; the hard link is assigned weight. A total weight associated with the real inode is increased by the hard link weight, and a hard link data store is updated with an entry for the hard link. Upon receiving data write request to the hard link, weight data determines that the file object is shared as a result of the snapshot; the hard link is disassociated from the real inode file, and associated with a new real inode number and new real inode of a new file object. The data is written based on the new real inode.
INFORMATION HANDLING SYSTEM SUPPORTING DISTRIBUTED FILE SYSTEM AND COMPOUND NAMESPACE IN PRE-BOOT ENVIRONMENT
A UEFI client initiates an SMB negotiation with a remote server for an augmented capability protocol that supports secure distributed namespace compounding via customized commands and trusted share-specific and transaction-specific data structures, referred to herein simply as secure blobs, communicated over a secure tunnel. The client platform may include a nonvolatile storage resource containing factory-installed AC modules for both the client and the server, as well as factory stored profile information for known remote shares. Upon successfully negotiating for the AC protocol, the UEFI client may retrieve and install the AC client and server modules to enable the AC protocol. The AC client may mount a local namespace, which includes a namespace folder for each remote share. The AC server module, in combination with remote share profile information provided by the AC client, enables the remote server to mount a virtual distributed namespace and function as a RVDN server.
INFORMATION HANDLING SYSTEM SUPPORTING DISTRIBUTED FILE SYSTEM AND COMPOUND NAMESPACE IN PRE-BOOT ENVIRONMENT
A UEFI client initiates an SMB negotiation with a remote server for an augmented capability protocol that supports secure distributed namespace compounding via customized commands and trusted share-specific and transaction-specific data structures, referred to herein simply as secure blobs, communicated over a secure tunnel. The client platform may include a nonvolatile storage resource containing factory-installed AC modules for both the client and the server, as well as factory stored profile information for known remote shares. Upon successfully negotiating for the AC protocol, the UEFI client may retrieve and install the AC client and server modules to enable the AC protocol. The AC client may mount a local namespace, which includes a namespace folder for each remote share. The AC server module, in combination with remote share profile information provided by the AC client, enables the remote server to mount a virtual distributed namespace and function as a RVDN server.
Transparent referrals for distributed file servers
Examples of systems described herein include a virtualized file server including a first file server virtual machine and a second file server virtual machine configured to manage a distributed file share of storage items. The second file server virtual machine is configured to manage a particular storage item of the distributed file share of storage items. The first file server virtual machine is configured to, in response to receipt of a referral request for a file share path for the particular storage item from a client, look up a file share path for the particular storage item in a map of at least a portion of the distributed file share of storage items, and provide a referral with the file share path that identifies the second file server virtual machine.
Transparent referrals for distributed file servers
Examples of systems described herein include a virtualized file server including a first file server virtual machine and a second file server virtual machine configured to manage a distributed file share of storage items. The second file server virtual machine is configured to manage a particular storage item of the distributed file share of storage items. The first file server virtual machine is configured to, in response to receipt of a referral request for a file share path for the particular storage item from a client, look up a file share path for the particular storage item in a map of at least a portion of the distributed file share of storage items, and provide a referral with the file share path that identifies the second file server virtual machine.
System and method for PaaS cloud ready random access report generation
Various methods, apparatuses/systems, and media for PaaS cloud ready random access report generation are disclosed. A processor receives an initial intermediate file having intermediate contents to be utilized for PaaS cloud ready random access report generation; determines whether the intermediate contents exceed a predetermined memory threshold value; implements a first mode of report generation algorithm to create a final intermediate file when it is determined that a memory requirement for the intermediate contents is equal to or below the predetermined memory threshold value or implement a second mode of report generation algorithm to create the final intermediate file when it determined that the memory requirement for the intermediate contents exceed the predetermined memory threshold value; transmits the final intermediate file to a rendering engine; and generates a report based on the final intermediate file.
System and method for PaaS cloud ready random access report generation
Various methods, apparatuses/systems, and media for PaaS cloud ready random access report generation are disclosed. A processor receives an initial intermediate file having intermediate contents to be utilized for PaaS cloud ready random access report generation; determines whether the intermediate contents exceed a predetermined memory threshold value; implements a first mode of report generation algorithm to create a final intermediate file when it is determined that a memory requirement for the intermediate contents is equal to or below the predetermined memory threshold value or implement a second mode of report generation algorithm to create the final intermediate file when it determined that the memory requirement for the intermediate contents exceed the predetermined memory threshold value; transmits the final intermediate file to a rendering engine; and generates a report based on the final intermediate file.