International Business Machines Corporation

Servicenow, Inc.

Globalfoundries Inc.

Frank Bernhard Schmuck

Wayne A Sawdon

James Christopher Wyllie

Roger Lee Haskin

Marc M Eshel

Dean Hildebrand

Renu Tewari

Manoj Premanand Naik

Robert J Curran

Deepavali M Bhagwat

Felipe Knop

Yuri L Volobuev

Zvi Yosef Yehudai

Boaz Shmueli

Owen Theodore Anderson

Demyn Lee Plantenberg

M Corneliu Constantinescu

Rajagopol Ananthanarayanan

Karan Gupta

John Michael Marberg

Irit Loy

Ralf Eberhard

Leo S Luan

Chun-Shi Chang

D Scott Guthridge

Enci Zhong

Tseng-Hui Lin

Anthony J Zlotek

Daniel Lloyd McNabb

Boaz Shumeli

Erik Rueger

Prasenjit Sarkar

Rolf Schaefer

Himabindu Pucha

William A Kish

Benjamin Mandler

Leo Shyh-Wei Luan

Kuei-Yu Wang-Knop

Mansi Ajit Shah

Thomas Eugene Engelsiepen

Marc Adam Kaplan

Shankar Balasubramanian

John Lewars

Venkateswara Rao Puvvada

Simon Lorenz

Rajagopal Ananthanarayanan

Sven Oehme

Manfred Haubrich

Hai Zhong Zhou

Sibylle Schaller

John Thomas Olson

Abhishek Jain

Douglas J Griffith

Soumitra Sarkar

Yi Zhou

Theodore Brian Vojnovich

Shah Mohammad Rezaul Islam

Myung Mun Bae

Vasily Tarasov

Martin G Kienzle

Anurag Sharma

Thomas K Clark

Sudhir Gurunandan Rao

Subashini Balachandran

Kalyan C Gunda

Eugene Johnson

Jeremy Andrew Cohn

Brian D Herr

Huzefa Pancha

Radha R Kandadai

Shekhar Amlekar

Brian P Dixon

Jacob Morris Tick

Carol D Hartman

Jon D Reinke

Thomas M Linden

Raymond Edward Rose

Owen T Anderson, Sr

Lei Pan

Demetrios K Michalaros

Shashank Gugnani

Luis Teran

April Brown

Mansi A Shah

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

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

Provided are a computer program product, integrated cache manager, and method for maintaining data in a first level memory and buckets representing regions of memory devices to extend data cache. A plurality of buckets represent distinct regions of memory devices. The buckets are associated with different threshold access count ranges. Data having an access count is stored in one of the buckets associated with a threshold access count range including the access count of the data to store. Data evicted from a first level memory is copied to an initial bucket comprising one of the buckets. Data is moved from a source bucket comprising one of the buckets, including the initial bucket, to a target bucket of the buckets having a target threshold access count range including an access count of the data to move.

Maintaining data in a first level memory and buckets representing regions of memory devices to extend data cache

Provided are a computer program product, system, and method for switching serialization techniques for handling concurrent write requests to a shared file. A first node serializes write requests from client nodes to write to the shared file. The first node determines whether to switch to a second node to manage write quests to the shared file based on a pattern of write requests to the shared file. The client nodes are notified to direct write requests to the shared file to the second node in response to determining to switch to the second node. The second node processes write requests to the shared file to serialize writes to the shared file after the client nodes are notified to submit the write requests to the shared file to the second node.

Switching serialization techniques for handling concurrent write requests to a shared file

A method for executing operation requests includes formatting one or more storage devices and selecting one or more labeled replicas and one or more distinguished replicas, receiving an operation request with respect to a set of data blocks, identifying a preferred replica corresponding to the received operation request, determining whether the replication-pending bits for the preferred replica are set, and executing the received operation request with respect to the corresponding distinguished replica. A method for executing a write operation request additionally includes setting replication-pending bits with respect to the labeled replica, wherein the replication-pending bits indicate an incomplete write request, writing data to both a labeled replica and a distinguished replica, and clearing the replication-pending bits with respect to the labeled replica to indicate the completion of the write operation. A method for executing a read operation additionally includes identifying a preferred replica with respect to the received read request.

Interrupted replicated write recognition

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 monitoring file access activity and generating an audit log based on the file access activity. The method also includes collecting samples of file usage activity, running a pattern recognition algorithm on the samples of the file usage activity for detecting malware activity, and, in response to detecting malware activity, restoring at least one file based on the audit log. 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.

Detection of encrypting malware attacks

Embodiments include a method for fault tolerance in the delivery of event information within a file system cluster. One or more processors to determine event information associated with file system activity performed by a node of the cluster. The one or more processors add the event information to an event log buffer in memory. The one or more processors receive a first log sequence number (LSN) associated with flushing of recovery information from a recovery log buffer. The one or more processors determine the event information in the event log buffer having a log sequence number less than or equal to the first log sequence number, and determining the event information includes log sequence numbers less than or equal to the first log sequence number, the one or more processors flush the corresponding event information from the event log buffer to disk storage.

Reliable delivery of event notifications from a distributed file system

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

One embodiment provides a method for storage management in a hierarchical file system that includes creating a structure for the hierarchical file system including a top-file system and sub-file systems that each include files and directories. Directories for the sub-file systems of the hierarchical file system are tracked. A request for creation of a unique directory in the hierarchical file system is received. Upon a request by a particular sub-file system for more inodes without any inodes available, inode numbers are revoked from at least one other sub-file system having unused inodes.

Global namespace for a hierarchical set of file systems

A method includes integrating a file system recovery log layer in a file system. The file system buffers data in a cyclical manner, and transforms all incoming random requests into a series of synchronous sequential updates. The method determines a length value of a write transaction byte-range for a received write transaction. Upon the length value exceeding a threshold value, data for the write transaction byte-range is written to permanent storage in the file system. Upon the length value being less than the threshold value, the data for the write transaction byte-range is written to a recovery log that is stored in the file system recovery log layer. The threshold value is changed dynamically while the file system is mounted.

Quick initialization of data regions in a distributed storage system

An identification system that may be used in heterogeneous computing environments provides a fail-free path to providing identifiers from a single canonical namespace. Objects or gateways requiring an identifier for access are accessed using an identifier for the canonical namespace. If an entity requests access using an identifier from another namespace, an external database is consulted to determine if a mapping exists for the identifier to another identifier the canonical namespace. If no mapping exists, or the external database is unavailable, then an identifier is automatically generated in the canonical namespace and is used for the access. An internal database is updated with the automatically generated identifier, providing a mechanism to add mappings without administrative intervention. To access resources requiring an identifier from another particular namespace, a canonical namespace identifier may be mapped to another identifier in the particular namespace, or a generic identifier may be used.

Unified user identification with automatic mapping and database absence handling

Embodiments relate to policy-based, multi-scheme data reduction for a computer memory. An aspect includes receiving a plurality of policy rules by a policy engine of the computer memory, wherein a first policy rule specifies applying a first data reduction scheme to data in the computer memory based on the data matching first characteristics, wherein a second policy rule specifies applying a second data reduction scheme to data in the computer memory based on the data matching second characteristics, wherein the first data reduction scheme is different from the second data reduction scheme. Another aspect includes determining, by the policy engine, that first data in the computer memory matches the first characteristics, and that second data in the computer memory matches the second characteristics. Yet another aspect includes applying the first data reduction scheme to the first data, and applying the second data reduction scheme to the second data.

Policy-based, multi-scheme data reduction for computer memory

A computer-implemented method according to one embodiment includes identifying one or more accessible server nodes within a plurality of nodes of a failed clustered system, retrieving a plurality of fragments of configuration data from the one or more accessible server nodes, and constructing a backup state for the failed clustered system, utilizing the plurality of fragments of the configuration data.

Recovering a failed clustered system using configuration data fragments

A method, computer system, and a computer program product for enhanced application write operations is provided. The present invention may include performing a write operation by an application node. The present invention may then include committing the write operation to a local buffer cache. The present invention may then include sending the application node an indication that the write operation was successful. The present invention may then include flushing the local buffer cache to a disk based on a buffer flush trigger, and the present invention may lastly include sending a Remote Procedure Call (RPC) to at least one gateway node, wherein functionality of the gateway node is located on different physical nodes which are separated from the application node over the network.

Enhanced application write performance

Growing community of inventors

Campbell, CA, United States of America

Frank Bernhard Schmuck