Abstract: A multi-state memory system with encoding that minimizes half-select currents. The system includes an array of row and column conductors with a plurality of storage cells each capable of being placed into any of three or more physical states. An encoder is connected to receive data bits for storage and to apply activation signals to the row and column conductors to write information to the storage cells. The encoder is programmed to encode the data bits into entries in an array having one row corresponding with each row conductor and one column corresponding with each column conductor; select entries in the array according to half-select currents of the storage cells; apply a predetermined one-dimensional mapping that increases the value of at most one entry in the array to obtain a mapped array; and write entries of the mapped array into the storage cells.

Abstract: The device controller (a) executes a data I/O process with respect to a physical storage area in accordance with an I/O command, and (b) sends to the storage controller an I/O command-related response comprising status information subsequent to being changed in accordance with the I/O process. The storage controller (A) receives the response from the target physical storage device, and (B) based on the status information included in the response received in (A), makes a determination as to whether or not to execute internal processing, and in a case where the result of the determination is to execute internal processing, sends to the target physical storage device an internal processing execution command instructing the execution of internal processing. The device controller in the target physical storage device (c), upon receiving the internal processing execution command, executes internal processing in accordance with the internal processing execution command.

Abstract: A method may include storing data in one or more first-type stripes spanning a plurality of N storage resources and having N?1 data strips for storing the data and a parity strip for storing parity information for the data stored to the particular first-type stripe and each of the plurality of storage resources includes one of a data strip or a parity strip of the particular first-type stripe if the data to be stored exceeds a threshold size. If the data to be stored does not exceed a threshold size, the method may include storing the data in a second-type stripe and a third-type stripe each spanning N storage resources, such that each stripe comprises N?1 data strips for storing the data and a metadata strip for storing address information for the corresponding second-type strip or third-type strip.

Abstract: A shingled magnetic recording hard disk drive that uses writeable cache tracks in the inter-band gaps between the annular data bands minimizes the effect of far track erasure (FTE) in the boundary regions of annular data bands caused by writing to the cache tracks. Based on the relative FTE effect for all the tracks in a range of tracks of the cache track being written, a count increment (CI) table or a cumulative count increment (CCI) table is maintained. For every writing to a cache track, a count for each track in an adjacent boundary region, or a cumulative count for each adjacent boundary region, is increased. When the count value for a track, or the cumulative count for a boundary region, reaches a predetermined threshold the data is read from that band and rewritten to the same band.

Abstract: A storage apparatus and program update method for reducing tediousness and complications of drive inventory management. A storage apparatus 10 includes a disk unit 400 composed of a plurality of first drives 420 storing first firmware of the same type, a controller 100 for controlling data during operation of the first firmware, a relay device 300, and a second drive 520. Then, the second drive 520 stores second firmware of the same type as that of the first firmware and third firmware of a type different from that of the first firmware. The controller 100 includes: a firmware comparison unit for comparing the first firmware with the second firmware; a firmware comparison unit for deciding firmware to operate on the storage apparatus 10 based on the comparison result; and a firmware update unit for updating the firmware operating on the first drive 420 or the second drive 520 with the decided firmware.

Abstract: In one embodiment, a storage system includes a server system having a processor and a local buffer pool for storing instances for use in catalog requests, and a Direct Access Storage Device (DASD) subsystem electrically coupled to the server system and to at least one DASD, wherein the at least one DASD is adapted for providing at least one catalog configured according to a Basic Catalog Structure (BCS), wherein the at least one catalog includes at least one of: a user catalog including information related to locations of user data sets and system data sets stored to the at least one DASD, and a tape volume catalog including information related to locations of user data sets and system data sets stored to at least one tape medium, and wherein the data storage system is adapted for providing Record Level Sharing (RLS) for the at least one catalog stored to the at least one DASD.

Abstract: Approaches to managing a composite, non-volatile data storage device are described. In one embodiment, a method for managing a composite storage device made up of fast non-volatile storage, such as a solid state device, and slower non-volatile storage, such as a traditional magnetic hard drive, can include maintaining a first data structure, which stores instances of recent access to each unit in a set of units in the fast non-volatile storage device, such as the SSD device and also maintaining a second data structure that indicates whether or not units in the slower storage device, such as the HDD, have been accessed at least a predetermined number of times. In one embodiment, the second data structure can be a queue of Bloom filters.

Abstract: In one embodiment, a method for managing a composite storage device made up of fast non-volatile storage, such as a solid state device, and slower non-volatile storage, such as a traditional magnetic hard drive, can include maintaining a first data structure, which stores instances of recent access to each unit in a set of units in the fast non-volatile storage device, such as the SSD device and also maintaining a second data structure that indicates whether or not units in the slower storage device, such as the HDD, have been accessed at least a predetermined number of times. In one embodiment, the second data structure can be a probabilistic hash table, which has a low required memory overhead but is not guaranteed to always provide a correct answer with respect to whether a unit or block in the slower storage device has been referenced recently.

Abstract: A virtual tape device includes a storage unit, an instruction unit, and a reading unit. The storage unit stores a plurality of logical volumes. The instruction unit receives a request for mounting a specified logical volume from an information processing apparatus. The instruction unit issues a mount instruction to both a physical tape device communicated to the virtual tape device and a virtual device communicated to the virtual tape device when the specified logical volume is not stored in the storage unit. The mount instruction instructs to mount the specified logical volume. The reading unit reads data of the specified logical volume to the storage unit from a device which outputs a mount completion notification first among both of the devices which have received the mount instruction.

Abstract: Storage systems which allow atomic write operations, methods of operating thereof, and corresponding computer program products. By way of non-limiting example, a possible method includes: configuring volatile memory into cache memory and pre-cache memory; receiving an indication that a plurality of blocks relating to a command is to be written as an atomic write operation; enabling tracking of the atomic write operation; caching at least one block from the plurality in the pre-cache memory; and upon receiving an indication that all blocks in the plurality have been successfully accommodated in the pre-cache memory, enabling data corresponding to the plurality of blocks to subsequently be cached in the cache memory and discontinuing tracking of the atomic write operation.

Abstract: Storage systems which allow atomic write operations, methods of operating thereof, and corresponding computer program products. By way of non-limiting example, a possible method includes: receiving indication of a transaction, where a plurality of blocks directed to at least one destination logical volume and relating to at least one command is to be written as an atomic write operation; generating a transaction identifier number for the transaction; enabling tracking of the transaction at least partly based on the transaction identifier number, including temporary location of any one of the plurality of blocks; accommodating at least one block of the plurality temporarily in the storage system; and upon receiving an indication that all blocks in the plurality have been successfully temporarily accommodated in the storage system, enabling data corresponding to the plurality of blocks to subsequently be stored in the at least destination logical volume and discontinuing tracking of the transaction.

Abstract: An apparatus for elastic caching of redundant cache data. The apparatus may have a plurality of buffers and a circuit. The circuit may be configured to (i) receive a write request from a host to store write data in a storage volume, (ii) allocate a number of extents in the buffers based upon a redundant organization associated with the write request and (iii) store the write data in the number of extents, where (a) each of the number of extents is located in a different one of the buffers and (b) the number of extents are dynamically linked together in response to the write request.

Abstract: A computer-readable record medium which contains a volume management program is provided. The volume management program forms a plurality of storage devices into a plurality of layers of volume, and re-arranges a location of a layer where a data block is stored according to its access degree, thereby providing a volume management method having much lower power consumption of the storage devices.

Abstract: Described are systems for and methods of improving the efficiency of an automated data storage library.

Abstract: Disclosed are a system, a method and/or an apparatus of processor agnostic data storage in a PCIE based shared storage environment. In one aspect, a method includes processing a storage based request received at an adapter circuit of a controller device associated with a disk array to direct the storage based request to at least one of a processor of the disk array and a plurality of storage devices of the disk array. The method also includes routing, through an interface circuit of the controller device, the data request in the other format compatible with the storage device directly to at least one storage device of the plurality of storage devices of the disk array coupled to the controller device agnostic to a processor of the disk array to store a data associated with the data request based on a mapping table.

Abstract: A method for a takeover in a case of a failure of a server in a storage system includes: a) configuring each virtual partition (VP) to be controlled by a primary data server and a secondary data server b) configuring each data server to have primary responsibility over all logical block addresses (LBAs) corresponding to at least two virtual partitions and to have secondary responsibility over all LBAs corresponding to at least two other virtual partitions; c) responsive to a failure of a data server, i) re-configuring primary responsibility over each VP previously primary controlled by the failed server such that it becomes primary controlled by a server previously configured as a secondary server with respect to this VP; and ii) re-allocating secondary responsibility over each VP previously secondary controlled by the failed server in a manner that each such VP becomes secondary controlled by a server other than the newly assigned server with primary responsibility.

Abstract: Provided are a computer program product, system, and method for processing a read operation for a target block of data. A read operation for the target block of data in target storage is received, wherein the target block of data is in an instant virtual copy relationship with a source block of data in source storage. It is determined that the target block of data in the target storage is not consistent with the source block of data in the source storage. The source block of data is retrieved. The data in the source block of data in the cache is synthesized to make the data appear to be retrieved from the target storage. The target block of data is marked as read from the source storage. In response to the read operation completing, the target block of data that was read from the source storage is demoted.

Abstract: Information is maintained on strides configured in a second cache and occupancy counts for the strides indicating an extent to which the strides are populated with valid tracks and invalid tracks. A determination is made of tracks to demote from a first cache. A first stride is formed including the determined tracks to demote. The tracks from the first stride are to a second stride in the second cache having an occupancy count indicating the stride is empty. A determination is made of a target stride in the second cache based on the occupancy counts of the strides in the second cache. A determination is made of at least two source strides in the second cache having valid tracks based on the occupancy counts of the strides in the second cache. The target stride is populated with the valid tracks from the source strides.

Abstract: Provided are a computer program product, system, and method for managing data in a cache system comprising a first cache, a second cache, and a storage system. A determination is made of tracks stored in the storage system to demote from the first cache. A first stride is formed including the determined tracks to demote. A determination is made of a second stride in the second cache in which to include the tracks in the first stride. The tracks from the first stride are added to the second stride in the second cache. A determination is made of tracks in strides in the second cache to demote from the second cache. The determined tracks to demote from the second cache are demoted.

Abstract: Provided are a computer program product, system, and method for managing data in a cache system comprising a first cache, a second cache, and a storage system. A determination is made of tracks stored in the storage system to demote from the first cache. A first stride is formed including the determined tracks to demote. A determination is made of a second stride in the second cache in which to include the tracks in the first stride. The tracks from the first stride are added to the second stride in the second cache. A determination is made of tracks in strides in the second cache to demote from the second cache. The determined tracks to demote from the second cache are demoted.

Abstract: A determination is made of a track to demote from the first cache to the second cache, wherein the track in the first cache corresponds to a track in the storage system and is comprised of a plurality of sectors. In response to determining that the second cache includes a the stale version of the track being demoted from the first cache, a determination is made as to whether the stale version of the track includes track sectors not included in the track being demoted from the first cache. The sectors from the track demoted from the first cache are combined with sectors from the stale version of the track not included in the track being demoted from the first cache into a new version of the track. The new version of the track is written to the second cache.

Abstract: Some functions of multiple structural elements are integrated into a specific structural element. The specific structural element controls transmission/reception of signals to/from the respective structural elements. A storage controller includes a Frontend I/F (Interface) Chip, Backend I/F Chip, CPU (Central Processing Unit), memory, and universal LSI (Large Scale Integrated Circuit) connected to the respective units, and transmitting/receiving signals to/from the respective units. The universal LSI is configured by integrating functions of connecting and controlling the respective units, and when connecting to the respective units, the function blocks corresponding to the respective units are validated and become a Frontend control block, a Backend control block, a switch block, a CPU I/F block and a memory control block while the control functions which are not connected are invalidated.

Abstract: Embodiments of the invention include systems and methods for auto-tiering multiple file systems across a common resource pool. Storage resources are allocated as a sub-LUN auto-tiering (SLAT) sub-pool. The sub-pool is managed as a single virtual address space (VAS) with a virtual block address (VBA) for each logical block address of each data block in the sub-pool, and a portion of those VBAs can be allocated to each of a number of file systems. Mappings are maintained between each logical block address in which file system data is physically stored and a VBA in the file system's portion of the virtual address space. As data moves (e.g., is added, auto-tiered, etc.), the mappings can be updated. In this way, multiple SLAT file systems can exploit the full resources of the common SLAT sub-pool and maximize the resource options available to auto-tiering functions.

Abstract: A dynamic hard disk mapping method and a server using the same are disclosed. The server includes a first motherboard, a second motherboard, a first disk group corresponding to the first motherboard, and a second disk group corresponding to the second motherboard. In the dynamic hard disk mapping method, at first, a disk redistributing instruction is received and stored. Thereafter, a reset instruction is received and performed. Then, the number of hard disks of the first disk group and the number of hard disks of the second disk group are summed up to obtain a total hard disk number N, wherein N is a positive integer greater than zero. Thereafter, the disk redistributing instruction is read, and a redistribution computation is performed in accordance with the disk redistributing instruction to obtain a third disk group corresponding to the first motherboard and a fourth disk group corresponding to the second motherboard.

Abstract: According to a storage system of a prior art adopting a cluster structure, various types of large-capacity memories were arranged to enhance the access performance, so that the system required a dedicated control circuit, and there was difficulty in realizing cost reduction and improvement of access performance simultaneously. In order to solve the problems, the present invention provides a storage system in which a group of memories is integrated to MPU memories directly coupled to MPUs in respective controller units, wherein each MPU memory is divided into a duplication information area and a non-duplication information area, and attribute information for controlling accesses thereto are provided.

Abstract: A data storage device and a software method using same are described. The method dynamically relocates and includes; upon receiving a requirement to load a new code object to a first storage medium, allocating a dynamic relocation region of the first storage medium, writing information related a task to be performed in relation to the dynamic relocation region to a second storage medium, selecting the new code object from a plurality of code objects stored in the second storage medium, and loading the selected new code object to the allocated dynamic relocation region, and generating information for performing a task associated with the loaded new code object.

Abstract: A first storage system comprises a first RAID group comprising multiple first storage devices, which constitute the basis of a first logical volume. A second storage system comprises a second RAID group comprising multiple second storage devices, which constitute the basis of a second logical volume. The RAID configuration of the first RAID group and the RAID configuration of the second RAID group are the same, and the type of a compression/decompression function of the respective first storage devices and the type of a compression/decompression function of the respective second storage devices are the same. Compressed data is read from a first storage device without being decompressed with respect to the data inside a first logical volume, and the read compressed data is written to a second storage device, which is in the same location in RAID in the second RAID group as the location in RAID of this first storage device.

Abstract: A disk array device includes: a plurality of disk devices including a strip that stores divided data or a parity; a control device to divide the stripe for each of the plurality of disk devices into the divided data having a size of the strip and write the divided data; and a memory to store new data that corresponds to the divided data stored in the strip, wherein the control device detects whether or not the new data is discrete and performs a first write operation or a second write operation when the new data is discrete.

Abstract: A method for hot backward compatible upgrade of a storage system includes: a) configuring each virtual partition (VP) to be controlled by a primary data server and a secondary data server b) configuring each data server to have primary responsibility over all logical block addresses (LBAs) corresponding to at least two virtual partitions and to have secondary responsibility over all LBAs corresponding to at least two other virtual partitions; c) responsive to a shut-down of a data server, i) re-configuring primary responsibility over each VP previously primary controlled by the shut-down server such that it becomes primary controlled by a server previously configured as a secondary server with respect to this VP; ii) re-allocating secondary responsibility over each VP previously secondary controlled by the shut-down server in a manner that each such VP becomes secondary controlled by a server other than the newly assigned server with primary responsibility.

Abstract: A storage controller that includes a cache, receives a command from a host, wherein a set of criteria corresponding to read response times for executing the command have to be satisfied. A destage application that destages tracks based at least on recency of usage and spatial location of the tracks is executed, wherein a spatial ordering of the tracks is maintained in a data structure, and the destage application traverses the spatial ordering of the tracks. Tracks are destaged from at least inside or outside diameters of disks at periodic intervals, while traversing the spatial ordering of the tracks, wherein the set of criteria corresponding to the read response times for executing the command are satisfied.

Abstract: A storage controller that includes a cache receives a command from a host, wherein a set of criteria corresponding to read and write response times for executing the command have to be satisfied. The storage controller determines ranks of a first type and ranks of a second type corresponding to a plurality of volumes coupled to the storage controller, wherein the command is to be executed with respect to the ranks of the first type. Destage rate corresponding to the ranks of the first type are adjusted to be less than a default destage rate corresponding to the ranks of the second type, wherein the set of criteria corresponding to the read and write response times for executing the command are satisfied.

Abstract: A system and method for reading files stored on a storage system is disclosed. The method includes communicatively coupling one or more remote systems for reading files stored in storage with a first set of files according to a predetermined data format and in a cache memory with a second set of files, the second set of files being a subset of the first set of files. Next one or more remote systems are received at least one read request for reading a sequence of files. A determination is made, among the files of the sequence of files, whether one or more cached files are already stored in the cache memory and whether one or more remaining files are not already stored in the cache memory. Creating, within the one or more remaining files, an order according to which the remaining files should be read on the storage system.

Abstract: According to one aspect of the invention, a method of controlling a storage system comprises storing data in a first volume in the storage system which has volumes including the first volume and a plurality of second volumes; prohibiting write I/O (input/output) access against the first volume after storing the data in the first volume; performing subsequent write requests received by the storage system against the second volumes in the storage system after storing the data in the first volume, each write request having a target volume which is one of the second volumes; and in response to each one write request of the write requests, determining whether the target volume of the one write request is write prohibited or not, and performing the one write request only if the target volume is not write prohibited.

Abstract: The is provided a storage system comprising a plurality of disk units adapted to store data at respective ranges of logical block addresses (LBAs), said addresses constituting an entire address space, and a storage control grid operatively connected to the plurality of disk units and comprising a plurality of data servers.

Abstract: In control of the disk array device (backup system), when a blackout occurs, the disk array device is first operated in a first method to backed up a main memory by using a power supply from a battery. During the first method, a blackout continuous time and the like are integrated, and at a timing in which the integrated value satisfies a condition, the first method is then shifted to the second method to evacuate data from the main memory onto a nonvolatile memory based on a power supply.

Abstract: Shared cache modules, systems, and methods are provided herein. The shared cache module is useable with at least one initiator on a serial attached small computer system interface system. The shared cache module includes a memory device and a memory interface. The memory device assigns each of the at least one initiator to a portion of a cache memory on the memory device. The memory interface indexes the assignment and communicates with the at least one initiator to perform a memory task.

Abstract: In at least some embodiments, an expander includes control logic to manage temporary connections and resource allocation between a storage access request initiator and a plurality of physical storage units, and to enable virtual storage units corresponding to subdivisions within at least one of the physical storage units by emulating a PHY layer for each virtual storage unit.

Abstract: Each time any one of HDDs is accessed, a corresponding relationship between the disk address of the accessed HDD and the time information indicating a time at which the HDD is accessed is added to a first operating-state management table. When a corresponding relationship with the same disk address already exists in the first operating-state management table, the time information is updated. When the first operating-state management table has no space available for new entry, corresponding relationships are deleted from the one having the oldest time information. Only HDDs of which disk address is recorded in the first operating-state management table is turned on.

Abstract: It is provided a storage system for storing data requested by a host computer to be written, the storage system comprising: at least one processor, a cache memory and a cache controller. The cache memory includes a first memory which can be accessed by way of either access that can specify an access range by a line or access that continuously performs a read and a write. The cache controller includes a second memory which has a higher flexibility than the first memory in specifying an access range. The cache controller determines an address of an access destination upon reception of a request for an access to the cache memory from the at least one processor, and switches a request for an access to a specific address into an access to a corresponding address in the second memory.

Abstract: A system for providing a user data storage environment using a network-based file system in an N-screen environment is provided. The system may include a memory cache to store a cache file downloaded from a Network File System (NFS) storage that is equipped in a server and stores data for each user, and an NFS interface to store, in the memory cache, the cache file downloaded through an NFS, in order to use the cache file in the N-screen environment.

Abstract: The invention provides a data access method. First, a plurality of commands received from a host is stored in a command queue. A plurality of logical address ranges of the commands is then calculated. A plurality of write commands is then selected from the commands, wherein the logical address ranges of the write commands are overlapping with each other. Whether at least one read command having a receiving order that is in between the receiving orders of the write commands exists in the command queue is then determined. When the at least one read command does not exist, write data corresponding to the write commands are combined together to obtain combined write data according to the logical address ranges of the write commands. A combined write command and the combined write data are then sent to a memory to request that the memory executes the write commands.

Abstract: Physical storage devices are configured as a redundant array of independent disks (RAID). As such, storage space of the physical storage devices is allocated to the RAID, and each physical storage device is part of the RAID. Where a portion of the storage space of the physical storage devices is not allocated to the RAID, this portion of the storage space from a mixed drive capacity is configured so that it is usable and is not wasted.

Abstract: An information system comprises: a storage system including a processor, a memory, and a plurality of virtual volumes to be allocated pages from a storage pool of volumes; and a metadata server which, upon receiving from a client a write request containing file data to be written to a virtual volume in the storage system, returns the write request to the client with parallel information which is added to a data layout of the file data to be written in the virtual volume. The storage system, upon receiving the write request with the parallel information, allocates, based on the parallel information, pages from the storage pool to the virtual volume for writing the file data, so that the data layout is striped and the allocated pages fit striped data access according to the striped data layout.

Abstract: According to one embodiment, an information processing apparatus includes a determination module and a cache module. The determination module is configured to determine whether an access request from a host to the hard disk drive is a request for accessing a preset number of or more consecutive sectors in a hard disk drive. The cache module is configured to use a storage apparatus as a cache for the hard disk drive, and the cache module is configured not to use the storage apparatus as the cache when it is determined that the access request is the request for accessing the preset number of or more consecutive sectors.

Abstract: A control method includes allocating a plurality of virtual disks to a virtual storage allocated to a physical storage, associating data with one of the plurality of virtual disks which has been instructed to store the data and storing the data in the physical storage, and selecting, by a processor, one of the plurality of virtual disks as a data movement target virtual disk from which data is to be moved in accordance with a network bandwidth of the physical storage corresponding to the virtual storage when free space in the virtual storage exceeds a threshold value.

Abstract: A multi-tiered system of data storage includes a plurality of data storage solutions. The data storage solutions are organized such that the each progressively faster, more expensive solution serves as a cache for the previous solution, and each solution includes a dedicated data block to store individual data sets, newly written in a plurality of write operations, for later migration to slower data storage solutions in a single write operation.

Abstract: This invention is a system and a method for performing an I/O in a virtual data storage environment using a new architecture. The system of performing an I/O includes a mapping client integrated into a client of the storage server which in communication with the mapping server included in the storage server retrieves the mapping of the special data sharing storage objects and caches the shared objects in the data cache include in the client environment. The method of accessing the data sharing storage objects by one or more applications running on a client reduces the number of I/O on the storage objects by caching the storage objects in the data cache and bringing the knowledge of data sharing into the client environment.

Abstract: A storage proxy monitors storage access operations. Different address alignments are identified between the storage access operations and data blocks in a storage media. A dominant one of the address alignments is identified. Data blocks are mapped into the storage media to remove the dominant address alignment. An array of counters can be used to track the address alignments for different storage access sizes and the address alignment associated with the highest number of storage access operations is used as the dominant address alignment.

Abstract: The storage devices of a storage device set (e.g., a RAID array) may generate a nonvolatile representation of the configuration of the storage device set, including logical disks, spaces, storage pools, and layout and provisioning plans, on the physical media of the storage devices. A computer accessing the storage device set may also generate a volatile memory representation of the storage device set to use while accessing the storage devices; however, the nonvolatile representation may not be performant due to its different usage and characteristics. Presented herein are techniques for accessing the storage device set according to a volatile memory representation comprising a hierarchy of logical disks, slabs, and extents, and an accessor comprising a provisioning component that handles slab accesses while applying provisioning plans, and that interfaces with a lower-level layout component that translates slab accesses into storage device accesses while applying layout plans to the storage device set.

Abstract: A method includes producing values with a producer thread, and providing a queue data structure including a first array of storage locations for storing the values. The first array has a first tail pointer and a first linking pointer. If a number of values stored in the first array is less than a capacity of the first array, an enqueue operation writes a new value at a storage location pointed to by the first tail pointer and advances the first tail pointer. If the number of values stored in the first array is equal to the capacity of the first array, a second array of storage locations is allocated in the queue. The second array has a second tail pointer. The first array is linked to the second array with the first linking pointer. An enqueue operation writes the new value at a storage location pointed to by the second tail pointer and advances the second tail pointer.