Abstract: Some embodiments provide a program that receives a first set of data and a first greenhouse gas emission value. The program stores, in a cache, the first set of data and the first greenhouse gas emission value. The program receives a second set of data and a second greenhouse gas emission value. The program stores, in the cache, the second set of data and the second greenhouse gas emission value. The program receives a third set of data and a third greenhouse gas emission value. The program determines one of the first and second sets of data to remove from the cache based on the first and second greenhouse gas emission values. The program replaces, in the cache, one of the first and second sets of data and the corresponding first or second greenhouse gas emission value with the third set of data and the third greenhouse gas emission value.

Abstract: A semiconductor device includes a memory partition. The semiconductor device further includes a plurality of registers. A first register of the plurality of registers, when in operation, controls an operation associated with the memory partition. The semiconductor device additionally includes a memory controller. When in operation, the memory controller accesses a first location of the memory partition concurrently with accessing the first register.

Abstract: Embodiments herein describe memories in a processor system in an integrated circuit (IC) that can be assigned to either a cache coherent domain or an I/O domain, rather than being statically assigned by a designer of the IC. That is, the user or customer can assign the memories to domain that best suits their desires. Further, the memories can be reassigned to a different domain if the user later changes her mind.

Abstract: Systems and methods are provided for efficient post-processing of object-based snapshots of block-storage volumes, which post-processing may include garbage collection, validation, or resource usage auditing for the snapshots. An object-based snapshot can be logically represented by a set of objects stored on an object storage service, which objects collectively represent a copy of the data of a corresponding block-storage volume at a given point in time. Each snapshot can further be represented by a full manifest that includes a full listing the set of objects representing the block-storage volume, and a differential manifest that includes a listing of objects unique to the snapshot relative to a prior snapshot of the same volume. Full manifests enable each snapshot to remain independently represented, while differential manifests enable efficient post-processing by reducing the amount of data retrieved and processed to identify an aggregate of all objects referenced across a group of snapshots.

Abstract: A computer-implemented method according to one embodiment includes receiving a request to perform a transaction in persistent memory at a first node; implementing the transaction within a volatile transaction cache at the first node; determining parity data for the transaction at the first node; sending the parity data from the first node to a parity node; and transferring results of the transaction from the volatile transaction cache to the persistent memory at the first node.

Abstract: A three-phase full quorum commit method enabling backing up of network devices that do not offer direct hooks in order to have application consistent protection. Devices are verified to be ready to perform a backup, and a condition of reaching and maintaining a full quorum of devices within a maximum time period is required before the system can be backed up. The three phase backup process reduces the chance of changes to network devices from corrupting consistency among the saved states of the different and disparate network devices. Multiple devices of different makes and models participate together as a unified backup as a network partition and all devices are verified as being in a ready state. The device configuration data is moved from device memory to local disk, and can then be tiered to secondary storage.

Abstract: Techniques disclosed herein provide improved techniques for generating backup copies associated with applications. For example, a method comprises managing synchronous generation of a backup copy of an application comprised of two or more application components respectively executed on two or more host devices, wherein each host device has a storage system associated therewith, by controlling the creation of a backup copy of each application component executed on each host device on its associated storage system within the same time period.

Abstract: A cloud-based data protection service is disclosed. In an embodiment, the data protection service may support backup of data sets from one or more sites associated with one or more organizations. In an embodiment, deduplication of backup data across multiple sites of an organization and/or multiple sites associated with different organizations may be supported. In an embodiment, backup data may be post-processed in the cloud to insert fingerprints corresponding to data blocks that did not change since a previous backup was performed, to scan the backup for security threats such as viruses, other malware, personally identifiable information, etc. In an embodiment, restore may be supported from the cloud, where restore blocks may be larger than backup data blocks. In another embodiment, restore may be based on blocks that have changed since the most recent backup (or a user-selected backup).

Abstract: Heterogeneous memory management and services. A memory metadata service obtains memory configuration information that identifies one or more sharable load-store memory segments available on each of a plurality of computing devices. The memory metadata service generates a memory metadata repository that comprises memory metadata that identifies, for each computing device of the plurality of computing devices, the one or more sharable load-store memory segments available on the computing device and, for each sharable load-store memory segment, a memory size of the sharable load-store memory segment and at least one memory attribute. The memory metadata service receives, from a first requesting computing device, a first memory allocation request that requests a first quantity of load-store memory. The memory metadata service sends, to the first requesting computing device, memory allocation information that identifies a first sharable load-store memory segment based on the memory metadata repository.

Abstract: Described is a system for synchronizing expiration times for incremental backup data stored on a cloud-based object storage. More particularly, the system may provide a layer of intelligence when updating the expiration times associated with backup data to ensure that a full recovery of the client data to a point-in-time of any incremental backup may be performed. To provide such a capability, the system may maintain specialized metadata identifying expiration times for objects and a list of objects required to perform a full recovery to a point-in-time for each of the performed backups (e.g. full or incremental). The system may access this metadata to identify which objects stored by a previous backup are still referenced by a subsequent backup. Based on the identified objects, the system may synchronize object expiration times to ensure objects are not prematurely deleted from the object storage.

Abstract: A computer-implemented method according to one embodiment includes receiving a request to withdraw a point-in-time snapshot copy operation being implemented by a data consistency application; in response to determining that the data consistency application is creating a current consistency group, maintaining the withdrawal request while allowing the creation of the current consistency group by the data consistency application; and in response to determining that the data consistency application is idle, preventing a formation of a new consistency group by the data consistency application during the withdrawal of the point-in-time snapshot copy operation.

Abstract: Embodiments for balancing cloud resource capacity for cross-node movement of files in a scaled out backup system, and for dynamically allocating cloud storage resources in a multi-node network having a file system. A process determines a destination node with dedicated cloud storage capable of storing a file selected for long term retention. It transfers the file to the cloud storage of the destination node while maintaining metadata of the file in the cloud tier local storage of the destination node, such as by using remote procedure calls between the destination and source nodes. It then updates a global namespace of the file system with a handle indicating a current location of the file as the cloud storage of the destination file, thus allowing access to the file through the metadata stored in the local storage of the source node.

Abstract: A memory array for storing odd and even data bits of data words in alternate sub-banks to reduce multi-bit error rate is disclosed. The memory array alternates odd data bits of a first plurality of data words in consecutive columns a first sub-bank of first and second memory banks and even data bits of the first plurality of data words in consecutive columns of a second sub-bank of the first and second memory banks. For example, the lowest bits of each of N data words are stored in a first N consecutive columns of a first sub-bank. The second bits of the N data words are stored in the next N consecutive columns of a second sub-bank. The N data bits in each of the bit positions of the N data words are interleaved in corresponding column mux sets. Alternating odd and even bits between sub-banks reduces multi-bit soft errors.

Abstract: In an embodiment, a local memory dedicated to one or more hardware accelerators in a system may include at least two portions: a volatile portion and a non-volatile portion. Data that is reused from iteration to iteration of the hardware accelerator (e.g. constants, instruction words, etc.) may be stored in the non-volatile portion. Data that varies from iteration to iteration may be stored in the volatile portion. Both the local memory and the hardware accelerators may be powered down between iterations, saving power. The non-volatile portion need only be initialized at a first iteration, allowing the amount of time that the hardware accelerators and the local memory are powered up to be lessened for subsequent iterations since the reused data need not be reloaded in the subsequent iterations.

Abstract: Systems, devices and methods are provided for operating a skewed-associative cache in a data processing system and, in particular, for changing address-to-row mappings in a skewed-associative cache.

Abstract: A method to prevent starvation of non-favored volumes in cache is disclosed. In one embodiment, such a method includes storing, in a cache of a storage system, non-favored storage elements and favored storage elements. A cache demotion algorithm is used to retain the favored storage elements in the cache longer than the non-favored storage elements. The method designates a maximum amount of storage space that the favored storage elements are permitted to consume in the cache. In preparation to free storage space in the cache, the method determines whether an amount of storage space consumed by the favored storage elements in the cache has reached the maximum amount. If so, the method frees storage space in the cache by demoting favored storage elements. If not, the method frees storage space in the cache in accordance with the cache demotion algorithm. A corresponding system and computer program product are also disclosed.

Abstract: Described are self-learning systems and methods for adaptive management of memory resources within a memory hierarchy. Memory allocations associated with different active functions are organized into blocks for placement in alternative levels in a memory hierarchy optimized for different metrics of e.g. cost and performance. A host processor monitors a performance metric of the active functions, such as the number of instructions per clock cycle, and reorganizes the function-specific blocks among the levels of the hierarchy. Over time, this process tends toward block organizations that improve the performance metric.

Abstract: An apparatus including a memory structure comprising non-volatile memory cells and a microcontroller. The microcontroller is configured to output Core Timing Control (CTC) signals that are used to control voltages applied in the memory structure. In one aspect, information from which the CTC signals may be generated is pre-computed and stored. This pre-computation may be performed in a power on phase of the memory system. When a request to perform a memory operation is received, the stored information may be accessed and used to generate the CTC signals to control the memory operation. Thus, considerable time and/or power is saved. Note that this time savings occurs each time the memory operation is performed. Also, power is saved due to not having to repeatedly perform the computation.

Abstract: Embodiments of the present disclosure provide a method of backup management, an electronic device and a computer program product. The method comprises: determining a plurality of candidate backup policies for a plurality of clients of a data backup system, determining an expected load balance degree with respect to time for the data backup system to perform data backups for the plurality of clients using the plurality of candidate backup policies, determining an actual load balance degree with respect to time for the data backup system while the data backup system is performing the data backups for the plurality of clients using a plurality of current backup policies, and selecting a plurality of backup policies to be used for the plurality of clients respectively, based on a comparison of the expected load balance degree and the actual load balance degree.