A method includes receiving a task for execution by a plurality of distributed storage and task execution units A priority level is determined for the task. A plurality of coordinated partial task requests are generated and sent to the plurality of distributed storage and task execution units, wherein the plurality coordinated partial task requests indicate a plurality of coordinated partial tasks and the priority level. A plurality of partial task results are received in response to performance of the plurality of coordinated partial tasks by the plurality of distributed storage and task execution units. A task result for the task is generated based on the plurality of partial task results.

A command from an application is received to access a data structure associated with one or more virtual addresses mapped to main memory. A first subset of the virtual addresses for the data structure having constituent addresses that are mapped to the symmetric memory components and a second subset of the virtual addresses for the data structure having constituent addresses that are mapped to the asymmetric memory components are identified. Data associated with the virtual address from the first physical addresses and data associated with the virtual addresses from the second physical addresses are accessed. The data associated with the symmetric and asymmetric memory components is accessed by the application without providing the application with an indication of whether the data is accessed within the symmetric memory component or the asymmetric memory component.

Attributing consumed storage capacity among entities storing data in a storage array includes: identifying a data object stored in the storage array and shared by a plurality of entities, where the data object occupies an amount of storage capacity of the storage array; and attributing to each entity a fractional portion of the amount of storage capacity occupied by the data object.

A placement device may reduce the cost for placing an object when a placement destination, in which an object is placed, changes due to the addition of a placement destination. A placement device may: determine, upon receiving object information assigned to an object, as the placement destination in which the object is placed from among one or more placement destinations each having an assigned set value, the placement destination added most recently and assigned a set value larger than a characteristic value derived uniquely based on the object information; and change, when a placement destination is added, based on an available capacity representing the amount of objects that can be newly placed in the placement destinations, the set value assigned to at least one of the placement destinations such that the determined placement destination does not change to a placement destination other than the placement destination added last.

Disk based emulation of tape libraries is provided with features that allow easier management and administration of a backup system and also allow increased flexibility to both archive data on tape at a remote location and also have fast restore access to archived data files. Features include automatic emulation of physical libraries, and the retention and write protection of virtual tapes that correspond to exported physical tapes.

The disclosure provides a data synchronization system, apparatus and method. A primary memory area is created at a destination end apparatus, and an incremental synchronization process is performed. A source end apparatus records a log for a write operation, including operation information and a sequence number for the operation. A latest destination-end write operation sequence number is recorded. The source end pushes in real-time write operation information corresponding to a source-end write operation sequence number greater than the latest destination-end sequence number to the destination end if a latest source-end write operation sequence number is greater than the latest destination-end sequence number. The destination end apparatus performs a write operation on the primary memory area according to the write operation information, records a write operation sequence number of the primary memory area and sends a latest write operation sequence number of the primary memory area to the source end apparatus.

A placement device may reduce the cost for placing an object when a placement destination, in which an object is placed, changes due to the addition of a placement destination. A placement device may: determine, upon receiving object information assigned to an object, as the placement destination in which the object is placed from among one or more placement destinations each having an assigned set value, the placement destination added most recently and assigned a set value larger than a characteristic value derived uniquely based on the object information; and change, when a placement destination is added, based on an available capacity representing the amount of objects that can be newly placed in the placement destinations, the set value assigned to at least one of the placement destinations such that the determined placement destination does not change to a placement destination other than the placement destination added last.

Systems, methods, and computer programs are disclosed for scheduling memory transactions. An embodiment of a method comprises determining future memory state data of a dynamic random access memory (DRAM) for a predetermined number of future clock cycles. The DRAM is electrically coupled to a system on chip (SoC). Based on the future memory state data, one of a plurality of pending memory transactions is selected that speculatively optimizes DRAM efficiency. The selected memory transaction is sent to a shared cache controller. If the selected memory transaction results in a cache miss, the selected memory transaction is sent to a DRAM controller.

A method, computer program product, and computing system for receiving a storage operation request for a logical storage object. A storage insurance value is associated with the logical storage object. The storage operation request is processed to associate a storage liability value with the storage operation request. Whether the storage operation request should be effectuated is determined based, at least in part, upon the storage liability value and the storage insurance value.

A method, storage control system and information handling system (IHS) enables efficient copying of a first directory containing a first plurality of files from a client to a target server. The method includes receiving, via a first processor of the client, a request to copy the first directory containing the first plurality of files from a first storage device to the target server. The first directory is parsed into a first i-node tree. Metadata corresponding to the first i-node tree is generated and transmit from the client to the target server. A second processor at the target server is triggered to generate a second directory based on the metadata corresponding to the first i-node tree. The first plurality of files contained in the first directory from the first storage device is transmitted to the target server.