International Business Machines Corporation

Google Inc.

Dean Hildebrand

Renu Tewari

Frank Bernhard Schmuck

Manoj Premanand Naik

Marc M Eshel

William W Owen

Sandeep R Patil

Wayne A Sawdon

Deepavali M Bhagwat

Vasily Tarasov

Sasikanth Eda

Riyazahamad Moulasab Shiraguppi

Roger Lee Haskin

Nagapramod S Mandagere

Smita J Raut

Rajagopol Ananthanarayanan

Kalyan Chakravarthy Gunda

Brian Nelson

Grigor Avagyan

Aameek Singh

Rainer Wolafka

Aayush Gupta

Sandip Agarwala

Anna Povzner

Simon Lorenz

Varun Mittal

Ramani Ranjan Routray

Joseph W Dain

Blaine H Dolph

Karan Gupta

James Christopher Wyllie

Wendy Ann Belluomini

Nilesh Prabhakar Bhosale

Himabindu Pucha

Shripad Jayant Nadgowda

Trishali Satish Nayar

Sanjay Vipin Gandhi

Ashutosh V Mate

Mohamed Mohamed

Rajagopal Ananthanarayanan

Robert Engel

Mathias Dietz

Amit Suresh Warke

Evangelos Stavros Eleftheriou

Robert Beverley Basham

Rui Zhang

John Thomas Olson

Kavita Chavda

Sachin Chandrakant Punadikar

Thomas D Weigold

James Hewitt

Mohit Saxena

Slavisa Sarafijanovic

Harold Joseph Roberson, Ii

Venkateswarlu Basyam

Edward H W Lin

Stan Li

Lukas L Rupprecht

A secondary pool of VMs is used to run secondary services or jobs, which may be evicted upon failure of a corresponding primary VM. Upon detection of a failure of a primary resource, the secondary services or jobs are evicted from secondary pool resources, and the secondary pool resources can be automatically allocated to the jobs of the failed primary resource. In this regard, a secondary job may be thought of as a preemptible job and comprises services or jobs that are lower priority than the service or job on the primary resource. By using computing resources in the secondary pool to run secondary or preemptible jobs, this technology makes use of what would be otherwise idle resources. This beneficially avoids having to allocate additional and separate computing resources for secondary jobs, leads to more efficient use of network resources, and reduces costs.

Cost-efficient high-availability multi-single-tenant services

A method includes executing a pool of primary virtual machine (VM) instances, each primary VM instance executing a corresponding individual service instance, and instantiating a shared secondary VM instance. The method includes identifying unavailability of a particular primary VM instance of the pool of primary VM instances, and causing the corresponding individual service instance executing on the particular primary VM instance to failover to the shared secondary VM instance to commence executing the corresponding individual service instance. The method includes, after the failover to the shared secondary VM instance, determining a difference between a current resource level of the shared secondary VM instance and a target resource level associated with the corresponding individual service instance, and adjusting the current resource level of the secondary VM instance based on the difference.

High availability multi-single-tenant services

A method () of maintaining availability of service instances () on a distributed system () includes executing a pool of primary virtual machine (VM) instances (P), each primary VM instance executing a corresponding individual service instance and including a rate of unavailability. The method also includes determining a number of secondary VM instances (S) required to maintain availability of the individual service instances when one or more of the primary VM instances are unavailable based on the number of primary VM instances in the pool of primary VM instances and the rate of unavailability. The method also includes instantiating a pool of secondary VM instances based on the number of secondary VM instances required to maintain availability of the individual service instances.

A computer-implemented method according to one embodiment includes in response to identifying a match between a file and at least one policy, updating details of a container in an object namespace of a file system, where the object namespace of the file system stores object-based representations of files within the file system; creating a symbolic link to the file in the object namespace of the file system; and updating a database to identify the symbolic link and the details of the container.

System and methods for dynamic generation of object storage datasets from existing file datasets

A processor may identify a first directory in the storage system. The first directory may include one or more subdirectories in one or more levels under the first directory. The one or more subdirectories may include a second directory that has includes one or more objects. The first directory may be associated with a first inode, and the second directory may be associated with a second inode. The processor may perform a stat call on the second directory to determine metadata attributes for the one or more objects that are stored in the second directory. The metadata attributes for the one or more objects may be stored in the second inode. The processor may add the metadata attributes for the one or more objects to the first inode.

Unified file and object storage architecture for clustered file systems

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

Embodiments for namespace management between storage systems by a processor. Events, containing metadata associated with an operation, from a plurality of heterogeneous storage systems may be received such that the events are indexed into a common repository according to the metadata to maintain a single namespace for data in the plurality of heterogeneous storage systems.

Global namespace in a heterogeneous storage system environment

A computed-implemented method is provided for generating object storage datasets from file datasets. The computed-implemented method includes analyzing entries of a file system to identify a file and checking the file against at least one policy. In response to identifying a match between the file and the at least one policy, details of a container are updated. A symbolic link to the file is created to allow access of the file by an object-based client. Updating the details of the container includes updating a database such that the database identifies at least one of the created symbolic link and the details of the container.

In one general embodiment, a computer-implemented method includes analyzing a plurality of data management factors within an object-based storage system, including tracking which of a plurality of proxy servers within the object-based storage system currently holds a lock; determining a data management policy for predetermined data within the object-based storage system, based on the analyzing, including identifying a current location of the lock within one of the plurality of proxy servers within the object-based storage system; and sharing the data management policy for the predetermined data, including the current location of the lock within the object-based storage system, with a load balancer associated with the object-based storage system.

Sharing a data management policy with a load balancer

Embodiments relate to a computer system, computer program product, and method to support context aware container volume management. Two or more containers are operatively coupled to a shared operating system instance. Workflow and system topologies directed at the containers are modeled. The workflow models transition states of containers. The container topology model identifies relationships between two more containers. The storage topology model identifies a relationship and dependency of storage volumes. The models are leveraged to assess and autonomously determine functional container storage requirements. Assignment(s) of an application container to a volume is optimized and selectively attached responsive to the autonomous determination.

Context aware container management

Embodiments relate to a computer system, computer program product, and method to process files, and specifically, to support read and write requests of a multi-object file. Upon receipt of a file, a computer system parses the file into two or more logical objects. Each logical object has an associated or inherent characteristic. Each of the logical objects is matched to a storage tier in a multi-tier storage array. Each logical object is then assigned to a tier based on one or more object characteristics in the matched storage tier, and stored in a decomposed format.

Format aware file system with file-to-object decomposition

Embodiments of the invention relate to small write performance enhancements for parallel file systems. One embodiment includes flushing a received write transaction from a first memory device to a second memory device on a node in a file system based on one or more byte-ranges within a file system block. It is determined to flush the received write transaction to a recovery log that is stored in a non-volatile storage layer of the file system. If it is determined to flush the received write transaction to the recovery log: appending data associated with the received write transaction in the recovery log of the file system, replicating the data associated with the received write transaction in another non-volatile storage layer of another node if required, and marking the one or more byte-ranges as committed.

Buffering and replicating data written to a distributed storage system

Growing community of inventors

Bellingham, WA, United States of America

Dean Hildebrand