International Business Machines Corporation

Globalfoundries Inc.

Duane Mark Baldwin

Sandeep R Patil

John Thomas Olson

Riyazahamad Moulasab Shiraguppi

Sasikanth Eda

David Lynn Merbach

Prashant Sodhiya

William Roy Yonker

Gregory John Tevis

Nilesh Prabhakar Bhosale

Allen Robert Heitman

Gregory John Knight

Sachin Chandrakant Punadikar

Clodoaldo Barrera

Nataraj Nagaratnam

Abhishek Dave

Raymond M Li

Hans Hanhsia Lin

Gandhi Sivakumar

Gail Andrea Spear

Deepak R Ghuge

James P Allen

Mihail Corneliu Constantinescu

Daniel Graham Douglas

Robert G Kovacs

Michael L Lamb

Guang Ya Liu

Smita J Raut

Raymond M Swank

Sandeep Bazar

Zhengwen He

Igor Chirashnya

Gary Thomas Axberg

Eran Rom

David W Groves

Douglas Paul Dunham

Nancy Lott Hobbs

Paul Lawrence Bradshaw

Sharad Mishra

Kirill Shoikhet

Vincent Jomartin Hoang

Vinh-Thuan Nguyen-Phuc

Lisa Anne Huston

Robert Bruce Nicholson

Greg Knight

James Horan Carey

Roman David Druker

Sean P Cudmore

Barbara J Camacho

Alireza Razzaghi Daryan

Ron H Clark

Amir Nakhforoush

Uma Devi Immaneni

Irfan Asif Habib

Milhail C Constantinescu

William Allen Medlyn

A middleware at a proxy node may cause a copy of a data object stored on a storage node to be updated. Copies of the data object may be stored on a plurality of storage nodes located in first and second geographic locations. A first processing activity for a storage node that corresponds with the application category of the data object may be determined. A first storage node may be selected for a first update based on being associated with the first processing activity in a first proportion. The copy of the data object stored at the first storage node may be updated before updating a copy of the data object stored at a second storage node. The second storage node may be associated with the first processing activity in a second proportion, with the second proportion being less than the first proportion.

Replication optimization for object storage environments

An embodiment of the invention may include a method, computer program product and system for optimizing data defragmentation. The embodiment may include collecting details related to contiguous storage space available on a disk drive. The embodiment may include identifying a type of object storage implementation utilized on the disk drive. The type of object storage implementation is based on how an object is stored within the disk drive. The embodiment may include identifying an important component of the object. The important component of the object is determined by a frequency of access. The embodiment may include identifying a non-important component of the object. The non-important component of the object is determined by a frequency of access. The embodiment may include moving the important component to an outer sector of the disk drive. The embodiment may include moving the non-important component to an inner sector of the disk drive.

Optimized performance through leveraging appropriate disk sectors for defragmentation in an erasure coded heterogeneous object storage cloud

A system and method dynamically transitions the file system role of compute nodes in a distributed clustered file system for an object that includes an embedded compute engine (a storlet). Embodiments of the invention overcome prior art problems of a storlet in a distributed storage system with a storlet engine having a dynamic role module which dynamically assigns or changes a file system role served by the node to a role which is more optimally suited for a computation operation in the storlet. The role assignment is made based on a classification of the computation operation and the appropriate filesystem role that matches computation operation. For example, a role could be assigned which helps reduce storage needs, communication resources, etc.

Dynamically transitioning the file system role of compute nodes for provisioning a storlet

A present invention embodiment manages resources of a distributed system to perform computational tasks within a specified time interval. A received object is classified into a type of computational processing, and a quantity of objects is maintained for each type. An execution time for processing a single object is estimated based on a corresponding computation resource template. A total execution time for the quantity of objects of a type of computational processing is determined based on the estimated execution time. In response to the total execution time exceeding a user-specified time interval, an amount of resources of the distributed system is determined to process the quantity of objects of the type within the user-specified time interval. Nodes of the distributed system with objects classified in the type use the determined amount of resources to process the quantity of objects for the type within the user-specified time interval.

Time frame bounded execution of computational algorithms

Provided are a computer program product, system, and method for defragmenting files having file blocks in multiple point-in-time copies. Multiple point-in-time copies for a file having file blocks ap. Maintained. Each point-in-time copy to the file has at least one different block in the storage for at least one of the file blocks in the file. For each of a plurality of the point-in-time copies for the file, moving the blocks for the file blocks in the point-in-time copy to contiguous locations on the storage.

Defragmenting files having file blocks in multiple point-in-time copies

A computer-implemented method according to one embodiment includes receiving a request to share predetermined data with a device, identifying the predetermined data as sensitive, calculating a current security level for the device, and conditionally sharing the predetermined data with the device, based on the current security level for the device.

Implementing data security within a synchronization and sharing environment

An embodiment of the invention may include a method, computer program product and system for optimizing a wide area network caching infrastructure in a file based object storage architecture. The embodiment may include creating, by a parent partition, a heat map. The embodiment may include prioritizing prefetching by multiple dependent partitions based on the heat map. In response to prioritized prefetching by the multiple dependent partitions, the embodiment may include allocating wide area network caching threads. The embodiment may include providing, by the parent partition, objects for prefetching by the multiple dependent partitions utilizing the allocated wide area network caching threads.

Modified consistency hashing rings for object store controlled WAN cache infrastructure

Embodiments of the present invention disclose methods and systems for object storage. Migration policies and an algorithm applied by the module facilitates the migration of files (i.e., object replicas or erasure code fragments) from one storage to another storage. The FILE_HEAT is monitored over a period of time. If the FILE_HEAT of a file increases over a period of time relative to the other files, the file is migrated to a higher level storage. Files can be migrated to a higher level storage even if the FILE_HEAT of a file decreases over a period of time.

Object storage architecture based on file_heat

In one embodiment, a method for creating an object includes creating an object in an object store making use of a file system, obtaining an index node (inode) identifier (ID) for an inode associated with the object, creating an object ID for the object, wherein the object ID is unique from any other object IDs in the object store, merging the object ID with the inode ID, and modifying the inode to include at least the object ID. In another embodiment, a system includes a processor and logic integrated with and/or executable by the processor, the logic being configured to: create an object in an object store making use of a file system, obtain an inode ID for an inode associated with the object, create an object ID for the object, the object ID including the inode and modify the inode to include at least the object ID.

Accelerated access to objects in an object store implemented utilizing a file storage system

Methods, systems, and computer program products are provided for optimizing selection of files for eviction from a first storage pool to free up a predetermined amount of space in the first storage pool. A method includes analyzing an effective space occupied by each file of a plurality of files in the first storage pool, selecting one or more of the plurality of files as one or more candidate files for eviction, based on the identified one or more data blocks, and evicting the one or more candidate files for eviction from the first storage pool to a second storage pool.

Methods and systems for data cleanup using physical image of files on storage devices

Growing community of inventors

Mantorville, MN, United States of America

Duane Mark Baldwin