International Business Machines Corporation

Jaishankar Moothedath Menon

James T Brady

Divyesh Jadav

Michael Howard Hartung

Damon W Finney

Michael Anthony Ko

David R Nowlen

Donald J Lang

Deepak R Kenchammana-Hosekote

Richard L Mattson

Noah R Mendelsohn

Richard Lewis Mattson

Richard Francis Freitas

Michael T Benhase

Steven Robert Hetzler

Windsor Wee Sun Hsu

Hovey Raymond Strong

Spencer W Ng

Honesty Cheng Young

Miguel M Blaum

Alden B Johnson

Witold Litwin

Shin-Yuan Tzou

Michael F Mitoma

David Darden Chambliss

Kaladhar Voruganti

Balakrishna Raghavendra Iyer

Jehoshua Bruck

Bruce McNutt

Jian J Xu

Daniel Alexander Ford

James Christopher Wyllie

John Stewart Best

Prashant Pandey

David Mun-Hien Choy

John Davis Palmer

Chan Y Ng

Robert Wesley Shomler

Krishnakumar Rao Surugucchi

John Earle Lindley

James M Kasson

Oded Cohn

Steven D Gerdt

Bruce Light Hillsberg

Kevin F Smith

Paul W Hunter

Richard K Treiber

Edward Gustav Chron

Joe-Ming Cheng

Hsieh T Hao

Tzongyu Paul Lee

Ramachandran Gopalakrishna Menon

Tram Thi Nguyen

Roger F Hoyt

Larry Joseph Stockmeyer

Clodoaldo Barrera

Narasimhareddy L Annapareddy

Geoffrey Albert Riegel

Michael Reese Jones

Leighton C Wood, Jr

Tore Johan Risch

Calvin Kuo-Lee Tang

Saugata Guha

John Chi-Shing Lui

Lawrence John Garibay

Robert Bruce Brodie

Paul T Burton

Tore Johan Martin Risch

Harsha Ramalingam

Ruth E Cintron

Stephen Goldstein

Jean H Wang Ju

James E Cortney

Windsor Wee Hsu

Protection from uncorrectable media errors are provided for a RAID-configured storage system by a technique in which c redundancy information sectors are associated with n data information sectors. The n data sectors and c redundancy information sectors are then written as a single segment on a single storage unit. The RAID-configured storage system can be configured, for example, as a RAID 6 storage system, a RAID 5 storage system, a RAID 51 storage system, a RAID 3+3 storage system or a RAID N+3 storage system. The redundancy information can be based on a Reed-Solomon code, an XOR-based code, or one-dimensional parity.

Method to protect data on a disk drive from uncorrectable media errors

An intelligent router routes a user request to a storage server that is capable of handling that request natively, without emulation. The request is routed automatically, without any instruction or interaction on the part of the user. The intelligent router includes a storage tank-like computing environment and a set of intelligent routers. The set of intelligent routers appears as a single entity to users by presenting a single network IP address. When the intelligent router receives a request, it examines the protocol type and routes the request to one of the appropriate storage tank clients. The intelligent router does not change the contents of the request message, and thus the storage tank system do not become aware of the existence of the intelligent router. Consequently, any return messages do not need to go through the intelligent router, unless desired.

System and method for efficiently supporting multiple native network protocol implementations in a single system

Provided is a method for managing a network providing Input/Output (I/O) paths between a plurality of host systems and storage volumes in storage systems. An application service connection definition is provided for each connection from a host to a storage volume. At least one service level guarantee definition is provided indicating performance criteria to satisfy service requirements included in at least one service level agreement with at least one customer for network resources. Each service level guarantee definition is associated with at least one application service connection definition. Monitoring is performed as to whether Input/Output (I/O) requests transmitted through the multiple I/O paths satisfy performance criteria indicated in the service level guarantee definition associated with the I/O paths.

Method for managing input/output (I/O) performance between host systems and storage volumes

Stored data can be recovered from a disk array having at least 2n+1 physical disks that are capable of storing n physical disks worth of data when any two disks fail, or when more than two dependent disks fail. Data is stored in data stripes that are divided into n substantially equal-sized strips and are distributed across the n disks. Each data stripe has a corresponding parity strip that is generated by including the data strips in the data stripe only once when the parity strip is generated. The data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are distributed across the disks in such a manner that the data strips of each data stripe, the copy of each such data strip and the corresponding parity strip are each on a respectively different disk of the disk array.

Method and means for tolerating multiple dependent or arbitrary double disk failures in a disk array

A data storage system and method for providing consistent data to multiple clients based on data modification information as existing data is updated and new data is written to the system. The information indicates the modification status of each data block and identifies which data blocks have been modified during a certain time interval. The clients may query and update the modification information by submitting requests through a request processor. The data modification information includes an Altered Block Map that indicates block modification status and a Toggle Block Map that identifies which blocks have been modified. The system further includes a Modification Counter a Pending Reset Counter for improved recognition and handling of the modified data.

Method and system for providing consistent data modification information to clients in a storage system

Systems and methods of increasing the performance of computer networks, especially networks connecting users to the Web, are provided. Performance is increased by reducing the latency the client experiences between sending a request to the server and receiving a response. A connection is obtained by a client device to the network target node addressed by a physical I/O address, to more quickly respond to requests for resource files on data storage devices. This enhancement may be implemented by connecting the controller of the data storage device directly to the network, to reduce the latency involved in mapping the logical I/O address into a physical I/O address. In that case the requested resource file is sent to the client directly by the data storage device controller, thus saving time otherwise spent in sending the request and data between computer network components.

High performance internet storage access scheme

A shared device environment having multiple nodes ( ), each node containing a computer ( ), an adaptor ( ) and multiple storage devices ( ). Adaptors ( ) facilitate read access to storage devices ( ) such that the data records accessed are the latest version data records. Adaptors ( ) are operative to provide the latest version of data blocks requested by computers ( ) by first searching the read cache of each adaptor for data blocks requested by computers ( ). If the requested data blocks are not found in the read cache of any adaptors, then data structures ( and ) within the adaptors are searched for any data blocks waiting to be added to the read cache of any adaptors. If no data blocks are found, then the read access is conducted directly from the storage device itself.

Method and apparatus for processing read requests in a shared disk system

Disclosed is a system for updating data at a data block. A first processing unit, such as an adaptor, receives update data. The data block to update is located in a first storage device, such as a hard disk drive, and a second storage device stores parity data for the data block. A parity group comprises a data block and corresponding parity data for the data block. The first processing unit obtains the data at the data block and calculates partial parity data from the data at the data block and the update data. The first processing unit stores the partial parity data in a storage area and writes the update data to the data block in the first storage device. The first processing unit further updates parity data for parity groups for which partial parity data is maintained by obtaining control of access to the parity group to update from a second processing unit, such as another adaptor, if the first processing unit does not control access to the parity group. When the first processing unit controls access to the parity group, the first processing unit calculates new parity data from the partial parity data and the parity data in the second storage device, and writes the new parity data to the second storage device.

Updating and reading data and parity blocks in a shared disk system

Disclosed is a system for updating data. A first processing unit, such as an adaptor, receives a data update to a data block in a first storage device, such as a hard disk drive. Parity data for the data block is maintained in a second storage device. A parity group is comprised of the data block and the parity data. After determining that the first processing unit does not control access to the parity group including the data block to update, the first processing unit sends a message to a second processing unit, such as another adaptor, controlling access to the parity group requesting control of access to the parity group. The first processing unit determines new parity data from the data update, the data at the data block in the first storage device, and the parity data in the second storage device. The first processing unit then writes the data update to the data block in the first storage device and the new parity data to the second storage device.

Updating data and parity data with and without read caches

Multiple competing processors cooperatively manage access to a shared resource. Each processor separately stores a lock table, listing shared resource subparts, such as memory addresses of a data storage device, for example. The lock tables are stored in nonvolatile storage. In each lock table, each subpart is associated with a &ldquo;state,&rdquo; such as; LOCAL or REMOTE. In response to access requests from the hosts, the processors exchange various messages to cooperatively elect a single processor to have exclusive access to the subparts involved in the access requests. After one processor is elected, the lock-holding processor configures its lock table to show the identified subpart in the LOCAL state, and all non-lock-holding processors configure their lock tables to show the identified subpart in the REMOTE state. Thus, rather than replicating one lock table for all processors, the processors separately maintain lock tables that are coordinated with each other. Importantly, each processor honors its lock table by refraining from accessing a subpart of the shared resource unless the processor's lock table indicates a LOCAL state for that subpart. In one embodiment, optimized for the two processor environment, the messages exchanged by the processors include lock request, lock release, and lock grant messages.

Method for managing concurrent processes using dual locking

A storage-controller-managed outboard incremental backup/restore of data. An indicator is assigned to an associated portion of data stored in a data storage device, wherein the indicator resides in a memory of a storage controller coupled to the data storage device. A value of the indicator residing within the memory of the storage controller is set when the associated portion of the data has changed. The associated portion of the data stored in the data storage device is backed using the storage controller when the value of the indicator residing within the memory of the storage controller is set. The value of the indicator residing within the memory of the storage controller is cleared when the associated portion of the data has been backed up.

Storage-controller-managed outboard incremental backup/restore of data

A method, apparatus, article of manufacture, and a memory structure for storing and retrieving data in physical sectors which are larger than the sector size presented to the user is disclosed. The method comprises the steps of receiving at least one user sector comprising write data, and writing the user sector to a portion of the physical sector of the storage device. In one embodiment, data is written to the data storage disk using existing data that was read from the storage disk for a RAID parity calculation.

Disk arrays using non-standard sector sizes

Disclosed is a system for updating and destaging data in a storage system. To overcome the limitations in the prior art described above, preferred embodiments of the present invention disclose a system for updating a data block in a storage device. A first processing unit receives an update to a data block in a storage device. The first processing unit sends a first message including the update and information indicating data blocks that were recently updated to a second processing unit. The second processing unit stores the update in a second storage area and sends a second message to the first processing unit after receiving the first message. The first processing unit stores the update in a first storage area and transfers the update from the first storage area to the data block in the storage device. The first processing unit transfers the update from the first storage area to the data block in the storage device. Data may be destaged from the first storage area by sending two messages before destage begins and two messages after destaging is completed so the second processing unit is aware of the state of the destaging operations.

System for updating data in a multi-adaptor environment

A data storage facility provides a remote copy operation that copies data write updates from a primary data store to a remote site by identifying which bytes in a block update have changed and sending only the changed bytes from the primary data store to the remote site. An exclusive-OR (XOR) logic operation is used to identify the changed bytes by XOR'ing the original data block with the changed block. Data compression can then be used on the XOR data block to delete the unchanged bytes, and when the compressed block is sent to the remote site, only the unchanged bytes will be sent, thereby reducing the bandwidth needed between the primary store and the remote site.

Delta compressed asynchronous remote copy

Disclosed is a system for altering the structure of parity groups, e.g., altering the RAID level or number of storage devices included in the RAID array. A parity group consists of a set of data blocks and parity data for the data blocks. The data and parity data are stored in at least two storage devices. The first processing unit alters the parity structure of an Nth set of parity groups, wherein N is an integer value greater than or equal to zero. A set of parity groups includes at least one parity group. The second processing unit determines an Nth range of parity groups including the Nth set of parity groups. After detecting the failure of the first processing unit while altering the parity structure of the parity groups in the Nth set, the second processing unit processes the parity groups in the determined Nth range to determine a parity group whose parity structure was being altered when the first processing unit failed.

System for changing the parity structure of a raid array

Growing community of inventors

San Jose, CA, United States of America

Jaishankar Moothedath Menon