Abstract: Each node in a clustered array is the owner of a set of zero logical disks (LDs). Thinly-provisioned VVs (TPVVs) are partitioned so each is mapped to a group of zero LDs from different sets of zero LDs. When there is a change in ownership, the affected zero LDs are switched one at a time so only a group of the TPVVs is affected each time.

Abstract: Recently, along with the increase in the importance of data protection, there are increasing demands for constructing a computer system capable of protecting data even when widespread disaster occurs. In order to reduce the risk of data loss even when widespread disaster occurs, the present invention computes the risk of data loss for each replication relationship of data (combination of storage subsystems storing the same data), and allocates data so that the risks of losing data of all replication relationships are optimized.

Abstract: A mechanism is provided for managing memory of a runtime environment executing on a virtual machine. A balloon agent that is part of a runtime environment is configured to coordinate inflations of a memory balloon within a heap of” the runtime environment and an out-of-heap overflow balloon, particularly in situations where a hypervisor needs to reclaim more memory from the runtime environment than the runtime environment is able to give up. The balloon agent may slowly free out-of-heap balloon memory, which may cause an increase of a target size for the balloon agent, which in turn inflates the memory balloon inside the heap of the runtime environment.

Abstract: Systems and techniques of the management of the allocation of a plurality of memory elements stored within a plurality of lockless list structures are presented. These lockless list structures (such as Slists) may be made accessible within an operating system environment of a multicore processor—and may be partitioned within the system. Memory elements may also be partitioned among these lockless list structures. When a core processor (or other processing element) makes a request for allocating a memory element to itself, the system and/or method may search among the lockless list structures for an available memory element. When a suitable and/or available memory element is found, the system may allocate the available memory element to requesting core processor. Dynamically balancing of memory elements may occur according to a suitable balancing metric, such as maintain substantial numerical equality of memory elements or avoid over-allocation of resources.

Abstract: A data transfer device that confirms completion of writing into a memory on transferring data to the memory via a bus through which a response indicating completion of data writing in the memory is not sent back includes an inter-memory data transfer control unit performing data transfer between the memories. When the inter-memory data transfer control unit detects switching of a write destination memory from a first memory to a second memory, in order to confirm that writing into the first memory is completed, the inter-memory data transfer control unit performs confirmation of write completion as to the first memory by a procedure different from writing into the memory.

Abstract: A device, comprising a single-ported first memory slice accessible only to a plurality of clients and including a plurality of blocks configured for storing information on behalf of the plurality of clients. The device further comprises a dual-ported second memory slice having a plurality of blocks for storing links and accessible to the plurality of clients and to a list manager that maintains a data structure for allocating memory blocks from the first memory slice and the second memory slice to the plurality of clients. In response to a client request, the list manager allocates a block of the first memory slice and a block of the second memory slice to the client, and stores a link for a next available memory block at the second memory slice.

Abstract: In one aspect, meta data corresponding to a non-volatile storage media is read from the non-volatile storage media. Meta data to be updated is detected from the read meta data. Based on the read meta data and the detected meta data to be updated, storage areas of the non-volatile storage media are invalidated.

Abstract: In a storage system 1, a storage apparatus A having a first pool 1430 including segments as unit storage areas and a storage apparatus B having a second pool 1430 having the same configuration are communicably connected to each other. In the storage system, an external volume identifier is associated with a logical volume 1420 included in the first pool 1430, the external volume identifier being used by a controller 1500 in the storage apparatus B to identify and manage the logical volume 1420 as an external volume 1425 that is a virtual volume in the storage apparatus B. Moreover, a volume identifier 5110 of the logical volume 1420 included in the first pool 1430 is rewritten into the external volume identifier in order to enable the storage apparatus B to utilize the logical volume 1420 created from the first pool 1430.

Abstract: In described embodiments, a multiple first-in, first-out buffer pointers (multi-FIFO pointers) alignment system includes synchronization circuitry to align multiple FIFO buffer operations. A FIFO read clock stoppage signal is generated by master logic that stops the read clock shared by all the transmit channels and then re-starts the read clock to align them. The FIFO read clock stoppage signal is applied to the read clock of all FIFOs which need to be aligned and, when rate change is needed, the FIFO read clock stoppage signal suspends the read clock, causing local write and read pointers to be reset. After the FIFO read clock stoppage signal is de-asserted, the read clock starts to all FIFOs concurrently, thereby aligning the channels.

Abstract: Speed of processing of transferring data stored in a storage apparatus to an external apparatus is increased. A storage apparatus according to the present invention: creates a non-decompression volume set to refer to a compression pool that compresses and stores data; decompresses and provides the data stored in the compression pool to a host computer; and provides the compressed data as is to other external apparatuses via the non-decompression volume.

Abstract: Described are techniques for enforcing an allocation policy. Information is received that describes one or more storage groups. Each of the storage groups includes one or more thin devices. Each of the thin devices includes a plurality of chunks of storage allocated on one or more of a plurality of storage tiers. For each of the one or more storage groups, a plurality of counters is determined indicating amounts of storage currently allocated from the plurality of storage tiers for use by the storage group. Using the plurality of counters, it is determined whether each of the one or more storage groups violates thresholds included in an allocation policy associated with each storage group. Each of the thresholds specifies a maximum amount of storage of one of the plurality of storage tiers that can be used by each storage group.

Abstract: A method of storing data in a flash memory data storage device that includes a plurality of memory chips is disclosed. The method includes determining a number of memory chips in the data storage device, defining, via a host coupled to the data storage device, a first partition of the data storage device, where the first partition includes a first subset of the plurality of memory chips and defining a second partition of the data storage device via a host coupled to the data storage device, where the second partition includes a second subset of the plurality of memory chips. First data is written to the first partition while reading data from the second partition, and first data is written to the second partition while reading data from the first partition.

Abstract: A computer system and reclamation control method capable of effectively utilizing storage resources of a storage system even under the circumstance where the storage system is operated according to thin provisioning and a file server can obtain snapshots. The present invention is designed so that if a block, to which a host does not refer, but reference from a snapshot remains, exists in a virtual volume of an operation volume, temporary data is written to this block; and as triggered by this writing, data before writing is saved to a difference volume, so that the reference from the snapshot to this block is released and then this block can be reclaimed.

Abstract: A storage control apparatus includes a first logical volume in which data has been stored in a pool that includes at least one of one or a plurality of logical volumes based on a plurality of physical storage devices as a pool volume, and divides the first logical volume into at least two real areas. The storage control apparatus allocates the first logical volume to a second logical volume that is a virtual logical volume that has been divided into at least two virtual areas. The storage control apparatus executes a first data movement processing for moving all data of the first logical volume to at least one pool volume other than the first logical volume, and allocates a real area of a movement destination of the data to a virtual area of an allocated destination of a real area of a movement source of the data as substitute for the real area in the first data movement processing.

Abstract: A dispersed storage managing unit allocates resources within a dispersed storage network by determining a state of a dispersed storage unit supporting a vault associated with at least one user of the dispersed storage network and provisioning storage within the dispersed storage unit based on the state thereof.

Abstract: This storage system supplies, to a plurality of computers, a plurality of duplicate volumes (CVOLs) (corresponding to duplicates of a master volume (MVOL) upon which is stored an electronic object (EO) that is common to the plurality of computers). Both the MVOL and the CVOLS are virtual logical volumes that follow sync provisioning. In the plurality of CVOLs, a plurality of physical regions that are allocated to the MVOL (i.e. regions in which the electronic object is stored) (PAs) are allocated. A storage, when writing an electronic module (EM) to which the EO is applied to the first CVOL, copies data within a first PA that is allocated to the virtual region (VA) that is the write destination to a second PA, writes the EM to the second PA, and moreover allocates the second PA to a VA of the write destination, instead of the first PA. And the storage allocates the second PA to a VA within the second CVOL corresponding to the VA of the write destination, instead of the PA that is allocated to that VA.

Abstract: The subject matter disclosed herein describes a method of allocating and persisting memory in an industrial controller without requiring a battery backup or a large capacitive storage system. Each data object is identified as static or dynamic. Static objects are further classified by whether frequent access of that data object is required. Each of the data objects is stored in non-volatile memory. The dynamic data objects and static data objects requiring frequent access are stored in volatile memory. A record of static data objects is maintained in non-volatile memory and a record of dynamic data objects is maintained in volatile memory. Upon power loss, the present value of each dynamic data object is copied to non-volatile memory. When power is restored, the values of both the dynamic data objects and the static data objects that require frequent access at run-time are copied from non-volatile memory to volatile memory.

Abstract: Methods and systems for thin provisioned storage. A storage array controller may materialize LUN extents, by filling extents with random data only as necessary at materialization time. Encryption software may recognize operation on a thin provisioned LUN having extents that are pre-filled and/or re-materialized on next use.

Abstract: Memory is dynamically switched through the optical-switching fabric using at least one communication pattern to transfer memory space in the memory blades from one processor to an alternative processor in the processor blades without physically copying data in the memory to the processors. Various communication patterns for the dynamically switching are supported.

Abstract: A dispersed storage network utilizes a virtual address space to store data. The dispersed storage network includes a processing unit operable to slice a data segment of a data object into data slices and create a slice name for each of the data slices. The slice name includes an identifier of the data object and a virtual memory address of a virtual memory associated with the dispersed storage network. The processing unit further outputs each of the data slices and the respective slice names to a corresponding storage unit for storage of the data slices therein.

Abstract: A memory system is provided. The system includes an operating system kernel that regulates read and write access to one or more FLASH memory devices that are employed for random access memory applications. A buffer component operates in conjunction with the kernel to regulate read and write access to the one or more FLASH devices.

Abstract: Disclosed is a method and apparatus for allowing a user to select, from a plurality of partitions on a memory device, which partitions may be visible to hosts connecting to the memory device.

Abstract: A dispersed storage device manages deletion of data objects stored within a dispersed storage network by receiving a data delete request to delete a data object stored throughout a set of dispersed storage units within a dispersed network memory of the dispersed storage network, determining a deletion policy for the data object and selectively generating and transmitting, based on the deletion policy, a delete command to the set of dispersed storage units.

Abstract: A method for reducing memory entries in a ternary content-addressable memory may include determining if a first entry and a second entry are associated with the same data value. The method may also include determining if the first entry can be masked such that searching the memory with the content value of either of the first entry or the second entry returns the same data value. The method may further include, in response to determining that the first entry and a second entry are associated with the same data value and determining that the first entry can be masked such that addressing the memory with the content value of either of the first entry or the second entry returns the same data value: (i) masking the first entry such that addressing the memory with the content value of either of the first entry or the second entry returns the same data value; and (ii) deleting the second entry.

Abstract: Multiple types of storage devices which have different performance are appropriately allocated to multiple virtual volumes in accordance with the performance requirements of the respective virtual volumes. In cases where, among virtual volumes 82 for which response times have been specified, there is a [virtual volume] that has a shortage of pages to which SSDs 70 should be allocated and that does not satisfy the performance requirement when its Tier boundary value ? is adjusted to Tier boundary value ?? and, if unallocated pages as the pages to which SSDs 70 should be allocated do not exist, Tier boundary value ? or Tier boundary value ? of another virtual volume is adjusted to Tier boundary value ?? or the Tier boundary value ??, and pages to which SSDs 70 are allocated are secured in the virtual volume 82 for which the Tier boundary value has been adjusted.

Abstract: Memory address resources requests are collected from devices on a bus. The requests are then sorted into descending order. For each resource request, a determination is then made as to whether the request is for a device that is behind a bridge. If the request is not for a device behind a bridge, the request is allocated. The request is also allocated if the request is for a device behind a bridge device and the request can be allocated without allocating padding. If a request is for a device behind a bridge and the request cannot be satisfied without using padding, then sufficient padding is allocated to properly align the request. An amount of padding may be allocated that satisfies the alignment requirement of the next resource request to be allocated. Requests for devices on the primary interface of the bridge device may also be satisfied from within the padding.

Abstract: A system and method for reducing power consumption of memory chips outside of a host processor device inoperative communication with the memory chips via a memory controller. The memory can operate in modes, such that via the memory controller, the stored data can be localized and moved at various granularities, among ranks established in the chips, to result in fewer operating ranks. Memory chips may then be turned on and off based on host memory access usage levels at each rank in the chip. Host memory access usage levels at each rank in the chip is tracked by performance counters established for association with each rank of a memory chip. Turning on and off of the memory chips is based on a mapping maintained between ranks and address locations corresponding to sub-sections within each rank receiving the host processor access requests.

Abstract: Techniques for updating a cached version of data in a computer system upon a change of the data as stored in a shared storage system networked to the computer system are described. In accordance with such techniques, a notification from the shared storage system is received at the computer system upon attempting to access the shared storage system. The computer system then determines that the notification occurred due to an unregistering of the computer system's access to the shared storage system by a second computer system that has updated the data stored in the shared storage system. As such, the computer system re-registers its access to the shared storage system and updates the cached version of the data with the data in the shared storage system that was updated by the second computer system.

Abstract: An apparatus includes an external interface port to connect to an external electronic device, where the external interface port is to communicate over a communications path with the external electronic device according to a serial communication protocol. The apparatus has a control device to hide details of the storage subsystem from the external electronic device. The control device is configured to perform at least one of (1) expanding a storage capacity of at least one logical storage volume of the storage subsystem, and (2) migrating a portion of data stored in the storage subsystem to a new physical storage device.

Abstract: A storage system and method are provided including physical storage devices controlled by storage control devices constituting a storage control layer operatively coupled to the physical storage devices and hosts. The storage control layer includes: a first virtual layer interfacing with the hosts, operable to represent a logical address space characterized by logical block addresses, characterized by an Internal Virtual Address Space (IVAS) and operable, responsive to I/O requests addressed to logical block addresses, to provide protocol-dependent translation of said logical block addresses into IVAS addresses; and a second virtual layer interfacing with the physical storage space, and operable to represent available physical space to said hosts and characterized by a Physical Virtual Address Space (PVAS). Each address in PVAS having a corresponding address in IVAS.

Abstract: In a compression and decompression system that performs data compression and decompression, the decompression of compressed data is performed in a way that a compression apparatus generates a byte code string as compressed data, and a decompression apparatus executes the byte code string. The byte code includes an 8-byte-unit copy instruction and direct data processing instruction, and the compression apparatus determines whether to use the 8-byte-unit copy instruction and direct data processing instruction or a byte-unit copy instruction and direct data processing instruction upon decompression, and generates the byte code.

Abstract: A system and method is provided for improving efficiency, power, and bandwidth consumption in parallel processing. Rather than using memory polling to ensure that enough space is available in memory locations for, for example, write instructions, the techniques disclosed herein provide a system and method to automate this evaluation mechanism in environments such as data-parallel processing to efficiently check available space in memory locations before instructions such as write threads are allowed. These operations are handled efficiently in hardware, but are flexible enough to be implemented in all manner of programming models.

Abstract: At least one of configuration information of a storage volume stored on a storage system and characteristics of a snapshot, including characteristics of one or more files stored in the snapshot, are identified. Snapshot content metadata, comprising the at least one of the identified characteristics and the configuration information, is created. The snapshot content metadata is associated with the snapshot.

Abstract: Memory system operations are extended for a data processor by an application programming interface API, including a set of operations and parameters for the operations, which provides for data compression and decompression during or in conjunction with processes for moving data between memory elements of the memory system. The set of operations can be configured to use the parameters and perform the operations of the API. The API can support moves between memory having a first access latency, such as memory integrated on the same chip as a processor core, and memory having a second access latency that is longer than the first access latency, such as memory on a different integrated circuit than the processor core.

Abstract: A memory space management method adapted to a rewritable non-volatile memory module having a plurality of physical blocks is provided. In the memory space management method, a first area and a second area are configured. An authentication information is received from a host system, and whether the authentication information matches a predetermined authentication information is determined. If the authentication information does not match the predetermined authentication information, a counting value is updated. If the counting value matches a predetermined number, a first procedure is executed. In the first procedure, a third area is configured, wherein the capacity of the third area is a sum of the capacity of the first area and at least a portion of the capacity of the second area. The third area is provided to the host system to be accessed. Thereby, the memory space of the rewritable non-volatile memory module is effectively used.

Abstract: A storage apparatus of an embodiment of the invention including one or more storage drives for providing real storage resources and a controller for controlling the one or more storage drives and accesses from a host computer. The controller initializes real storage resources and manages the initialized real storage resources. The controller receives an instruction for allocating an initialized real storage resource to a first virtual storage resource accessed by the host computer. In response to the instruction, the controller allocates a first initialized real storage resource which has been initialized in advance prior to the instruction to the first virtual storage resource.

Abstract: According to one embodiment, a memory management method implemented by a computer includes managing each block of a memory region included in the computer based on a buddy allocation algorithm. The method includes managing a correspondence relation between a virtual address and a physical address of one block using one entry of a page table. Each block has a size of a super page. The method includes allocating an empty first block to a process so that the number of empty blocks does not exceed the number of empty entries of a translation look-aside buffer (TLB).

Abstract: An information handling system (IHS) includes a memory controller, a memory device, and firmware. A failing memory region and a spare memory region are included on the memory device. A memory buffer in the memory device is coupled to the failing memory region and the spare memory region. The memory buffer is operable to perform copy operations without instruction from the memory controller in order to copy data from the failing memory region to the spare memory region in response to firmware operations performed by the firmware. Firmware operations may include instructing the memory controller to produce additional refresh or calibration operation time periods, or providing an instruction to perform a data transfer operation to the spare memory region. The memory buffer is also operable to route requests from the memory controller to one of the failing memory region and the spare memory region during the copy operations.

Abstract: Embodiments of the present invention provide a system, method, and program product for allocating a block of physical storage space on a write surface of a hard disk drive. A computer system maintains a write count for each block on the hard disk drive. After receiving an allocation request, the computer system identifies one or more candidate blocks of storage space on the hard disk drive that can be selected to fulfill the allocation request. The computer system determines an estimated write count and identifies one or more allocated blocks whose write counts are within a specified number of write operations of the estimated write count. The computer system selects a candidate block based, at least in part, on physical proximity of the candidate block to one or more of the allocated blocks whose write counts are within a specified number of write operations of the estimated write count.

Abstract: Embodiments of the present invention provide a system, method, and program product for defragmenting files on a hard disk drive. A computer system identifies a plurality of movable blocks on a hard disk drive. The computer system categorizes each of the movable blocks into a category based on the write count of each movable block, wherein the movable blocks categorized into a first category have higher write counts than the movable blocks categorized into a second category. The computer system relocates the movable blocks of the first category to a first group of one or more adjacent tracks, and the computer system relocates the movable blocks of the second category to a second group of one or more adjacent tracks, wherein the first group of one or more adjacent tracks and the second group of one or more adjacent tracks share, at most, one common track.

Abstract: A resource scheduler for managing a distribution of host physical memory (HPM) among a plurality of virtual machines (VMs) monitors usage by each of the VMs of respective guest physical memories (GPM) to determine how much of the HPM should be allocated to each of the VMs. On determining that an amount of HPM allocated to a source VM should be reallocated to a target VM, the scheduler sends allocation parameters to a balloon application executing in the source VM causing it to reserve and write a value to a guest virtual memory (GVM) location in the source VM. The scheduler identifies the HPM location that corresponds to the reserved GVM and allocates it to the target VM by mapping a guest physical memory location of the target VM to the HPM location.

Abstract: Disclosed is a method of reliably operating a RAID storage system. A first block of data is striped across a plurality of drives following a CRUSH algorithm. The first block of data is again striped across a second plurality of drives to a D?+P? stripe and placed on free drive space following the CRUSH algorithm. The data is written in an asynchronous fashion and possibly at a time when system utilization is low.

Abstract: In a method of implementing a graph storage system, the graph storage system is stored on a plurality of computing systems. A global address space is provided for distributed graph storage. The global address space is managed with graph allocators, in which a graph allocator allocates space from a block of the distributed global memory in order to store a plurality of graphs.

Abstract: A virtual logical unit that stores learning metadata is allocated in a first storage server having a first plurality of clusters, wherein the learning metadata indicates a type of storage device in which selected data of the first plurality of clusters of the first storage server are stored. A copy services command is received to copy the selected data from the first storage server to a second storage server having a second plurality of clusters. The virtual logical unit that stores the learning metadata is copied, from the first storage server to the second storage server, via the copy services command. Selected logical units corresponding to the selected data are copied from the first storage server to the second storage server, and the learning metadata is used to place the selected data in the type of storage device indicated by the learning metadata.

Abstract: A memory system is provided includes a host processor, and a plurality of cascade connected memory cards connected to the host processor. Each of the memory cards stores a same default relative card address (RCA) prior to initialization of the memory system. The host processor is configured to sequentially access each memory card using the default RCA, and to change the default RCA to a unique RCA upon each sequential access.

Abstract: A method to dynamically adjust the amount of free space in a storage group is disclosed herein. In certain embodiments, such a method may include monitoring the amount of free space in an active storage group. The method may further include maintaining an overflow storage group containing unused volumes. When the free space in the active storage group falls below a lower threshold value, the method may automatically move a volume from the overflow storage group to the active storage group. Conversely, when the free space in the active storage group exceeds an upper threshold value, the method may automatically transfer data from a volume in the active storage group to other volumes in the active storage group, and move the volume from the active storage group to the overflow storage group. A corresponding computer program product and apparatus are also disclosed herein.

Abstract: A storage system comprises storage devices providing logical volumes. The storage devices are divided into a plurality of types of tiers having different performance levels. A controller is operable to control to store data to a logical volume of the logical volumes. The controller is configured to receive a command commanding to copy data to deploy a template to a logical volume of the logical volumes or to back up data to a logical volume of the logical volumes. In response to the command, the controller is configured to allocate a storage area of a tier of the plurality of types of tiers to the logical volume. The tier of the storage area to allocate to the logical volume is determined based on whether the command received by the controller is to copy data to the template to the logical volume or to back up data to the logical volume.

Abstract: A storage monitoring system may reside between a file system and a storage system in a thin provisioned storage system. The storage monitoring system may create space holder files within a volume, where the space holder files contain an address space not backed up with physical storage. As requests for storage space are received from a file system, the storage monitoring system may allocate physical space to the volume by provisioning portions of the physical storage device to the volume and by removing one of the space holder files. The storage monitoring system may present alerts when physical storage space is low, as well as return an amount of physical space available to a volume size request.

Abstract: An apparatus, system, and method are disclosed for managing a non-volatile storage medium. A storage controller receives a message that identifies data that no longer needs to be retained on the non-volatile storage medium. The data may be identified using a logical identifier. The message may comprise a hint, directive, or other indication that the data has been erased and/or deleted. In response to the message, the storage controller records an indication that the contents of a physical storage location and/or physical address associated with the logical identifier do not need to be preserved on the non-volatile storage medium.

Abstract: A physical memory management scheme for handling page faults in a multi-core or many-core processor environment is disclosed. A plurality of memory allocators is provided. Each memory allocator may have a customizable allocation policy. A plurality of pagers is provided. Individual threads of execution are assigned a pager to handle page faults. A pager, in turn, is bound to a physical memory allocator. Load balancing may also be provided to distribute physical memory resources across allocators. Allocations may also be NUMA-aware.