Abstract: A computer-implemented method, according to one embodiment, includes: repeating the following sequence at least until a page stripe of a memory cache has at least a predetermined amount of data stored therein: finding an open codeword having an amount of available space which is greater than or equal to a size of a compressed logical page, and storing the compressed logical page in the open codeword having the amount of available space which is greater than or equal to a size of the compressed logical page. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: A system is described to provide protection key access control in a system whose operating system and processor were not designed to provide a protection key memory access control mechanism. Such a system can be applied to an emulator or to enable a system that executes native applications to be interoperable with a legacy system that employs protection key memory access control.

Abstract: A flash-based storage warehouse system includes flash memory devices and reader/writer devices that are moveable to different locations in a structure. Each of the flash memory devices are at one of the different locations in the structure. Each of the reader/writer devices includes a locomotion apparatus configured to move the corresponding one of the reader/writer devices to a different location in the structure and a processor coupled to a memory and the locomotion apparatus that is configured to execute machine executable code to: engage the locomotion apparatus to adjustably position one of reader/writer devices to one of the locations in the structure in response to a received operation; couple power via the corresponding one of the reader/writer devices to one of the flash memory devices at the one of the locations in the structure; and execute the operation on the flash memory device at the location in the structure.

Abstract: A nonvolatile memory system includes a nonvolatile memory device having a physical storage area, and a memory controller managing the physical storage area on the basis of first and second logical areas. The memory controller is configured to receive a logical block address range corresponding to a part of the first logical area and a command from a host and is configured to receive data, a logical block address and a write command from the host to perform an update with respect to the second logical area. When, in the update operation, the received logical block address is included in the logical block address range, the memory controller, in response to the write command, redirects the received logical block address to a logical page number of the second logical area so that the data is written in the second logical area.

Abstract: The invention is directed to a storage device utilizing laptop storage drives and rackmount server adapted to use the same. The storage device includes a body and drive software. The drive and internal portions of the body are adapted to form contact fits. The software of the storage device provides an electronic interface that permits operations of advantageous RAID configurations.

Abstract: A just-in-time storage allocation is initiated for storage at a remote storage device having flash storage. Each of multiple containers comprises a grouping of one or more of the flash storage. The just-in-time storage allocation includes an application profile that includes a priority criteria for the storage of either a priority of performance over efficiency or a priority of efficiency over performance. A determination is made of whether at least one container of the multiple containers satisfies the priority criteria based on at least one attribute of the at least one container. The storage is allocated in the at least one container, in response to the at least one container satisfying the priority criteria.

Abstract: Provided herein a method for allocating storage space using a buddy allocator, the method including receiving, by a buddy allocator, a block allocation request from a space allocation requestor, selecting, by the buddy allocator, a first buddy in response to the block allocation request, wherein the first buddy is one of a plurality of buddies, checking, by the buddy allocator, whether blocks of the first buddy include a first spare storage space to which storage space corresponding to the block allocation request is allocated, allocating, by the buddy allocator, the storage space to the blocks of the first buddy when it is checked that the blocks of the first buddy include the first spare storage space, and deallocating, by the buddy allocator, excess storage space of allocated storage space when a size of the allocated storage space is greater than the storage corresponding to the block allocation request, wherein the excess storage space is not corresponding to the block allocation request.

Abstract: A cache memory system has a first cache memory comprising one or more levels, to store data corresponding to addresses, a second cache memory comprising a plurality of non-volatile memory cells, which has higher speed capability than a main memory, has a larger capacity than the first cache memory and stores data corresponding to addresses, and a first storage to store address conversion information from a virtual address issued by a processor to a physical address and to store flag information indicating whether data is stored in the second cache memory by a page having a larger data amount than a cache line, the first cache memory being accessed by the cache line.

Abstract: According to certain aspects, a system can include a client computing device configured to: in response to user interaction, store an identifier associated with a first tag in association with a first file; and in response to instructions to perform a secondary copy operation, forward the first file, a second file, and the identifier associated with the first tag. The system may also include a secondary storage controller computer(s) configured to: based on a review of the identifier associated with the first tag, identify the first file as having been tagged with the first tag; electronically obtain rules associated with the first tag; perform on the first file at least a first secondary storage operation specified by the rules associated with the first tag; and perform on the second file at least a second secondary storage operation, wherein the first and second secondary storage operations are different.

Abstract: A storage unit includes a U-shaped magnetic track, a first drive circuit, a second drive circuit, a first drive port, and a second drive port. The U-shaped magnetic track includes a first port, a second port, a first storage area, and a second storage area. By controlling input voltages of the first port, the second port, the first drive port, and the second drive port and driving the first drive circuit, a current pulse is generated in the first storage area, and a magnetic domain wall in the first storage area is driven to move. By controlling the input voltages of the first port, the second port, the first drive port, and the second drive port and driving the second drive circuit, a current pulse is generated in the second storage area, and a magnetic domain in the second storage area is driven to move.

Abstract: A method may include generating a chain of snapshot point-in-time copies (PITCs) for a virtual volume, the chain comprising one or more reverse PITCs and one active PITC, such that: (i) read operations to a snapshot pointing to a reverse PITC traverse a portion of the one or more reverse PITCs in a direction of the chain from the reverse PITC pointed to by the snapshot to the active PITC in order to return data responsive to the read operations to the snapshot; and (ii) read operations to the virtual volume traverse only the active PITC in order to return data responsive to the read operations to the virtual volume.

Abstract: A memory control circuit has a request determination circuitry to determine whether a period without read-out request and write request to an i-th (i being an integer of 1 or more and of n or less, n being an integer of 2 or more) level cache memory among first to n-th level cache memories continues for a first period of time or longer, the i-th level cache memory comprising a first nonvolatile memory, and a power-supply controller to control a power cut-off timing to the i-th level cache memory based on a determination of the request determination circuitry.

Abstract: Embodiments of the application disclose a data storage method and a storage server. The method includes: detecting actual usage of a hard disk corresponding to an initial capacity level in configured hard disk capacity levels; when it is determined, according to the detected actual usage, that the hard disk corresponding to the initial capacity level exceeds a limit, searching for a hard disk corresponding to a second highest capacity level and is higher than the initial capacity level; and when the hard disk corresponding to the second highest capacity level is obtained by searching, determining a migration ratio of a virtual node according to the initial capacity level, the second highest capacity level, and the actual hard disk capacity, and performing virtual node migration between hard disks that are corresponding to the configured hard disk capacity levels. By using the disclosure, hard disk capacity heterogeneousness in massive storage is supported.

Abstract: In accordance with an embodiment, described herein is a system and method for providing distributed caching in a transactional processing environment. The caching system can include a plurality of layers that provide a caching feature for a plurality of data types, and can be configured for use with a plurality of caching providers. A common data structure can be provided to store serialized bytes of each data type, and architecture information of a source platform executing a cache-setting application, so that a cache-getting application can use the information to convert the serialized bytes to a local format. A proxy server can be provided to act as a client to a distributed in-memory grid, and advertise services to a caching client, where each advertised service can match a cache in the distributed in-memory data grid, such as Coherence. The caching system can be used to cache results from a service.

Abstract: According to an aspect, a user interface is provided for assisting a user with identifying parameters for starting an application that utilizes real-time garbage collection (GC). The parameters include a fixed heap size and a GC central processing unit (CPU) utilization. Responsive to receiving a request from the user, the user is provided with options for profiling the application. The profiling includes executing the application. The options include targeting the GC CPU utilization to meet real-time requirements, targeting the heap size to meet the real-time requirements, and targeting a balance between the GC CPU utilization and the heap size to meet the real-time requirements. Responsive to detecting a selection of an option by the user, the application is profiled according to the option selected. The user is presented with results of the profiling via the user interface. The results include values for the parameters.

Abstract: A method, according to one embodiment, includes repeating the following sequence at least until a page stripe of a memory cache has at least a predetermined amount of data stored therein: receiving a compressed logical page of data, finding an open codeword having an amount of available space which is greater than or equal to a size of the compressed logical page, and storing the compressed logical page in the open codeword having the amount of available space which is greater than or equal to a size of the compressed logical page. The compressed logical page does not straddle out of the open codeword. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: A method of operating a storage controller is provided. The method includes receiving first host data traffic from a host, for storage in a first partition within a storage system, the first host data traffic formatted for storage in a first type of data storage, and translating the first host data traffic into storage data, the storage data formatted for storage in a second type of data storage. The method further includes storing the storage data in the first partition, receiving a read request from the host through the host interface, and retrieving some or all of the storage data from the first partition. The method also includes formatting the some or all of the storage data into a format compatible with the first host data traffic, and transferring the formatted data to the host in a configuration corresponding to the first type of data storage.

Abstract: A load request is received to retrieve a piece of data from a location in memory and the load request follows one or more store requests in a set of instructions to store a piece of data in the location in memory. One or more possible locations in a cache for a piece of data corresponding to the location in memory is determined. Each possible location of the one or more possible locations in the cache is determined. It is then determined if at least one location of the one or more possible locations contains data to be stored in the location in memory. Data in one location of the at least one location is loaded, the data in the one location is from a store request of the one or more store requests and the store request is closest in the set of instructions to the load request.

Abstract: Various embodiments for data compression by a processor. Levels of data distribution are configured for data processing, including a first level of the data distribution incorporating a GRID network of data storage nodes, and a second level of the data distribution incorporating a GRID network of compressive nodes in communication with the GRID network of data storage nodes. Input/output (I/O) for an associated storage volume is load balanced between the data storage nodes, as data passes through the first level into the second level to be compressed or uncompressed.

Abstract: A method for operating a computing system includes: monitoring a central interface for a power event; accessing a high-speed memory for pre-shutdown data; accessing a non-volatile memory during the power event for the pre-shutdown data previously stored on the high-speed memory; selecting a multiplexer for allowing external access to the high-speed memory; and formatting the pre-shutdown data in the non-volatile memory for access through a non-disruptive interface.