Abstract: Mechanism designed to minimize copying of data from one memory tier to another. Data in a first memory location, is addressed based on its logical block address (LBA). When the data is copied into a second cache memory location, the LBA is updated to address the data at the second location. The first memory location is preserved intact. If the data is to be copied back to the first memory location, and the data has not changed since being copied into the second location, the LBA is updated to address the data at the first memory location, and no physical copying of the data from the second location to the first is performed.

Abstract: A method for managing the assignment of computing resources within a networked computing environment. The method includes a computer processor receiving, within the networked computing environment, a workload comprised of a plurality of objects that includes a first set of objects. The method further includes identifying a first embedded computing entity that is associated with the first set of objects. The method further includes deploying an instance of the first embedded computing entity to a first network accessible computing resource. The method further includes copying the first set of objects of the workload from one or more network accessible storage devices to the first network accessible computing resource that includes the deployed instance of the first embedded computing entity. The method further includes processing the workload based, at least in part, on executing the instance of the first embedded computing entity within the first network accessible computing resource.

Abstract: For a cache in which a plurality of frequently accessed data segments are temporarily stored, reference count information of the plurality of data segments, in conjunction with least recently used (LRU) information, is used to determine a length of time to retain the plurality of data segments in the cache according to a predetermined weight, where notwithstanding the LRU information, those of the plurality of data segments having a higher reference counts are retained longer than those having lower reference counts.

Abstract: Various embodiments for managing data stored in a tiered data storage environment, by a processor device, are provided. A data file is proactively migrated from a lower tier to a higher tier of the tiered data storage environment by using a multidimensional algorithm adopting an actual frequency of access of the data file to gauge a slope of a predicted frequency of access of the data file. The data file is migrated from the lower tier to the higher tier only if each of a plurality of criteria of the multidimensional algorithm is satisfied.

Abstract: Embodiments of the present invention provide methods, systems, and computer program products for using a storlet erasure code object storage architecture for image processing. In one embodiment, an object is received, the object being represented as erasure coded bits. A storage location associated with the erasure coded bits is identified. A virtual machine (VM) is invoked, where the VM is configured to compute a modification to the erasure coded bits and replace the original erasure coded bits with the modified erasure coded bits.

Abstract: Mechanism designed to minimize copying of data from one memory tier to another. Data in a first memory location, is addressed based on its logical block address (LBA). When the data is copied into a second cache memory location, the LBA is updated to address the data at the second location. The first memory location is preserved intact. If the data is to be copied back to the first memory location, and the data has not changed since being copied into the second location, the LBA is updated to address the data at the first memory location, and no physical copying of the data from the second location to the first is performed.

Abstract: A system and non-transitory computer program product for preserving data redundancy in a data deduplication system in a computing environment is provided. A selected data segment, to be written through the data deduplication system, is encrypted such that the selected data segment is not subject to a deduplication operation. Copies of the data segment that are to be precluded from data deduplication are determined and identified. A unique encryption key is used to encrypt the selected data segment to be written through the data deduplication system such that the selected data segment is not subject to a deduplication operation. The data deduplication system is tricked to recognize the encrypted, selected data segment as new, undeduplicated data by the encrypting thereby skipping steps of the deduplication operation that includes fingerprint generation and matching. The encrypted, selected data segment is directly written to a new physical storage location.

Abstract: Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. A write command is received for writing a selected data segment to a physical storage location. A determination is made as to whether the write command includes an indicator including at least one of a bit and a flag, the indicator designating that the selected data segment must not be subject to a deduplication operation. An indicator is configured by providing a system call with an extended attribute indicating that the selected data segment must be written to physical memory notwithstanding the selected data segment matching data written to the physical memory earlier in time.

Abstract: A mechanism is provided for optimizing object storage workflow. A category of a computational algorithm received from a user of a client device is identified, the category identifying a set of storage area network (SAN) features that are optimal for executing the computational algorithm. Features associated with a plurality of nodes in a plurality of infrastructures in an object storage architecture are searched for at least one node that has the set of features identified by the category of the computational algorithm. Responsive to identifying a node that has the set of features identified by the category of the computational algorithm, a determination is made as to whether resources associated with the node are immediately available. Responsive to the resources associated with the node being immediately available, the computational algorithm is issued to the node for execution.

Abstract: Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. In one embodiment, a method for such preservation is disclosed. An indicator is configured. The indicator is provided with a selected data segment to be written through the data deduplication system to designate that the selected data segment must not be subject to a deduplication operation, such that repetitive data can be written and stored on physical locations despite being identical.

Abstract: A method for preserving data redundancy in a data deduplication system in a computing environment is provided. A selected data segment, to be written through the data deduplication system, is encrypted such that the selected data segment is not subject to a deduplication operation. The method determines and identifies copies of the data segment that are to be precluded from data deduplication. A unique encryption key is used to encrypt the selected data segment to be written through the data deduplication system such that the selected data segment is not subject to a deduplication operation. The data deduplication system is tricked to recognize the encrypted, selected data segment as new, undeduplicated data by the encrypting thereby skipping steps of the deduplication operation that includes fingerprint generation and matching. The encrypted, selected data segment is directly written to a new physical storage location.

Abstract: A first request may be received to write a first set of data to a first storage device of a first storage node. The first storage device may be capable of transferring or receiving data directly to or from a second storage device without transferring the data to or from a host device mapped to the first storage node. It may be determined that a first token clash check does not need to occur for the first request. The first token clash check may include determining whether the first request is requesting to write to one or more addresses that are associated with one or more tokens owned by one or more transactions. The one or more tokens may be a proxy for a set of data within one or more particular address ranges of the first storage device.

Abstract: Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. An indicator is configured. The indicator is provided with a selected data segment to be written through the data deduplication system to designate that the selected data segment must not be subject to a deduplication operation, such that repetitive data can be written and stored on physical locations despite being identical.

Abstract: Various embodiments for preserving data redundancy of identical data in a data deduplication system in a computing environment are provided. In one embodiment, a method for such preservation is disclosed. A selected range of virtual addresses of a virtual storage device in the computing environment is designated as not subject to a deduplication operation. Other system and computer program product embodiments are disclosed and provide related advantages.

Abstract: For a cache in which a plurality of frequently accessed data segments are temporarily stored, reference count information of the plurality of data segments, in conjunction with least recently used (LRU) information, is used to determine a length of time to retain the plurality of data segments in the cache according to a predetermined weight, where notwithstanding the LRU information, those of the plurality of data segments having a higher reference counts are retained longer than those having lower reference counts.

Abstract: Mechanisms identify one or more first storage devices in a first tier of the tiered storage system that may be placed in a minimal power consumption state and identify one or more data segments stored on the one or more first storage devices that are most likely to be accessed during a period of time in which the one or more first storage devices are in the minimal power consumption state. The mechanisms migrate the one or more data segments to one or more second storage devices in one of the first tier or a second tier of the storage system and place the one or more first storage devices in the minimal power consumption state. Access requests to the one or more data segments are serviced by the one or more second storage devices while the one or more first storage devices are in the minimal power consumption state.

Abstract: For a cache in which a plurality of frequently accessed data segments are temporarily stored, reference count information of the plurality of data segments, in conjunction with least recently used (LRU) information, is used to determine a length of time to retain the plurality of data segments in the cache according to a predetermined weight, where notwithstanding the LRU information, those of the plurality of data segments having a higher reference counts are retained longer than those having lower reference counts.

Abstract: A computing system includes a computer in communication with a tiered storage system. The computing system identifies a set of data transferring to a storage tier within the storage system. The computing system identifies a program to which the data set is allocated and determines to increase or reduce resources of the computer allocated to the program, based on the set of data transferring to the storage tier. The computing system discontinues transferring the set of data to the storage tier if a resource allocated to the program cannot be increased.

Abstract: A method for preserving data availability and I/O performance when creating a virtual RAID volume includes exposing a set of backend virtual volumes. The backend virtual volumes are implemented on a set of physical storage devices (e.g., physical disks or solid state drives) residing on a storage system. The method further enables selection of the set of backend virtual volumes to create a virtual RAID volume having a selected RAID level. The method further provides verification that the backend virtual volumes will be implemented on the physical storage devices in a way that preserves the data availability and I/O performance associated with the selected RAID level.

Abstract: In one embodiment, a method includes receiving a request to duplicate at least a portion of a volume stored on a first storage array managed by a storage controller, creating at least one dependent volume on the first storage array using the storage controller, duplicating the at least the portion of the volume to the at least one dependent volume on the first storage array to create a snapshot. The creation of the snapshot is performed entirely on the first storage array.