Abstract: A storage device includes: a temporary buffer for sequentially storing data configuring a file requested to be written for every reception from outside; a data writing means for immediately separating the data in the temporary buffer into mutually corresponding data portion and marker portion classified by preset criteria and storing into a data storing means in an associated state, and deleting from the temporary buffer; an unseparated data writing means for storing the data that cannot be separated into the data portion and the marker portion among the data in the temporary buffer, into an unseparated data storing means; and a re-separation processing means for separating the data in the unseparated data storing means into the data portion and the marker portion by preset criteria and storing into the data storing means with the data portion and the marker portion associated, and deleting from the unseparated data storing means.

Abstract: Embodiments of the invention relate to optimizing a file system for different types of applications in a compute cluster using dynamic block size granularity. An exemplary embodiment includes reserving a predetermined number of storage allocation regions for each node in a cluster, wherein each storage allocation region comprises a set of contiguous data blocks on a single storage disk of locally attached storage; using a contiguous set of data blocks on a single storage disk of locally attached storage as a file system's block allocation granularity for striping data to be stored in the file system for a compute operation in the cluster; and using a single data block of a shared storage subsystem as the file system's block allocation granularity for striping data to be stored in the file system for a data access operation in the cluster.

Abstract: A hybrid computing environment in which the host computer allocates, in the shadow memory area of the host computer, a memory region for a packet to be written to the shared memory of an accelerator; writes packet data to the accelerator's shared memory in a memory region corresponding to the allocated memory region; inserts, in a next available element of the accelerator's descriptor array, a descriptor identifying the written packet data; increments the copy of the head pointer of the accelerator's descriptor array maintained on the host computer; and updates a copy of the head pointer of the accelerator's descriptor array maintained on the accelerator with the incremented copy.

Abstract: A storage system is configured to manage a pool to which multiple virtual volumes (VVOLs) are associated, assign a real area (RA) from any tier in an available tier pattern associated with a write-destination VVOL to a write-destination virtual area (VA), and carry out a reassignment process for migrating data inside the RA to an RA of a different tier, based on an access status of the RA. A management system is configured to assume a specified tier has been removed from the available tier pattern of a target VVOL, predict performance of all VVOLs associated with the pool to which the target VVOL is associated, determine whether there is a VVOL for which predicted performance is lower than a required performance, and when such a VVOL does not exist, instruct the storage system to remove the specified tier from the available tier pattern of the target VVOL.

Abstract: A method and system for self-sizing dynamic cache for virtualized environments is disclosed. The preferred embodiment self sizes unequal portions of the total amount of cache and allocates to a plurality of active virtualized machines (VM) according to VM requirements and administrative standards. As a new VM may emerge and request an amount of cache, the cache controller reclaims currently used cache from the active VM and reallocates the unequal portions of cache required by each VM. To ensure cache availability, a quick reclamation amount of cache is immediately available to each new VM as it makes the request begins operation. After reallocation, the newly created VM may rely on a guaranteed minimum quota of cache to ensure performance.

Abstract: In accordance with the present disclosure, a system and method for performing a system memory save in tiered or cached storage during transition to a decreased power state is disclosed. As disclosed herein, the system incorporating aspects of the present invention may include a flash or other nonvolatile memory such as a solid-state drive, volatile memory, and at least one alternate storage media. Upon transition to a decreased power state, at least some of the data in the solid-state drive, for example, may be transferred to the at least one alternate storage media. After the SSD data is transferred, data stored in volatile system memory, such as a system context, may be transferred to the SSD memory. With the system context saved in SSD memory, power to the volatile system memory may be turned off.

Abstract: Systems and computer program products are provided for optimizing selection of files for deletion from one or more data storage devices to free up a predetermined amount of space in the one or more data storage devices. A method includes analyzing an effective space occupied by each file of a plurality of files in the one or more data storage devices, identifying, from the plurality of files, one or more data blocks making up a file to free up the predetermined amount of space based on the analysis of the effective space of each file of the plurality of files, selecting one or more of the plurality of files as one or more candidate files for deletion, based on the identified one or more data blocks, and deleting the one or more candidate files for deletion from the one or more data storage devices.

Abstract: An approach to efficient space reclamation in multi-layered thinly provisioned systems. A parent storage volume is thinly provisioned, and uses one or more child storage volumes that are also thinly provisioned for storage. A reclamation command sent to the device providing the parent thinly provisioned storage volume identifies that data has been released, and that the physical storage storing that data can be placed in a free pool and used to satisfy future write requests in the parent storage volume. An identify module identifies which child storage volumes supporting the parent storage volume are thinly provisioned. The data is released at the level of the parent storage volume, and the reclamation command is sent to the child storage volumes supporting the parent storage volume and that are themselves thinly provisioned. The storage is thus released by all affected thinly provisioned storage volumes, and not just the parent storage volume that received the reclamation command.

Abstract: A storage system stores data in at least one partition of a physical storage media in accordance with file system information specifying a plurality of logical blocks having logical block addresses within the partition. The logical blocks include excess logical blocks that are not mapped to space in the physical storage media by the mapping employed by the storage system. Unusable block data marks those excess logical blocks as unusable. This makes it easy to adjust the data storage capacity of the storage system by changing the mapping to map more or less logical block addresses to space in the physical storage media and thereby destroy or create excess logical blocks, and by changing the unusable block data to correspondingly change the excess logical blocks marked as unusable.

Abstract: Systems and computer program products are provided for optimizing selection of files for eviction from a first storage pool to free up a predetermined amount of space in the first storage pool. A method includes analyzing an effective space occupied by each file of a plurality of files in the first storage pool, identifying, from the plurality of files, one or more data blocks making up a file to free up the predetermined amount of space based on the analysis of the effective space of each file of the plurality of files, selecting one or more of the plurality of files as one or more candidate files for eviction, based on the identified one or more data blocks, and evicting the one or more candidate files for eviction from the first storage pool to a second storage pool.

Abstract: In one embodiment, the present invention includes a memory management unit (MMU) having entries to store virtual address to physical address translations, where each entry includes a location indicator to indicate whether a memory location for the corresponding entry is present in a local or remote memory. In this way, a common virtual memory space can be shared between the two memories, which may be separated by one or more non-coherent links. Other embodiments are described and claimed.

Abstract: A data storage device includes a non-volatile memory that includes a three-dimensional (3D) memory. A controller of the data storage device is configured to store a first sequence of addresses based on a first sequence of read instructions received from a host device. Subsequent to storing the first sequence of addresses, the controller is configured to receive a second sequence of read instructions from the host device and to determine whether a second sequence of addresses that is based on the second sequence of read instructions matches the first sequence of addresses. The controller is configured to relocate at least one page of the non-volatile memory at least partially based on the second sequence of addresses matching the first sequence of addresses.

Abstract: Methods, systems, and computer program products are provided for optimizing selection of files for deletion from one or more data storage devices to free up a predetermined amount of space in the one or more data storage devices. A method includes analyzing an effective space occupied by each file of a plurality of files in the one or more data storage devices, identifying, from the plurality of files, one or more data blocks making up a file to free up the predetermined amount of space based on the analysis of the effective space of each file of the plurality of files, selecting one or more of the plurality of files as one or more candidate files for deletion, based on the identified one or more data blocks, and deleting the one or more candidate files for deletion from the one or more data storage devices.

Abstract: A device requiring address allocation, a device system, and an address allocation method. A control device in the device system transmits currently allocated address information and a contention start signal to each device requiring address allocation in the device system through a bus, and the devices requiring address allocation with address allocation flag information being that no address information is allocated output an address contention signal. When outputting the address contention signal, each device requiring address allocation determines whether the currently allocated address information is available according to whether the other devices requiring address allocation with address allocation flag information being that no address information is allocated already output address contention signals.

Abstract: Methods, systems, and computer program products are provided for optimizing selection of files for eviction from a first storage pool to free up a predetermined amount of space in the first storage pool. A method includes analyzing an effective space occupied by each file of a plurality of files in the first storage pool, identifying, from the plurality of files, one or more data blocks making up a file to free up the predetermined amount of space based on the analysis of the effective space of each file of the plurality of files, selecting one or more of the plurality of files as one or more candidate files for eviction, based on the identified one or more data blocks, and evicting the one or more candidate files for eviction from the first storage pool to a second storage pool.

Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for managing free chains of compute resources. A system configured to practice the method divides a free chain of compute resources into a usable part (UP) which contains resources available for immediate allocation and an unusable part (UUP) which contains resources not available for immediate allocation but which become available after a certain minimum number of allocations. The system sorts resources in the UP by block number, and maintains a last used object (LUO) vector, indexed by block number, which records a last object in the UP for each block. Each time the system frees a resource, the system adds the freed resource to a tail of the UUP and promotes an oldest resource in the UUP to the UP. This approach can manage free chains in a manner that is both flaw tolerant and has relatively high performance.

Abstract: A constrained computing device is provided. The constrained computing device includes a memory, a processor coupled to the memory, and a journaling component executed by the processor in kernel mode. The journaling component is configured to receive information descriptive of a device control, allocate, in the memory, a variable record structured according to a variable definition associated with the device control, store the information within the variable record, receive updated information descriptive of the device control, allocate, in the memory, an update record structured according to an update variable definition, store the updated information within the update record, and link the variable record to the update record.

Abstract: A predetermined number of erasable blocks positioned at a start of a volume area in a semiconductor memory card are provided so as to include volume management information. A user area following the volume management information includes a plurality of clusters. A size of a partition control area from a master boot record & partition table sector to a partition boot sector is determined so that the plurality of clusters in the user area are not arranged so as to straddle erasable block boundaries. Since cluster boundaries and erasable block boundaries in the user area are aligned, there is no need to perform wasteful processing in which two erasable blocks are erased to rewrite one cluster.

Abstract: A method or system for determining storage location of an isolation region based on a data region sizing specified by a host device. In one implementation, the isolation region comprises a set of storage locations required for isolation of or more data region of the storage device.

Abstract: A method is used in iterating in parallel for deduplication. Based on an iteration scheme, a collection of sections is selected from a set of storage extents. Each section of the collection of sections includes subset of the contents of a storage extent of the set of storage extents. Based on the iteration scheme, each section of the collection of sections is arranged in an ordered arrangement. Based on the ordered arrangement, a deduplicating technique is applied in parallel to each section of the collection of sections.

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: It is provided a memory management method for releasing an unnecessary area in a memory area used by a program stored in the memory and executed by the computing device. The memory management method including the step of: setting in the memory, a first memory area which is used to execute the program; setting in the memory, a second memory area which can be operated by the program; setting a utilized area in the second memory area based on an instruction from the program; storing objects including data in the utilized area of the second memory area based on an instruction from the program; determining whether the program uses the objects stored in the utilized area within the second memory area; and releasing, by the computing device, the utilized area occupied by an object that is not used by the program among the objects stored in the utilized area.

Abstract: A memory stores first configuration information indicating a plurality of logical storage areas and a first condition defining a state of a storage apparatus as a trigger for the storage apparatus to move data. A CPU acquires: a second condition defining a state of a computer as a trigger for the computer to move a first object, which is stored in a first logical storage area among the plurality of logical storage areas and performed by the computer, to another one of the plurality of logical storage areas; second configuration information associating the first object and the first logical storage area; first state information indicating a state of the plurality of logical storage areas; and second state information indicating a state of the first object. If a state of performing data movement is set, the CPU identifies a cause of the state of performing the data movement.

Abstract: Cache lines are identified that provide incorrect data for read requests. The cache lines are invalidated before the incorrect data causes processing failure conditions. The cache lines providing incorrect data may be detected according to a number of the same read requests to the same cache lines. The cache lines may also be identified according to an amount of time between the same read requests to the same cache lines. The same read requests to the same cache lines may be identified according to associated start addresses and address lengths.

Abstract: An exemplary computer system includes a server module including a first processor and first memory, a storage module including a second processor, a second memory and a storage device, and a transfer module. The transfer module retrieves a first transfer list including an address of a first storage area, which is set on the first memory for a read command, from the server module. The transfer module retrieves a second transfer list including an address of a second storage area in the second memory, in which data corresponding to the read command read from the storage device is stored temporarily, from the storage module. The transfer module sends the data corresponding to the read command in the second storage area to the first storage area by controlling the data transfer between the second storage area and the first storage area based on the first and second transfer lists.

Abstract: A method according to one embodiment includes determining to move an extent from a source-tier in a storage system to a destination-tier in the storage system; determining whether any track from the set of tracks is presently being written to; designating to a write-stack associated with the source-tier each track that is presently being written to and designating to a read-stack associated with the source-tier remaining tracks from the set of tracks; removing oldest tracks from the read-stack and the write-stack until the read-stack and the write-stack have been depleted of tracks; when a parameter of the extent exceeds a migration threshold: populating a destination-tier cache with the tracks as they are removed from the read-stack and the write-stack using a predetermined read-to-write ratio and removing tracks from a source-tier cache that were removed from the read-stack and the write-stack; and migrating the extent from the source-tier to the destination-tier.

Abstract: Method and apparatus for centralized timestamp processing is described herein. A graphics processing system includes multiple graphics engines and a timestamp module. For each task, a graphics driver assigns the task to a graphics engine and writes a task command packet to a memory buffer associated with the graphics engine. The graphics driver also writes a timestamp command packet for each task to a timestamp module memory buffer. A command processor associated with the graphics engine signals the timestamp module memory buffer upon completion of the task. If the read pointer is at the appropriate position in the timestamp module memory buffer, the timestamp module/timestamp module memory buffer executes the timestamp command packet and writes the timestamp to a timestamp memory. The timestamp memory is accessible by the graphics driver.

Abstract: A method, and corresponding apparatus, of managing processing thread migrations within a plurality of memory clusters, includes embedding, in memory components of the plurality of memory clusters, instructions indicative of processing thread migrations; storing, in one or more memory components of a particular memory cluster among the plurality of memory clusters, data configured to designate the particular memory cluster as a sink memory cluster, the sink memory cluster preventing an incoming migrated processing thread from migrating out of the sink memory cluster; and processing one or more processing threads, in one or more of the plurality of memory clusters, in accordance with at least one of the embedded migration instructions and the data stored in the one or more memory components of the sink memory cluster.

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 first storage system copies data of a virtual area of a first virtual volume to a virtual area of a second virtual volume of a second storage system, monitors accesses with respect to multiple virtual areas of the first virtual volume, updates access information related to the accesses of the multiple virtual areas, and, based on the access information, reallocates data inside an actual area of a first pool allocated to the virtual area of the first virtual volume. The first storage system sends the access information to the second storage system. The second storage system receives the access information, and, based on the access information, reallocates data inside the actual area allocated to a virtual area of the second virtual volume.

Abstract: A system includes storage devices for storing content along with two or more computing devices such as a two or more servers. One of the computing devices includes a staging memory that stores content that is received from the storage devices. The computing device also includes a user memory that is assigned to a user and stores content transferred from the staging memory. The user memory is accessible by the user while the staging memory is inaccessible by the user. The system also includes another computing device that has a content manager that initiates transferring of content from the storage devices to the staging memory and transferring content from the staging memory to the user memory for electronic publication of the content.

Abstract: A method of setting up a redistribution scheme for redistributing digital data packages within a digital data storage system comprising a plurality of nodes, wherein the data packages are associated with respective keys and are distributed among the nodes according to a first distribution configuration within the digital data storage system. The method includes: determining a second distribution configuration, in accordance with which it is intended to redistribute the data packages; applying a migration function to the respective keys of each of the data packages, which function yields a migration value associated with each of the data packages; and assigning a migration time to each of the data packages based on its associated migration value, at which times it is intended to migrate the respective data packages to conformity with the second distribution configuration. A corresponding digital data storage system is described.

Abstract: A method includes storing a first transaction entry to a first software configurable storage location, storing a second transaction entry to a second software configurable storage location, determining that a first transaction indicated by the first transaction entry has occurred, determining that a second transaction indicated by the second transaction entry has occurred subsequent to the first transaction, and, in response to determining that the first transaction occurred and the second transaction occurred, storing at least one transaction attribute captured during at least one clock cycle subsequent to the second transaction. The first and second software configurable storage locations may be located in a trace buffer, where the at least one transaction attribute is stored to the trace buffer and overwrites the first and second transaction attributes. Each transaction entry may include a dead cycle field, a consecutive transaction requirement field, and a last entry field.

Abstract: A method of moving a first portion of data and a second portion of data, which belong to one page data and respectively stored in a second physical page and a third physical page, into a first physical page in a flash memory module is provided. The method includes transmitting a read command for reading page data stored in the second physical page; reading the first portion of data from a buffer area of the rewritable non-volatile memory module into a buffer memory; transmitting a read command for reading page data stored in the third physical page; transmitting the first portion of data from the buffer memory to the buffer area; and transmitting a write command for writing data stored in the buffer area into the first physical page. Accordingly, the method can effectively move one page data dispersedly stored in different physical pages into one physical page.

Abstract: A solution for managing a software image being stored in a plurality of physical blocks of a storage system comprises monitoring each access to the physical blocks, calculating a predicted sequence of access to the physical blocks according to the monitored accesses, and reorganizing the physical blocks according to the predicted sequence. The monitoring may be performed as the physical blocks are accessed during the booting of virtual images on the software image.

Abstract: The storage system includes a plurality of storage devices and a storage controller. The storage controller stores a data request quantity indicating the data quantity of write data written to the target area in a specific period, and estimates, based on the quantity of request data and relationship information received from storage devices, the estimated data quantity written to the nonvolatile semiconductor memory chips based on the write data written to the target area in the specific period. The storage controller selects a second logical storage area with an estimated data quantity less than an estimated data quantity for the first logical storage area and assigned to a storage device different from a storage device assigned to the first logical storage area, and migrates the first data stored in the first logical storage area to the second logical storage area.

Abstract: A non-volatile memory device includes a first bank including a plurality of first page buffers, a second bank including a plurality of second page buffers, and an address counter configured to count a first address and a second address in response to a clock before a first time in a period for performing a read operation and count the first address and the second address in response to a bank address after the first time, wherein data of the first page buffers are sequentially outputted in response to the first address, and data of the second page buffers are sequentially outputted in response to the second address.

Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index maintains a hash index in a secondary storage device such as a hard drive, along with a compact index table and look-ahead cache in RAM that operate to reduce the I/O to access the secondary storage device during deduplication operations. Also described is a session cache for maintaining data during a deduplication session, and encoding of a read-only compact index table for efficiency.

Abstract: A method for managing memory in a system for an application, comprising: assigning a first block (i.e., a big block) of the memory to the application when the application is initiated, the first block having a first size, the first block being assigned to the application until the application is terminated; dividing the first block into second blocks (i.e., intermediate blocks), each second block having a same second size, a second block of the second blocks for containing data for one or more components of a single data structure to be accessed by one thread of the application at a time; and, dividing the second block into third blocks (i.e., small blocks), each third block having a same third size, a third block of the third blocks for containing data for a single component of the single data structure.

Abstract: A memory system includes a memory controller with a plurality N of memory-controller blocks, each of which conveys independent transaction requests over external request ports. The request ports are coupled, via point-to-point connections, to from one to N memory devices, each of which includes N independently addressable memory blocks. All of the external request ports are connected to respective external request ports on the memory device or devices used in a given configuration. The number of request ports per memory device and the data width of each memory device changes with the number of memory devices such that the ratio of the request-access granularity to the data granularity remains constant irrespective of the number of memory devices.

Abstract: The system described herein allows for picking data to be moved from one physical location to another using certain criteria, such as expected activity level, to achieve load balancing or load optimization. Migrating data for a logical device includes subdividing the logical device into subsections, where each of the subsections corresponds to a particular address range of the logical device that is mapped to a physical device containing corresponding data and copying data for a first subsection from a first physical device to a second, different, physical device, where data for a second subsection is maintained indefinitely on the first physical device after copying the data for the first subsection to the second physical device. The first physical device may be provided in a different geographic location than the second physical device.

Abstract: An improved technique of redistributing files on a set of storage disks involves specifying a tolerable difference in the load between a most-loaded storage disk and a least-loaded storage disk. From such a specified tolerable difference, a processor generates a file transfer plan listing a set of files to be moved, from which storage disks the files are to be moved and to which storage disks to move the files. File transfer plans which result from allowing the maximum difference in load between the storage disks to be a small but finite amount typically result in a very small number of files to be moved, resulting in much smaller processing times for transferring the files.

Abstract: A method and apparatus for refreshing data in a flash memory device is disclosed. A counter is maintained for each memory block. When a memory block is erased, the counter for that erase block is set to a predetermined value while the remaining counters for other erase blocks are changed. When a memory block counter reaches a predetermined threshold value, the associated memory block is refreshed.

Abstract: A single-ported memory for storing information and only accessible to a plurality of clients, and a dual-ported memory 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 and the second memory to the plurality of clients. The dual-ported memory is accessible to both the plurality of clients and the list manager. A method includes receiving a request from a client for access to memory storage at the single-ported memory and the dual-ported memory, and allocating a block of the single-ported memory to the client and a block of the dual-ported memory to the client. After the client has used the memory storage, the allocated block of the single-ported memory and the dual-ported memory are released to a free list data structure used by the list manager to assign storage.

Abstract: A new data block to be stored in the dispersed storage system is received. When it is determined that a previous data segment contains sufficient space for the new data block, the previous data segment is retrieved from a plurality of dispersed storage units. A revised data segment is generated by aggregating the new data block with at least one existing data block of the previous data segment. A plurality of slices are generated for the revised data segment. The plurality of slices are stored in the plurality of dispersed storage units.

Abstract: Distributed storage resources are managed based on data collected from online monitoring of workloads on the storage resources and performance characteristics of the storage resources. Load metrics are calculated from the collected data and used to identify workloads that are migration candidates and storage units that are migration destinations, so that load balancing across the distributed storage resources can be achieved.

Abstract: Methods, systems, and computer storage mediums including a computer program product method for formatting storage volumes are provided. One method includes creating a storage volume including a global counter and partitioned into multiple storage segments including a segment counter and partitioned into multiple stripes, wherein the global counter and each segment counter match at an initial time. The method further includes releasing the storage segments prior to completely reformatting the storage volume and subsequently incrementing the global counter such that the global counter and each segment counter no longer match at a subsequent time. The method further includes enabling a user to write data to the storage segments prior to completely reformatting the storage volume in response to incrementing the global counter. One system includes a processor for performing the above method and one computer storage medium includes a computer program product configured to perform the above method.

Abstract: A method for controlling data for a storage system comprises: receiving a write input/output (I/O) command of a data from a host computer, the write I/O command including an application ID identifying an application operating on the host computer which sends the write I/O request; maintaining a record of a relation between the application ID in the write I/O command and a storage location of the data to be written in a first volume of the storage system; determining, based on the application ID, whether a data transfer function between the first volume and a second storage volume is to be performed on the data beyond writing the data to the storage location in the first volume; and if the data transfer function is to be performed on the data, then performing the data transfer function on the data to the second volume.

Abstract: One or more snapshots of data stored over a period of time are maintained in a hybrid storage device comprising a magnetic disk and a solid state disk, wherein a selected snapshot stores information that allows recovery of data that is stored in the hybrid storage device at a selected point in time of the period of time. The hybrid storage device receives an input/output (I/O) command from a computational device. A category of a plurality of categories to which the I/O command belongs is determined, wherein the plurality of categories comprise writing to an unused block, writing to a used block, reading from an unused block, and reading from a used block. In response to determining the category to which the I/O command belongs, the I/O command is handled by one of the magnetic disk and the solid state disk based on the determined category.

Abstract: Automatically aligning virtual blocks of partitions to blocks of underlying physical storage is disclosed. In some embodiments, a starting offset of a first partition included in a logical container is detected. In some embodiments, a misalignment correction amount for a first partition included in a logical container is detected. In some embodiments, a misalignment associated with a first partition included in a logical container is corrected.