International Business Machines Corporation

Lenovo (singapore) Pte. Ltd.

D Scott Guthridge

Frank Bernhard Schmuck

Ralph Attila Becker-Szendy

James Christopher Wyllie

John Lewars

Veera W Deenadhayalan

Bulent Abali

Deepavali M Bhagwat

Wayne Alan Downer

Owen Theodore Anderson

Gerrit Huizenga

Enci Zhong

Xin Wang

Richard Edwin Harper

Robert Michael Rees

Linda Ann Riedle

Mohammad Banikazemi

Marc M Eshel

Felipe Knop

Vasily Tarasov

Dan Edward Poff

Gary Valentin

Rong Zeng

James W Arendt

Rajagopal Ananthanarayanan

Lin Feng Shen

Jeremy Andrew Cohn

Peter Alexander Manson

Jonathan Terner

Ziv Rafalovich

Hai Zhong Zhou

Harry B Marr, Jr

Lei Pan

Nancy M Wei

Shashank Gugnani

Chandrasekhar Pulamarasetti

Kyle Gerhard Grieser

A computer-implemented method, according to one approach, includes performing a predetermined first data merge process in response to a determination that a version conflict exists between a plurality of versions of a data file resulting from editing performed on different cloud devices. The predetermined first data merge process includes determining a first merging policy of the data file from a plurality of potential merging policies, determining a plugin associated with the data file, and calling the plugin. The first merging policy is used as an input for the plugin, and the plugin includes predetermined conditions for determining first contents of the versions of the data file to exclude from a merge operation performed on the data file and second contents of the versions of the data file to include in the merge operation.

Calling a plugin and using a merging policy for mitigating version conflicts

A computer-implemented method, according to one embodiment, includes receiving, by a server from a client application, a read request for a data block. The method further includes, reading, by the server, data of the data block and checksums associated with the data block, from a data storage drive, and storing, by the server, the data of the data block and the associated checksums in a buffer. A client node is caused, by the server, to use the associated checksums to perform a validity check for the data of the data block and a transmission from the server to the client node. A computer program product, according to another embodiment, includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and/or executable by a server to cause the server to perform the foregoing method.

Offloading a validity check for a data block from a server to be performed by a client node

Computer technology for use with a computer data storage system including a plurality of client computers and a plurality of collector nodes. A file consists of data blocks with each block resides on one of the persistent storage device. Data received at client computers are buffered and then transferred to selected collector nodes depending on which data blocks the data belong to. Location-aware collector node selection is performed by selecting collector nodes, from the plurality of collector nodes, by querying a file system allocation subsystem to determine selected collector nodes for the given data block that owns a persistent storage device on which the given block is allocated. Data for each data block is then sent to and stored in its selected collector nodes.

Write sharing method for a cluster filesystem

A method and a computer system for asymmetric replication of data are provided. Storage of a set of data is organized as a first copy and as a second copy in non-volatile storage. The second copy is reliable and stored so as to be readable at a speed slower than for the first copy. A read instruction regarding the set of data is received and performed preferentially via the first copy such that the asymmetric replication achieves enhanced performance speed. A request to execute a write operation is received. The write operation is executed to the first copy and to the second copy. In response to determining that the write operation to the first copy was unsuccessful, a label for the first copy is set as stale.

Efficient use of optional fast replicas via asymmetric replication

A computer-implemented method includes using a cache replacement algorithm to forcefully evict target data from a cache. Using the cache replacement algorithm includes selectively accessing data in the cache. A computer program product includes one or more computer readable storage media and program instructions collectively stored on the one or more computer readable storage media. The program instructions include program instructions to perform the foregoing method. A system includes a processor and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor. The logic is configured to perform the foregoing method.

Fine-grained forced cache eviction

Embodiments of the invention relate to accessing data that spans multiple storage devices in a storage system. A first index records identifiers of data blocks and their storage locations, and a second index records storage locations. An update request is processed by writing multiple copies of a received data block identifier and the updated data block to storage locations recorded in the second index. A read request is processed by performing a quorum read of the storage locations recorded in the second index to retrieve the updated data blocks. The processing of the read request also includes performing a quorum read of the first index to determine storage locations that contain data blocks to be read as part of processing the read request. The data blocks to be read exclude the updated data blocks.

Accessing data in a storage system

Embodiments of the invention relate to calculation of error rate for data storage which includes determining a completion status of a read operation of data stored in a storage device, the completion status being one of at least partially complete or not complete. The fault monitoring count is incremented based on the completion status being not complete. The fault monitoring count is decreased based on the completion status being at least partially complete. The fault monitoring count being decreased according to a value based on the number of bytes successfully read. The error rate indicator value is being calculated based on an exponential decay rate related to the number of bytes read. The fault monitoring count threshold is monitored every time the fault monitoring count is incremented and the storage device is identified as faulty once the threshold limit is exceeded.

Error rate threshold for storage of data

A data validation method comprises associating a validation chunk with one or more data chunks stored on one or more storage mediums. The validation chunk comprises validation information for verifying whether data recorded in a subdivision of the one or more data chunks is lost. A request is received for an operation to be performed on first data stored in a first subdivision of a first data chunk from among said one or more data chunks. One or more portions of the validation information are examined to determine whether the data recorded in said first subdivision is deemed to be lost.

Monitoring lost data in a storage system

This disclosure relates to parity declustered storage device arrays having partition groups. In an exemplary embodiment, the storage system includes a storage device array, such as disk array. Each storage device is divided into partitions. Each partition includes stripe units, such as hundreds or thousands of stripe units in exemplary embodiments. The storage system also includes a physical array controller coupled to the storage device array. In an exemplary embodiment, the array controller includes a partition group lookup table and stores and retrieves data and parity in the storage devices based on the partition group lookup table. In this exemplary embodiment, the array controller also includes a stripe lookup table and/or a log. In an exemplary embodiment, the partition group lookup table and the stripe lookup table take up less memory (e.g., by an order of magnitude) than a single-level stripe map conveying the same information.

Parity declustered storage device array with partition groups

Two methods (native and clone) are used for installing software, such as an operating system, on client system(s) booting from shared storage. The native installation method configures an interconnection network to create an exclusive communication zone between the client system and the shared storage system and installs the operating system on the client system using the exclusive communication zone. After the software is installed, the method terminates the exclusive communication zone. The clone installation method utilizes a point-in-time copy feature of the shared storage system to clone an operating system drive instantaneously. After the drive is cloned, it is logically attached to a new client and the operating system is customized for that client.

Method for installing operating system on remote storage: flash deploy and install zone

A multi-fan apparatus and method incorporates mutual active cancellation of fan noise and/or vibrations. The multi-fan apparatus includes two or more fans circuits, each comprising a fan, a fan speed controller and a separate tachometer, and a fan phase controller. The phase controller is connected to at least one fan speed controller and to each tachometer. Each fan's speed is independently and dynamically maintained at the same set speed by the fan speed controllers using an independent control loops. A noise and/or vibration cancellation phase difference between fans is determined in order to achieve destructive interference of pressure waves and, thus, noise and/or vibration reduction, in pre-determined region of a system incorporating the multi-fan apparatus. The phase controller establishes and maintains this cancellation phase difference between the fans based upon feedback from the tachometers.

Mutual active cancellation of fan noise and vibration

A method and system for asserting a lock in a distributed file system is provided. All distributed locks have a lease for a limited time period, wherein the lease may be renewed periodically. A lock manager data structure is provided to maintain mode compatibility of locks granted to different client nodes for the same object. The process of acquiring or reasserting a lock includes determining whether there are other valid locks in use, as well as whether a valid lock is in operation in a conflicting or compatible mode with a requested lock. A new lock lease may be granted and a lock lease which has expired may be reasserted if a conflicting lease is not present.

Discipline for lock reassertion in a distributed file system

In a multiprocessor system, a method for dynamically establishing an I/O path between a processor node and an I/O device for routing data there between. The method starts with providing a configuration graph. The graph has objects associated with elements (devices) of the system and links connecting the objects. The node is identified, and links are then followed in the graph from an object associated with the I/O device to an object associated with a node. If multiple I/O paths exist and an optimal path is desired, the method includes providing in the links routing information containing nodes that can be directly reached via the link. Links are then followed, if possible, whose routing information contains the identified node. If no link having such routing information exists at an object along the path, then another link is chosen having routing information containing another node. This other link may be chosen in a round robin manner if there are multiple links to choose from. If multiple links having such routing information exist at an object along the path, then one of the links is chosen in a round robin manner. The method may also be used in uniprocessor systems such as a system with a one-processor node for simply establishing multiple paths to provide fault tolerance.

Method for routing I/O data in a multiprocessor system having a non-uniform memory access architecture

A method for configuring devices within a computer system provides device configuration information for types of devices that may be included within the computer system. The device configuration information for a device type includes interface types by which devices of that device type connect to other devices. The method includes determining the interface types of a current object associated with a device. Device types that can exist on a determined interface type of the current object are probed for. A child object is created for a device found from the probing and a link between the current object and the child object is also created. A child object is then made the current object, and the above actions are repeated at least until the devices to be configured within the system have associated objects linked together.

Growing community of inventors

San Jose, CA, United States of America

D Scott Guthridge