What are you looking for ?
Infinidat
Articles_top

IBM Assigned Eleven Patents

Data replication across servers, slice storage in dispersed storage network, microcode upgrade in storage system, storage capacity allocation using distributed spare space, disk management in distributed storage system, tape backup and restore in disk storage environment, implementing multiple RAID level in storage device, concurrent upgrade and backup of non-volatile memory, delaying programming requests in flash memory, minimizing data storage media fragmentation, prioritization of users during DR

Data replication across servers
International Business Machines Corporation, Armonk, NY, has been assigned a patent (9,875,161) developed by Anglin, Matthew J., and Fruchtman, Barry, Tucson, AZ, for a “data replication across servers.

The abstract of the patent published by the U.S. Patent and Trademark Office states: “Embodiments of the present invention provide methods, systems, and computer program products for replicating data between redundant sources. In one embodiment, during a reverse replication process, roles of a source system and target system are altered such that the target system controls the replication process. The target system can identify objects to be transferred, build batches of objects for efficient transfer, and transmit the batches of objects to the source system. Accordingly, embodiments of the present invention can reduce inefficient communication between a source system and a target system that might otherwise occur during replication processes controlled by the source system.

The patent application was filed on December 6, 2016 (15/369,934).

Slice storage in dispersed storage network
International Business Machines Corporation, Armonk, NY, has been assigned a patent (9,875,158) developed by Abhijeet, Kumar, Leggette, Wesley B., and Resch, Jason K., Chicago, IL, for a “slice storage in a dispersed storage network.

The abstract of the patent published by the U.S. Patent and Trademark Office states: “A method for use in a dispersed storage network, (DSN) operates to output at least a write threshold number of write slice requests to a set of storage units of the DSN and receive write slice responses from the set of storage units. When the write threshold number of favorable write slice responses is received, the method includes generating a corresponding number of commit requests and outputting the number of commit requests to associated storage units corresponding to the write threshold number of favorable write slice responses received.

The patent application was filed on September 15, 2016 (15/266,011).

Microcode upgrade in storage system
International Business Machines Corporation, Armonk, NY, has been assigned a patent (9,875,094) developed by Coronado, Juan A., LaFrese, Lee C., and Martinez, Lisa R., Tucson, AZ, for a “microcode upgrade in a storage system.

The abstract of the patent published by the U.S. Patent and Trademark Office states: “A method for upgrading microcode in a multi-module storage system may include selecting a first module from two or more modules and operating the first module using an upgraded microcode. The method may include monitoring the performance of the first module by a second module of the two or more modules and rendering an indication of performance of the first module. Further, the method may include determining whether the indication of performance of the first module is greater than or equal to a performance metric.

The patent application was filed on August 29, 2012 (13/598,068).

Storage capacity allocation using distributed spare space
International Business Machines Corporation, Armonk, NY, has been assigned a patent (9,875,052) developed by Agombar, John P., Winchester, Great Britain, Boden, Ian, Eastleigh, Great Britain, Hutchison, Gordon D., Eastleigh, Great Britain, and Sanders, Lee J., Chichester, Great Britain, for a “storage capacity allocation using distributed spare space.

The abstract of the patent published by the U.S. Patent and Trademark Office states: “Method and system are provided for storage capacity allocation. The method includes: providing a storage pool having multiple storage drive arrays, designating an initial available storage capacity in the storage pool, and allocating the remaining storage capacity in the storage pool to distributed spare space, wherein distributed spare space spreads portions of a spare drive across multiple storage drives in an array. The method also includes: monitoring an amount of available storage capacity as data is stored to the storage pool and determining when a threshold of a minimum available storage capacity is reached, and re-allocating one or more distributed spare drives from an array to available storage capacity when the threshold of the minimum available storage capacity is reached.

The patent application was filed on March 15, 2016 (15/070,029).

Disk management in distributed storage system
International Business Machines Corporation, Armonk, NY, has been assigned a patent (9,875,050) developed by Chen, Lei, Shanghai, China, Chen, Li, Yixing, China, Yang, Xiaoyang, San Francisco, CA, and Zhang, Jun Wei, Shanghai, China, for a “disk management in distributed storage system including grouping disks into cold and hot data disk rings and reducing a spinning rate of disks storing cold data.

The abstract of the patent published by the U.S. Patent and Trademark Office states: “A method, computer program product, and computer system are disclosed for disk management in a distributed storage system, wherein the distributed storage system comprises a plurality of disks within a main disk ring, and the disks store target data. In one embodiment, the method comprises dividing the target data into cold target data and hot target data, and grouping one or more disks within the main disk ring into a cold data disk ring and the remaining one or more disks within the main disk ring into a hot data disk ring, based on the cold target data’s and the hot target data’s positions on disks. The method further comprises migrating the cold target data on disks not within the cold data disk ring onto disks within the cold data disk ring while migrating the hot target data on disks not within the hot data disk ring onto disks within the hot data disk ring, and reducing a spinning rate of disks within the cold data disk ring.

The patent application was filed on September 28, 2015 (14/867,042).

Tape backup and restore in disk storage environment
International Business Machines Corporation, Armonk, NY, has been assigned a patent (9,875,046) developed by Crawford, Joshua J., Jennas, II, Paul A., Tucson, AZ, Peipelman, Jason L., Austin, TX, and Ward, Matthew J., Vail, AZ, for a “tape backup and restore in a disk storage environment with intelligent data placement.

The abstract of the patent published by the U.S. Patent and Trademark Office states: “Data is relocated, based on an intelligent data placement algorithm, from a first storage location to a second storage location in a disk storage system. A data placement record is generated including a virtual disk location associated with the data, the second storage location, and a first sequence value. The first sequence value indicates relative sequence when compared to other sequence values. The data placement record is written to a first record location on a first tape cartridge loaded in a tape drive. The data placement records are used with data records to restore data to disk storage from tape backup.

The patent application was filed on October 20, 2016 (15/298,681).

Implementing multiple raid level configurations in storage device
International Business Machines Corporation, Armonk, NY, has been assigned a patent (9,875,037) developed by Fluman, Mudi M., Haifa, Israel, Frank, Yaacov, Ramot Meir, Israel, Shiran, Yehuda, Haifa, Israel, and Vatelmacher, Ronny, Hod-Hashron, Israel, for an “implementing multiple raid level configurations in a data storage device .

The abstract of the patent published by the U.S. Patent and Trademark Office states: “Embodiments of the present invention provide systems, methods, and computer program products for implementing multiple raid level configurations in a computer storage device. In one embodiment, performance or resiliency of application data being executed to a single computer storage device can be prioritized. Embodiment of the present invention provide systems, methods, and computer program products for a recovery operation, responsive to determining to prioritize performance of application data being executed to the single computer storage device.

The patent application was filed on June 18, 2015 (14/742,736).

Concurrent upgrade and backup of non-volatile memory
International Business Machines Corporation, Armonk, NY, has been assigned a patent (9,875,036) developed by Chinnakkonda Vidyapoornachary, Diyanesh B., Bangalore, India, Kim, Kyu-hyoun, Chappaqua, NY, Sethuraman, Saravanan, Bangalore, India, and Tressler, Gary A., Sandy Hook, CT, for a “concurrent upgrade and backup of non-volatile memory.

The abstract of the patent published by the U.S. Patent and Trademark Office states: “An endurance parameter value of a non-volatile memory included in a non-volatile dual in-line memory module, (NVDIMM) can be monitored and compared against a warning threshold value. In response to the endurance parameter exceeding the warning threshold value, a system alert can be generated, within a host system of the NVDIMM, to inform a system user that the NVDIMM is approaching its end-of-life. If the endurance parameter exceeds a replacement threshold value greater than the warning threshold value, an upgrade process can be initiated. The upgrade process can include copying data from the first non-volatile memory to a volatile memory of the NVDIMM and copying, in response to the first non-volatile memory being replaced with a second non-volatile memory, the data from the volatile memory to the second non-volatile memory.

The patent application was filed on January 12, 2017 (15/404,232).

Delaying programming requests in flash memory
International Business Machines Corporation, Armonk, NY, has been assigned a patent (9,875,034) developed by Sethuraman, Saravanan, Bangalore, India, Tressler, Gary A, Sandy Hook, CT, and Venkataraman, Harish, Bangalore, India, for a “delaying programming requests in flash memory.

The abstract of the patent published by the U.S. Patent and Trademark Office states: “Embodiments herein describe a memory system that queues program requests to a block of flash memory until a predefined threshold is reached. That is, instead of performing program requests to write data into the block as the requests are received, the memory system queues the requests until the threshold is satisfied. Once the buffer for the block includes the threshold amount of program requests, the memory system performs the stored requests. In one embodiment, the memory system erases all the pages in the block before writing the new data in the program requests into the destination pages. The data that was originally stored in the pages that are not destination pages is rewritten into the pages. In this example, the queued program requests can be written into the pages using one erase and write step rather than individual erase and write steps for each of the requests.

The patent application was filed on April 7, 2016 (15/093,243).

Minimizing data storage media fragmentation
International Business Machines Corporation, Armonk, NY, has been assigned a patent (9,875,033) developed by Perez, Miguel Angel, Vail, AZ, Reed, David Charles, and Smith, Max Douglas, Tucson, AZ, for an “apparatus and method for minimizing data storage media fragmentation.

The abstract of the patent published by the U.S. Patent and Trademark Office states: “A method of minimizing data storage medium fragmentation, wherein the method provides a data storage library comprising, (N) data storage media, wherein, (N) is greater than or equal to 1. The method establishes a threshold fragmentation index, and determines, for each value of, i, an actual fragmentation index for an, (i)th data storage medium, wherein, (i) is greater than or equal to 1 and less than or equal to, (N). The method receives a data set from a host computer in communication with the data storage library, and writes the data set to an, i)th data storage medium based upon an, (i)th actual fragmentation index.

The patent application was filed on May 12, 2009 (12/464,748).

Prioritization of users during disaster recovery
International Business Machines Corporation, Armonk, NY, has been assigned a patent (9,875,373) developed by Glading, Ian A.J., Hampshire, Great Britain, Mahajan, Sachin K., Pune, India, Moore, Jr., John E., Brownsburg, IN, for a “prioritization of users during disaster recovery.

The abstract of the patent published by the U.S. Patent and Trademark Office states: “Two or more users of a system are determined. The system includes at least one resource. Contextual information for a user of the two or more users is determined. The user of the two or more users are assigned to a tier of a plurality of tiers based on the contextual information. A failure of a system is determined. Responsive to determining the system has a system failure, a user of the two or more users is granted access to the system based on the tier assigned to the user.

The patent application was filed on September 28, 2015 (14/867,323).

Articles_bottom
AIC
ATTO
OPEN-E