Abstract: An efficient structure and methodology for container-based applications are provided for disaster recovery for data in a storage system using application consistency groups for replication from the storage system to a disaster recovery system. Application consistency groups can be generated containing applications, a disaster recovery plan, and a disaster recovery policy, where each application has a consistency level. The applications in an application consistency group can include stateless applications and stateful applications. The replication of an application consistency group from the system to a disaster recovery storage system can be controlled according to the disaster recovery policy, the disaster recovery plan, and the consistency levels of the application consistency group.

Abstract: A heating assembly includes: a liquid guiding element; and a heating element arranged on a vaporization surface formed by the liquid guiding element, the heating element being energizable to generate heat. The heating element includes a first heating part and a second heating part. A temperature coefficient of resistance of the first heating part is greater than a temperature coefficient of resistance of the second heating part. The first heating part and the second heating part form an electrical connection structure.

Abstract: A multifunctional mixed oxide electrocatalyst material including a metal oxide A with oxygen storage capacity and a metal oxide B with oxygen evolution reaction is prepared by two-steps hydrothermal reactions. The electrocatalyst material is a good free radical scavenger, oxygen evolution reagent and able to alleviate carbon monoxide poisoning on catalyst, when it is applied in a membrane electrode assembly for fuel cells.

Abstract: An interconnected computer system includes a Peripheral Component Interconnect Express (PCIe) fabric, a first computer system communicatively coupled to the PCIe fabric, a second computer system communicatively coupled to the PCIe fabric, and a shared single-access hardware resource coupled to the PCIe fabric. The first computer system includes a first processor and first memory coupled to the first processor configured to store a first flag indicating a desire of the first computer system to access the shared single-access hardware resource and a turn variable indicating which of the first computer system and the second computer system has access to the shared single-access hardware resource. The second computer system includes a second processor and second memory coupled to the second processor configured to store a second flag indicating a desire of the second computer system to access the shared single-access hardware resource.

Abstract: A clustered storage system includes a plurality of storage devices, each of which contributes a portion of its memory to form a global cache of the clustered storage system that is accessible by the plurality of storage devices. Cache metadata for accessing the global cache may be organized in a multi-layered structure. In one embodiment, multi-layered structure has a first layer first including a first address array, and the first address array include addresses pointing to a plurality of second address arrays in a second layer. Each second address array in the second layer includes addresses, each of which points to data that has been cached in the global cache.

Abstract: In some implementations, a storage node receives data processing instructions from a compute node of a network architecture. The storage node detects a Directed Acyclic Graph (DAG) within the data processing instructions. The DAG includes a plurality of data processing operations arranged within the DAG according to an execution. The data processing operations further include user-defined function (UDF) information associated with a UDF. The storage node may retrieve a first data object from an object store of the distributed storage node based on object keys information within the plurality of data processing operations. The storage node may execute the plurality of data processing operations using the retrieved first data object to generate a DAG execution result, the executing of the plurality of data processing operations based on the execution order. The storage node may communicate the DAG execution result to the compute node in response to the data processing instructions.

Abstract: A computer implemented method comprises accessing data stored in memory of the computer system, wherein the memory includes a faster access storage medium and a slower access storage medium; determining respective exponential moving averages of a number of access operations performed on respective memory locations of the memory; and transferring a portion of the data into the faster access storage medium and transferring a portion of the data into the slower access storage medium according to the determined exponential moving average.

Abstract: A computer-implemented method for on-demand data replication in a network architecture includes activating an on-demand program to pair a network-based replication agent with a data source. Compute resources for the replication agent are allocated based on one or more hints received from the data source. The one or more hints are indicative of at least a size of an upcoming data traffic transmission from the data source. Upon receiving data from the data traffic transmission, the replication agent is activated via the on-demand program to replicate the received data using the allocated replication resources. The allocated compute resources are released upon completion of data replication of the received data. The on-demand program is a serverless function configured to activate the replication agent on-demand, upon receiving the data from the data traffic transmission.

Abstract: A clustered storage system includes a plurality of storage devices, each of which contributes a portion of its memory to form a global cache of the clustered storage system that is accessible by the plurality of storage devices. Cache metadata for accessing the global cache may be organized in a multi-layered structure. In one embodiment, multi-layered structure has a first layer first including a first address array, and the first address array include addresses pointing to a plurality of second address arrays in a second layer. Each second address array in the second layer includes addresses, each of which points to data that has been cached in the global cache.

Abstract: An interconnected computer system includes a Peripheral Component Interconnect Express (PCIe) fabric, a first computer system communicatively coupled to the PCIe fabric, a second computer system communicatively coupled to the PCIe fabric, and a shared single-access hardware resource coupled to the PCIe fabric. The first computer system includes a first processor and first memory coupled to the first processor configured to store a first flag indicating a desire of the first computer system to access the shared single-access hardware resource and a turn variable indicating which of the first computer system and the second computer system has access to the shared single-access hardware resource. The second computer system includes a second processor and second memory coupled to the second processor configured to store a second flag indicating a desire of the second computer system to access the shared single-access hardware resource.

Abstract: A computer-implemented method for on-demand data replication in a network architecture includes activating an on-demand program to pair a network-based replication agent with a data source. Compute resources for the replication agent are allocated based on one or more hints received from the data source. The one or more hints are indicative of at least a size of an upcoming data traffic transmission from the data source. Upon receiving data from the data traffic transmission, the replication agent is activated via the on-demand program to replicate the received data using the allocated replication resources. The allocated compute resources are released upon completion of data replication of the received data. The on-demand program is a serverless function configured to activate the replication agent on-demand, upon receiving the data from the data traffic transmission.

Abstract: Described are techniques for processing requests at a data storage system. A request is received from a client to perform an operation with respect to a first data portion stored on physical storage devices of the data storage system. The first data portion is exposed through a set of at least two data nodes each accessing a same copy of the first data portion stored on the physical storage devices. The request is received at a first of the data nodes of the set. The request is processed with respect to the first data portion using the same copy accessible to each of data nodes of the set. The physical storage devices may be configured in a RAID group and the data nodes, optionally along with a name node providing metadata, may be embedded in the data storage system and execute in a virtualized environment.

Abstract: In a system in which a plurality of computing elements share a cache, each computing element owns a stripe of the cache. Each stripe contains cache objects that are accessible to all computing elements but managed only by the owning computing element. Each computing element maintains an LRU FIFO queue in local memory for the cache objects owned by that computing element. Each computing element also maintains a separate hash table in local memory for each other computing element. The hash tables indicate access to cache objects that are owned by those other computing elements. Each computing element updates its LRU FIFO queue when it accesses cache objects that it owns. The hash tables are periodically distributed by all computing elements via RDMA so that the LRU FIFO queues of all computing elements can be updated based on accesses to owned cache objects by other non-owner computing elements.

Abstract: Described are techniques for performing caching. Write operations of a single transactions are received. Write data of the write operations is cached in one or more cache pages of a first cache of a first storage processor. State information is set for the one or more cache pages of the first cache from an invalid state to a prepared state. The write data of the write operations is also stored in a second cache of a second storage processor. A transaction commit state for the single transaction is set indicating that transaction commitment processing for the first cache has commenced and is pending. State information of the one or more cache pages of the first cache is set from the prepared state to a dirty state. The transaction commit state for the single transaction is updated to indicate that the transaction commitment processing for the first cache is completed.

Abstract: Global memory of a storage system may be used to provide NVRAM capabilities to guest operating systems accessing the storage system. The non-volatility of NVRAM (i.e. that retains its information when power is turned off) provides that an NVRAM device provided by global memory may be used as a journaling device to track storage operations and facilitate recovery and/or failover processing in a storage system without needing to add additional hardware and/or other installed devices. Use of the global memory according to the system described herein to provide an NVRAM device, that may function as a journaling device, provides for the speeding up of transactions, thereby improving metadata intensive operations performance and reducing recovery time and/or failover time of a storage system without adding additional hardware support.

Abstract: When a guest OS loads within the context of a container provided by the host OS, the guest OS uses PCI or other protocol to specify a virtual hardware device. The guest OS enumerates the virtual hardware device to establish the size for the BARs and establish its view of physical addresses for the memory locations. A server running in the context of the container receives read/write requests from the guest OS, maps the read/write requests to host OS physical address space, and posts responses to the virtual hardware device. Since the guest OS executes memory related operations using its own memory space, exits to the container code are not required to implement storage related actions by the Guest OS. This allows performance of an application executing in the context of the guest OS to approximate performance of an application executing in the context of the host OS.

Abstract: Methods and apparatus for organizing a plurality of versions of a file in a file system. The plurality of versions of the file are stored in a data structure having a hierarchical organization that reflects relationships among the plurality of versions. Each version of the plurality of versions is assigned a name that identifies its position in the hierarchical organization. The hierarchical organization of the data structure and the descriptive naming convention used for the plurality of versions in the data structure facilitates deleting a version while retaining other versions derived from the version following the deletion of the version, and enables a staged initialization of the data structure upon system start-up.

Abstract: In a file server, a file system is built upon a volume of data storage. The file system includes multiple cylinder groups. Each cylinder group includes file system blocks. The file system blocks include allocated blocks and free blocks. The volume includes slices of storage, and each slice stores at least one of the cylinder groups. A hierarchical slice map has a top level that includes a count of free blocks in the file system, an upper level that includes a count of free blocks in groups of the slices, an intermediate level that includes a count of the free blocks in sub-groups of the slices, and a bottom level that includes a count of the free blocks in each slice of storage. To find a free block for allocation to a file, the slice map hierarchy is searched in a top-down fashion.

Abstract: A method is used in determining alternate paths in faulted systems. It is detected that a first processor has a problem accessing a target. The first processor has a first path to the target. An alternate path to the target is determined by identifying that a second processor has better access to the target than the first processor. The second processor has a second path to the target. Responsibility for I/O communication with the target is transferred from the first processor to the second processor. Responsibility for I/O communication with the target is transferred back to the first processor upon resolution of the problem.

Abstract: Embodiments of the invention relate to maintaining reference counts in a file system to track when a block is available to be freed. When a snapshot copy of a file is created, rather than copying all the blocks of the file for the snapshot copy, the snapshot inode is given pointers to the blocks of the file. Rather than updating the reference counts for all these blocks to indicate that they are now in use by more than one file, the update of reference counts for at least some of these blocks may be deferred until a later time.