International Business Machines Corporation

Hewlett-packard Development Company, L.P.

Hewlett-packard Company

Google Inc.

Lance Warren Russell

Rajeev Kumar Mishra

Vinit Jain

David Jones Craft

Eric Philip Fried

Rong Zeng

Erik Rueger

Fong Pong

Tung M Nguyen

Rainer Wolafka

William Boyd Brown

Murali Vaddagiri

Poornima Gupte

Frank Marschollek

Perinkulam I Ganesh

Thomas Stanley Mathews

Lu Xu

Arunachalam Ganapathy

Christof Schmitt

Trishali Satish Nayar

Shyamal Chowdhury

Michael Norman Day

Matthew Albert Huras

Shmuel Ben-Yehuda

Dan S Pelleg

Stephen P Morgan

Kenneth Mark Wilson

Thomas Allen Snellgrove

Carlos Enrique Ortiz

Cheryl L Jennings

Jessie Ann Haug

Larry Steven Wise

Ludmila Cherkasova

Joseph L Hellerstein

Maheswaran Surendra

Ravi Shankar

James P Allen

Todd W Mummert

Benjamin Clay Reed

Dean J Burdick

Wenting Tang

Sivakumar Krishnasamy

Noshir Cavas Wadia

Steven E Froehlich

Mukund Raghavachari

David Richard Marquardt

Marc Joel Stephenson

Suresh Sabarathinam

Peng Ye

Satyanarayana B Rao

James Britt Partridge

Leo Yue Yeung

Donald Edwin Wood

Stephen J Tovcimak

Edwin Richie Lassettre

Lawrence S Hsiung

Srikanth Vishwanathan

Srikrishan Malik

Shevaun M Fontenot

Krishnan Uma

Daniel Cletus Gillen

Derwin DeLon Gavin

Eldon Perry Smith

Gregory Scott Joyce

Daniel Edward Badt

Satish Narayan Kharat

David Wiley Coleman

Matthew J Kalos

Itzhack Goldberg

Gail Andrea Spear

Neil Sondhi

John Thomas Olson

Mallikarjunan Mahalingam

Alberto J Munoz

Gary Roy Shippy

Michael Diederich

Chris Alan Schwendiman

Stephen M Tee

Saurabh Desai

Ranadip Das

Richard Lee Verburg

Edward Shvartsman

Kyusun Chang

Lynn Erich Petersen

Kevin Lynn Fought

Joe Wayne Blackard

Danling Shi

Matthew Todd Brandyberry

Monty Christoph Poppe

Uwe Fiebrich-Kandler

George Oliver Penokie

Paul David Mazzurana

Stephen L Hoyle

Richard Adams Gillaspy

Peggy PakFan Dixon

Lon E Hall

Cheryl L Hall

Thomas Wylegala

Frank Broede

Dejan S Miloiicic

A computer program product is provided for extending network services addresses, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, where the program instructions are executable by a processor to cause the processor to identify, by the processor, an event affecting a node, wherein the node provides external access to a network using an Internet Protocol (IP) address, in response to identifying the event, identify, by the processor, an attribute associated with the IP address, and based on the attribute associated with the IP address, determine, by the processor, whether to move the IP address to another node.

Cluster file system support for extended network service addresses

A computer program product is provided for extending a clustered file system. The computer program product comprises a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a processor to cause the processor to build a central cluster repository, establish a service-specific interface for accessing non-file system data in the central cluster repository, and extend a clustered file system with the service-specific interface.

Maintaining service configuration consistency across nodes of a clustered file system

A computer-implemented method according to one embodiment includes receiving, via an interface of a clustered file system, callback registration information from an external service, identifying a plurality of parameters associated with the callback registration information, constructing a service registration within the clustered file system, based on the plurality of parameters, identifying the service registration in response to an occurrence of one or more events, and performing one or more callbacks, according to the service registration.

Integrating external services with a clustered file system

A mechanism is provided in a data processing system for data integrity and acceleration in compressed storage environments in combination with software defined native redundant array of independent disks (RAID). The mechanism receives a data portion to write to storage and divides the data portion into a plurality of chunks. The mechanism performs real-time compression on a given chunk within the plurality of chunks and determines a compression rate for the given chunk. The mechanism determines a RAID level for the given chunk based on a value of the compression rate and stores the given chunk based on the determined RAID level.

Data integrity and acceleration in compressed storage environments in combination with software defined native RAID

A computer program product is provided for extending network services addresses, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, where the program instructions are executable by a processor to cause the processor to identify, by the processor, a network event affecting a node of a network, wherein the node provides external access to the network using an Internet Protocol (IP) address, in response to identifying the network event, identify, by the processor, an attribute associated with the IP address, and based on the attribute associated with the IP address, determine, by the processor, whether to move the IP address to another node of the network.

A computer program product is provided for extending a clustered file system. The computer program product comprises a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a processor to cause the processor to define functions required by external services implemented on top of a clustered file system, identify at least one function that is not provided by the clustered file system, and extend the clustered file system to provide the at least one function.

A coding scheme for coding 'code constructs' (for example, alphanumeric characters) into 'bit sequences,' where at least one of the code constructs is assigned at least two different bit sequences (that is, a first bit sequence and a second bit sequence). This is sometimes referred to herein as &#x201c;alternative codings for a single code construct.&#x201d; In some embodiments, at least one of the alternative codings includes bits that can be used for error detection and/or correction. In some embodiments, the code scheme will be similar to a pre-existing code scheme that does not have alternative codings for a single code construct so that the alternative-codings coding scheme is back compatible with data encoded under the pre-existing coding scheme.

Coding schemes including alternative codings for a single code construct

A computer program product is provided for extending network services addresses. The computer program product comprises a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to identify a network event affecting a node of a sub-cluster of nodes of a network, wherein the node provides external access to the network using an Internet Protocol (IP) address. The program instructions are also executable by the processor to cause the processor to, in response to identifying the network event, identify an attribute associated with the IP address of the node. Finally, the program instructions are executable by the processor to cause the processor to, based on the attribute associated with the IP address of the node, determine whether to move the IP address of the node to another node of the sub-cluster.

A mechanism is provided in a data processing system for elastic data storage management in a storage network. A data storage system manager in the data processing system monitors remaining free space of a plurality of data storage systems. The data storage system manager determines a rate of change of remaining free space of each data storage system. Responsive to determining that the remaining free space or rate of change of remaining free space of at least one data storage exceeds a threshold, the data storage system manager determines an amount to expand or shrink a given data storage system in the storage network. The data storage system manager configures data storage allocation to expand or shrink the given data storage system by the determined amount.

Elastic file system management in storage cloud environments

A mechanism is provided for object-based storage management. A detection is made of an event being performed on or by the object. A determination is made as to whether the event meets with one or more rules in a set of rules that identify a backup or replication needing to be performed. Responsive to determining that the event meets with one or more rules in the set of rules that identify the backup or replication needing to be performed, an indication is made in a backup/replication field in metadata of the object that the backup and/or replication of the object needs to be performed. The indication in the backup/replication field in the metadata of the object causes one or more portions of the object to be backed up and/or replicated.

Object-based storage management

A mechanism is provided a data processing system for protocol servicing in network-attached storage. A protocol service executing in the data processing system in a clustered file system establishes a high priority recovery thread. The high priority recovery thread monitors health counters that count total requests in and total requests out for a client accessing a network-attached storage device via the protocol service. The high priority recovery thread determines a category of health of the protocol service based on the health counters. The mechanism takes corrective action based on the category of health of the protocol service.

Highly resilient protocol servicing in network-attached storage

A mechanism is provided in a data processing system for securing data integrity in de-duplicated storage environments in combination with software defined native redundant array of independent disks (RAID). The mechanism receives a data portion to write to storage, divides the data portion into a plurality of chunks, and identifies a given chunk within the plurality of chunks for de-duplication. The mechanism increment a de-duplication counter for the given chunk and determines a RAID level for the given chunk based on a value of the de-duplication counter. The mechanism stores the given chunk based on the determined RAID level.

Protecting data integrity in de-duplicated storage environments in combination with software defined native raid

A mechanism is provided in a data processing system for unobtrusive failover in a clustered file system. A node in the clustered file system periodically monitors publicized resource events from a cluster manager in the clustered file system for a triggering event that triggers a grace period. Responsive to detecting a triggering event, the node enters a grace period without restarting. During the grace period, the node processes a state request from a first client.

Unobtrusive failover in clustered network-attached storage

Growing community of inventors

Rosanky, TX, United States of America

Lance Warren Russell