Patents by Inventor Sasikanth Eda

Sasikanth Eda has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20190377502
    Abstract: A computer-implemented method according to one embodiment includes identifying an erasure code storage policy for an unified file and object storage system, determining a plurality of storage disks associated with the erasure code storage policy, retrieving disk health parameters for each of the plurality of storage disks, identifying a number of available outer partition storage blocks for each of the plurality of storage disks, and determining a number of erasure code fragments to be stored for a file within the unified file and object storage system before initiating an objectization process on the file, utilizing the disk health parameters for each of the plurality of storage disks and the number of available outer partition storage blocks for each of the plurality of storage disks.
    Type: Application
    Filed: August 21, 2019
    Publication date: December 12, 2019
    Inventors: Sasikanth Eda, Prayas Gupta, Poornima Gupte, Sandeep R. Patil
  • Publication number: 20190370077
    Abstract: A computer-implemented method according to one embodiment includes identifying virtualization unit metadata for each of a plurality of nodes, the virtualization unit metadata including one or more guidelines for an application that is implemented by a virtualization unit, where the one or more guidelines include one or more benefits of a virtualization unit, one or more limitations of the virtualization unit, and one or more operating costs of the virtualization unit; determining, from the plurality of nodes, an optimal node for implementing a computation algorithm based on one or more required computation operations and the virtualization unit metadata for each of the plurality of nodes; and returning an identification of the optimal node.
    Type: Application
    Filed: August 19, 2019
    Publication date: December 5, 2019
    Inventors: Sasikanth Eda, Deepak R. Ghuge, Kaustubh I. Katruwar, Sandeep R. Patil
  • Publication number: 20190370351
    Abstract: A microservice executing in a distributed computing system may receive a request to delete a target object stored in the distributed computing system. The microservice may identify dependent objects for the target object using information received in the request. The microservice may generate a new object that includes the data from the target object and the data from the one or more dependent objects. The new object may be stored in the distributed computing system, and the target object may be removed from the distributed computing system.
    Type: Application
    Filed: June 5, 2018
    Publication date: December 5, 2019
    Inventors: Akshat Mithal, Sandeep R. Patil, Sasikanth Eda
  • Publication number: 20190354403
    Abstract: A method for managing an execution of a workload within a networked computing environment. The method includes at least one computer processor identifying a plurality of objects associated with a workload, the plurality of objects includes a first object. The method further includes identifying information corresponding to one or more one nodes that store an instance of the first object, where the information identifies features of a node. The method further includes identifying an embedded computing entity associated with processing at least the first object. The method further includes deploying an instance of the identified embedded computing entity to a first node that stores an instance of the first object based on information associated with features of the first node. The method further includes executing the workload utilizing the embedded computing entity.
    Type: Application
    Filed: May 18, 2018
    Publication date: November 21, 2019
    Inventors: Phani Kumar V.U. Ayyagari, Sasikanth Eda, Krishnasuri Narayanam, Sukumar Vankadhara
  • Publication number: 20190354619
    Abstract: A computer-implemented method, according to one embodiment, includes: receiving a file operation, and determining a transaction identification which corresponds to the file operation. The transaction identification is used to create a unique queue which corresponds to the file operation. A number of fields included in the unique queue is equal to a number of sub-operations included in a predefined template associated with the file operation. Moreover, the number of fields included in the unique queue are populated as each of the respective number of sub-operations are performed. A determination is made as to whether each of the number of fields in the unique queue have been populated, and the unique queue is sent to a global queue in response to determining that each of the number of fields in the unique queue have been populated.
    Type: Application
    Filed: May 16, 2018
    Publication date: November 21, 2019
    Inventors: Abhishek Jain, William W. Owen, Ashish Pandey, Sandeep Naik, Sasikanth Eda
  • Publication number: 20190354401
    Abstract: A method, computer system, and a computer program product for designing and executing at least one storlet is provided. The present invention may include receiving a plurality of restore operations based on a plurality of data. The present invention may also include identifying a plurality of blocks corresponding to the received plurality of restore operations from the plurality of data. The present invention may then include identifying a plurality of grain packs corresponding with the identified plurality of blocks. The present invention may further include generating a plurality of grain pack index identifications corresponding with the identified plurality of grain packs. The present invention may also include generating at least one storlet based on the generated plurality of grain pack index identifications. The present invention may then include returning a plurality of consolidated objects by executing the generated storlet.
    Type: Application
    Filed: August 1, 2019
    Publication date: November 21, 2019
    Inventors: Sasikanth Eda, Akshat Mithal, Sandeep R. Patil
  • Publication number: 20190342418
    Abstract: A mechanism is provided in a data processing system comprising at least one processor and at least one memory, the at least one memory comprising instructions which are executed by the at least one processor and configure the processor to implement a proxy server for hybrid geo-dispersed erasure coding (EC). Responsive to receiving from an application server a request to write an object, the proxy server in a first storage site splits the object into a plurality of EC slices. The proxy server stores a first EC slice in a first storage device via a storage server local to the proxy server. The proxy server stores a plurality of remaining EC slices in a cache storage local to the proxy server. Responsive to determining that network access is available to disperse the plurality of slices among a plurality of geographically distributed storage sites, the proxy server copies the plurality of remaining EC slices to the plurality of geographically distributed storage sites using geo-dispersed erasure coding.
    Type: Application
    Filed: May 7, 2018
    Publication date: November 7, 2019
    Inventors: Sasikanth Eda, Anbazhagan Mani, Sandeep R. Patil, Ramakrishna Vadla
  • Patent number: 10467424
    Abstract: A filesystem command is sent by a first processor, and for synchronization by a second processor. The filesystem command is directed to a second object of a second filesystem that is synchronized with a first object of a first filesystem. An expression is sent by the first processor to the second filesystem, and for authentication by the second processor. The expression is generated based on a third object of the first filesystems that is synchronized with a fourth object of the second filesystem.
    Type: Grant
    Filed: October 12, 2017
    Date of Patent: November 5, 2019
    Assignee: International Business Machines Corporation
    Inventors: Anbazhagan Mani, Sandeep Patil, Sasikanth Eda, Dileep Dixith
  • Publication number: 20190327777
    Abstract: Embodiments for managing a wireless communication network by one or more processors are described. The presence of a plurality of mobile electronic devices within a wireless communication network is detected. A device-to-device (D2D) connectability score for each of the plurality of mobile electronic devices is calculated. The calculating of the D2D connectability score for each of the plurality of mobile electronic devices is based on a security posture of the respective mobile electronic device, a privacy posture of the respective mobile electronic device, or a combination thereof. A signal representative of the calculated D2D connectability score for each of the plurality of mobile electronic devices is generated.
    Type: Application
    Filed: July 3, 2019
    Publication date: October 24, 2019
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gandhi SIVAKUMAR, Sandeep R. PATIL, Sasikanth EDA, Abhishek JAIN
  • Publication number: 20190310863
    Abstract: Embodiments for managing mobile electronic devices are described. At least one user-device interaction characteristic associated with a first mobile electronic device having a first set of hardware attributes is received. The operation of a second mobile electronic device having a second set of hardware attributes is tuned based on one or more of the at least one of the user-device interaction characteristics, a comparison of the first set of hardware attributes and the second set of hardware attributes, or a combination thereof.
    Type: Application
    Filed: April 6, 2018
    Publication date: October 10, 2019
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Rajan D. MITHANI, Sasikanth EDA, Abhishek JAIN, Deepak GHUGE, Manojkiran EDA
  • Publication number: 20190311742
    Abstract: Systems for location selection based on adjacent location errors are provided. One system includes a monitor module that monitors write numbers for one or more locations on a storage device, wherein a write number in the write numbers describes a number of times a storage device operation has been performed at a location in the one or more locations. Additionally, the system includes an identification module that identifies locations in one or more locations that are susceptible to adjacent location errors, wherein an adjacent location error is an error caused by a storage device operation associated with an adjacent location. Also, the system includes a selection module that selects a location in one or more locations for storing data based on monitored write numbers and identified locations.
    Type: Application
    Filed: April 5, 2018
    Publication date: October 10, 2019
    Inventors: Sasikanth Eda, Deepak Ghuge, Poornima Gupte, Sukumar Vankadhara
  • Publication number: 20190310916
    Abstract: Methods that can dynamically merge parity data for multiple data stripes are provided. One method includes detecting, by a processor, a disk failure in a redundant array of independent disks (RAID) configuration and, in response to detecting the disk failure, merging parity data stored in a plurality of sets of segments in a stripe of the RAID configuration to free space in a set of parity segments of the plurality of sets of segments. Systems and computer program products for performing the method are also provided.
    Type: Application
    Filed: April 6, 2018
    Publication date: October 10, 2019
    Inventors: Kushal Patel, Karve Shrikant Vinod, Sarvesh Patel, Sasikanth Eda
  • Publication number: 20190294618
    Abstract: A computer-implemented method according to one embodiment includes receiving a computation algorithm to be implemented by one of a plurality of nodes, identifying object classification data for objects stored within the plurality of nodes, identifying capability data for each of the plurality of nodes, determining an optimal node for implementing the computation algorithm from the plurality of nodes, based on the object classification data and the capability data, and returning an identification of the optimal node.
    Type: Application
    Filed: June 13, 2019
    Publication date: September 26, 2019
    Inventors: Sasikanth Eda, Deepak R. Ghuge, Kaustubh I. Katruwar, Sandeep R. Patil
  • Patent number: 10402429
    Abstract: A computer-implemented method according to one embodiment includes receiving a computation algorithm to be implemented by one of a plurality of nodes, identifying object classification data for objects stored within the plurality of nodes, identifying capability data for each of the plurality of nodes, determining an optimal node for implementing the computation algorithm from the plurality of nodes, based on the object classification data and the capability data, and returning an identification of the optimal node.
    Type: Grant
    Filed: May 31, 2017
    Date of Patent: September 3, 2019
    Assignee: International Business Machines Corporation
    Inventors: Sasikanth Eda, Deepak R. Ghuge, Kaustubh I. Katruwar, Sandeep R. Patil
  • Patent number: 10390381
    Abstract: Embodiments for managing a wireless communication network by one or more processors are described. The presence of a plurality of mobile electronic devices within a wireless communication network is detected. A device-to-device (D2D) connectability score for each of the plurality of mobile electronic devices is calculated. A signal representative of the calculated D2D connectability score for each of the plurality of mobile electronic devices is generated.
    Type: Grant
    Filed: November 29, 2017
    Date of Patent: August 20, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gandhi Sivakumar, Sandeep R. Patil, Sasikanth Eda, Abhishek Jain
  • Publication number: 20190250832
    Abstract: A method, computer system, and a computer program product for dynamic IO throttling in a storlet environment is provided. The present invention may include receiving, from a user, a computational algorithm. The present invention may also include deploying the received computational algorithm. The present invention may then include determining the user has not engaged throttling based on the deployed computational algorithm. The present invention may further include parsing the computational algorithm based on the engaged throttling. The present invention may include identifying a pipeline operation based on the parsed computational algorithm. The present invention may also include building a timing relation between the identified pipeline operation and an IO operation. The present invention may then include translating a timing lag to a storage IO operation based on the built timing relation.
    Type: Application
    Filed: February 12, 2018
    Publication date: August 15, 2019
    Inventors: Peter A. Balinski, Sasikanth Eda, Ashwin M. Joshi, John T. Olson, Sandeep R. Patil
  • Publication number: 20190251283
    Abstract: A processor may identify a first directory in the UFO 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.
    Type: Application
    Filed: April 29, 2019
    Publication date: August 15, 2019
    Inventors: Sasikanth Eda, Dean Hildebrand, Ashutosh V. Mate, Varun Mittal, William W. Owen, Sandeep R. Patil, Smita J. Raut
  • Patent number: 10380364
    Abstract: A processor may identify a first directory in the UFO 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.
    Type: Grant
    Filed: March 30, 2016
    Date of Patent: August 13, 2019
    Assignee: International Business Machines Corporation
    Inventors: Sasikanth Eda, Dean Hildebrand, Ashutosh V. Mate, Varun Mittal, William W. Owen, Sandeep R. Patil, Smita J. Raut
  • Publication number: 20190243557
    Abstract: A data storage system has multiple tiers of data storage including an upper tier having a lower access latency and a lower tier having a higher access latency. A storage controller of the data storage system implements throttling limits regulating access to data in the data storage system for a plurality of throttling units sharing the data storage system. The storage controller also tracks access frequencies of extents in the data storage system. The storage controller migrates extents among the multiple tiers based on the access frequencies of the extents and the throttling limits implemented for the throttling units.
    Type: Application
    Filed: February 5, 2018
    Publication date: August 8, 2019
    Inventors: ASHWIN M. JOSHI, RAHUL M. FISKE, SANDEEP R. PATIL, SASIKANTH EDA
  • Publication number: 20190243559
    Abstract: A data storage system has multiple tiers of data storage including an upper tier having a lower access latency and a lower tier having a higher access latency. A storage controller of the data storage system receives, via an interface, an access request of a workload for a target file system object, where the target file system object has an associated temperature. In response to the access request for the target file system object, the storage controller accesses the target file system object in the data storage and conditions update of the associated temperature of the target file system object based on at least one of a set including the interface and the workload. The storage controller distributes a collection of file system objects including the target file system object among the multiple tiers based on respective heats of file system objects in the collection.
    Type: Application
    Filed: February 2, 2018
    Publication date: August 8, 2019
    Inventors: SMITA J. RAUT, SANDEEP R. PATIL, SACHIN C. PUNADIKAR, SASIKANTH EDA