Patents by Inventor Mohit Saxena

Mohit Saxena 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: 20240104424
    Abstract: The present disclosure involves systems, software, and computer implemented methods for an artificial intelligence work center for ERP data. One example method includes receiving scenario and model settings for an artificial intelligence model for a predictive scenario. A copy of the dataset is processed based on settings to generate a prepared dataset that is provided with the settings to a predictive analytical library. A trained model trained and evaluation data for the trained model is received from the predictive analytical library. A request is received to generate a prediction for the predictive scenario for a target field for a record of the dataset. The record of the dataset is provided to the trained model and a prediction for the target field for the record the dataset is received from the model. The prediction is included for presentation in a user interface that displays information from the dataset.
    Type: Application
    Filed: September 23, 2022
    Publication date: March 28, 2024
    Inventors: Mohit V. Gadkari, Ankur Malik, Sunil S. Parvatikar, Simona Marincei, Dalibor Knis, Anirudh Prasad, Kopal Jauhari, Saurabh Saxena, Yatish Nagaraja, Pankaj Kumar Agrawal, Long Qian, Varun Verma
  • Patent number: 11119977
    Abstract: Cognitive compression with varying structural granularities in a NoSQL database by establishing a data training set for compressing and decompressing data stored within the NoSQL database. The data training set includes received user policy goals, compression parameters, and metered feedback associated with data usage and workload characteristics. A compression parameter model is dynamically implemented in real-time for the data selected according to the established data training set to compress and decompress the data at a given structural granularity.
    Type: Grant
    Filed: May 2, 2019
    Date of Patent: September 14, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Sangeetha Seshadri, Mohit Saxena
  • Patent number: 11068465
    Abstract: In one embodiment, a computer-implemented method for object-granular policy assignment in an object storage environment includes: automatically assigning a plurality of objects stored within the object storage environment to one or more policies; and locating one or more of the objects among a plurality of policy rings within the object storage environment based on semantics of the one or more policies. A virtual namespace maps each object to at least one of the policy rings based on the one or more policies assigned to the object; and the virtual namespace is scalable with a number of the plurality of objects stored within the object storage environment. Corresponding systems and computer program products are also disclosed.
    Type: Grant
    Filed: June 27, 2018
    Date of Patent: July 20, 2021
    Assignee: International Business Machines Corporation
    Inventors: Nagapramod S. Mandagere, Mohit Saxena
  • Publication number: 20200349108
    Abstract: Cognitive compression with varying structural granularities in a NoSQL database by establishing a data training set for compressing and decompressing data stored within the NoSQL database. The data training set includes received user policy goals, compression parameters, and metered feedback associated with data usage and workload characteristics. A compression parameter model is dynamically implemented in real-time for the data selected according to the established data training set to compress and decompress the data at a given structural granularity.
    Type: Application
    Filed: May 2, 2019
    Publication date: November 5, 2020
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Sangeetha SESHADRI, Mohit SAXENA
  • Patent number: 10817390
    Abstract: A transactional memory system uses a volatile memory as primary storage for transactions. Data is selectively stored in a non-volatile memory to impart durability to the transactional memory system to allow the transactional memory system to be restored to a consistent state in the event of data loss to the volatile memory.
    Type: Grant
    Filed: September 14, 2011
    Date of Patent: October 27, 2020
    Assignee: Hewlett Packard Enterprise Development LP
    Inventors: Mehul A. Shah, Stavros Hartzopoulos, Arif A. Merchant, Mohit Saxena
  • Patent number: 10740184
    Abstract: A method for recovering data for a file system includes a journal-less recovery process that detects one or more inconsistencies for file system blocks upon a system failure based on one or more comparisons of information for the file system blocks.
    Type: Grant
    Filed: December 20, 2018
    Date of Patent: August 11, 2020
    Assignee: International Business Machines Corporation
    Inventors: Prasenjit Sarkar, Mohit Saxena
  • Patent number: 10725976
    Abstract: The embodiments relate to performing a write operation in a filesystem. Replica files embedded with respective sets of data are stored are on persistent storage local to replica nodes of the filesystem. The storage includes atomically updating the replica files to the replica nodes. Each set of data has information for self-characterizing each replica file. A map stored at persistent storage local to a remote node is updated. The map maintains information for identifying each replica file stored at each replica node.
    Type: Grant
    Filed: October 5, 2018
    Date of Patent: July 28, 2020
    Assignee: International Business Machines Corporation
    Inventor: Mohit Saxena
  • Patent number: 10678481
    Abstract: In various embodiments, computer-implemented techniques for improving function of in-memory processing systems via adaptively caching datasets include: identifying data stored in a distributed filesystem, the data including data to be processed by an in-memory processing application and data not to be processed by the in-memory processing application; identifying one or more partitions of the data corresponding to the data to be processed; and selectively transferring the one or more partitions from the distributed filesystem to a memory of the in-memory processing application. Corresponding systems and computer-program products are also disclosed.
    Type: Grant
    Filed: April 11, 2018
    Date of Patent: June 9, 2020
    Assignee: International Business Machines Corporation
    Inventors: Lawrence Y. Chiu, Mohit Saxena, Erci Xu
  • Patent number: 10628311
    Abstract: In one embodiment, a computer-implemented method includes selecting a cache block descriptor (CBD) from amongst a plurality of CBDs stored to a cache storage device to defragment based on a determination of utilization of a particular fine block descriptor (FBD) having a first size that is allocated to the selected CBD. The cache storage device includes a free pool of FBDs having various sizes that is available for use in the plurality of CBDs. Also, the particular FBD having the first size has a lowest availability in the free pool of FBDs. Other methods, systems, and computer program products are described in accordance with additional embodiments.
    Type: Grant
    Filed: February 12, 2018
    Date of Patent: April 21, 2020
    Assignee: International Business Machines Corporation
    Inventors: Aayush Gupta, James L. Hafner, Mohit Saxena
  • Publication number: 20190187904
    Abstract: A method includes determining a data record partition size based on resources used for transferring data from a higher storage tier that comprises first memory to one or more lower storage tiers that comprise second memory, determining a distribution mapping of the first memory, identifying all sets of contiguously stored data records on the higher storage tier that are suitable for export and greater in size than the data record partition size, sending a list of sets of contiguously stored data records to an exporter, transmitting from the higher storage tier to the one or more lower storage tiers, by the exporter, each set of contiguously stored data records, and transmitting from the higher storage tier to the one or more lower storage tiers, all remaining data records that are suitable for export and are not included on the list of logically sorted sets of contiguously stored data records.
    Type: Application
    Filed: February 25, 2019
    Publication date: June 20, 2019
    Inventors: Umesh Deshpande, Paul H. Muench, Mohit Saxena
  • Patent number: 10305516
    Abstract: Embodiments relate to a system with multiple erasure codes, and selecting and encoding for a write file with one of the codes to mitigate costs associated with storage recovery. The codes include a fast recovery code for frequently accessed data and a higher storage efficiency code for less frequently accessed data. State data is tracked to ascertain frequency of access to the file. One of the erasure codes is dynamically selected based on the tracked data, with the focus of the code select to lower recovery costs, and the data is encoded with the selected erasure code. Accordingly, the original coding of the write file is subject to change based on the tracked state data.
    Type: Grant
    Filed: August 1, 2016
    Date of Patent: May 28, 2019
    Assignee: International Business Machines Corporation
    Inventors: Mario Blaum, James L. Hafner, David A. Pease, Mohit Saxena, Mingyuan Xia
  • Patent number: 10296215
    Abstract: In one embodiment, a method includes determining a data record partition size based on resources used for transferring data from a higher storage tier to one or more lower storage tiers. The method also includes determining which data records stored to the higher storage tier are suitable for export to the one or more lower storage tiers, determining a distribution mapping of the first memory, the distribution mapping indicating a relative distribution of storage locations for all of the data records that are stored to the higher storage tier, identifying all sets of contiguously stored data records on the higher storage tier that are suitable for export and greater in size than the data record partition size, logically sorting, in a descending order of size, the sets of contiguously stored data records, and sending a list of logically sorted sets of contiguously stored data records to an exporter.
    Type: Grant
    Filed: March 20, 2017
    Date of Patent: May 21, 2019
    Assignee: International Business Machines Corporation
    Inventors: Umesh Deshpande, Paul H. Muench, Mohit Saxena
  • Publication number: 20190146882
    Abstract: A method for recovering data for a file system includes a journal-less recovery process that detects one or more inconsistencies for file system blocks upon a system failure based on one or more comparisons of information for the file system blocks.
    Type: Application
    Filed: December 20, 2018
    Publication date: May 16, 2019
    Inventors: Prasenjit Sarkar, Mohit Saxena
  • Patent number: 10241867
    Abstract: A method for storing and recovering data for a file system includes a write process that performs a write instruction for data that includes atomically updating corresponding data blocks and metadata-links on a storage medium. The metadata-links contain links from data blocks to parent metadata blocks and links from metadata blocks to the parent metadata blocks. A journal-less recovery process that detects one or more inconsistencies for file system blocks comprising data blocks or metadata blocks upon a system failure based on one or more comparisons of information for the file system blocks.
    Type: Grant
    Filed: November 4, 2014
    Date of Patent: March 26, 2019
    Assignee: International Business Machines Corporation
    Inventors: Prasenjit Sarkar, Mohit Saxena
  • Patent number: 10242014
    Abstract: A filesystem includes a pool of data blocks and a pool of index blocks. Non-overlapping subpools of data blocks, including a first subpool of data blocks and a second subpool of data blocks, are identified within the pool of data blocks. Likewise, non-overlapping subpools of index blocks, including a first subpool of index blocks and a second subpool of index blocks, are identified within the pool of index blocks. A first file group is mounted within a global namespace on a first mount point on the filesystem. A second file group is also mounted within the global namespace on a second mount point on the filesystem. The first subpool of data blocks and the first subpool of index blocks are allocated to the first mounted file group, and the second subpool of data blocks and the second subpool of index blocks are allocated to the second mounted file group.
    Type: Grant
    Filed: February 4, 2015
    Date of Patent: March 26, 2019
    Assignee: International Business Machines Corporation
    Inventors: Reshu Jain, Prasenjit Sarkar, Mohit Saxena, Rui Zhang
  • Publication number: 20190050436
    Abstract: A method, computer system, and a computer program product for organizing a plurality of column families based on data content is provided. The present invention may include analyzing a plurality of data. The present invention may also include generating a plurality of individual columns based on the analyzed plurality of data. The present invention may then include identifying a plurality of temporal access patterns associated with the generated plurality of individual columns based on the content of the analyzed plurality of data. The present invention may further include forming the plurality of column families based on the identified plurality of temporal access patterns. The present invention may also include storing the formed plurality of column families in a key-value store.
    Type: Application
    Filed: August 14, 2017
    Publication date: February 14, 2019
    Inventors: Umesh Deshpande, Paul H. Muench, Mohit Saxena, Sangeetha Seshadri
  • Publication number: 20190050421
    Abstract: The embodiments relate to performing a write operation in a filesystem. Replica files embedded with respective sets of data are stored are on persistent storage local to replica nodes of the filesystem. The storage includes atomically updating the replica files to the replica nodes. Each set of data has information for self-characterizing each replica file. A map stored at persistent storage local to a remote node is updated. The map maintains information for identifying each replica file stored at each replica node.
    Type: Application
    Filed: October 5, 2018
    Publication date: February 14, 2019
    Applicant: International Business Machines Corporation
    Inventor: Mohit Saxena
  • Patent number: 10140066
    Abstract: In one general embodiment, a computer-implemented method includes creating multiple pools of micro services. Each of the pools includes a specific configuration set and resource properties. Also, the computer-implemented method includes receiving incoming workloads. Moreover, the computer-implemented method includes, for each of the incoming workloads, dynamically mapping the incoming workload, based on characteristics of the incoming workload, to an access path traversing a combination of a subset of the pools of micro services.
    Type: Grant
    Filed: February 1, 2016
    Date of Patent: November 27, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Aayush Gupta, Dean Hildebrand, Nagapramod S. Mandagere, Mohit Saxena
  • Patent number: 10127266
    Abstract: In one embodiment, a computer-implemented method for object-granular policy assignment in an object storage environment includes: automatically assigning a plurality of objects stored within the object storage environment to one or more policies; and locating one or more of the objects among a plurality of policy rings within the object storage environment based on semantics of the one or more policies. A virtual namespace maps each object to at least one of the policy rings based on the one or more policies assigned to the object; and the virtual namespace is scalable with a number of the plurality of objects stored within the object storage environment. Corresponding systems and computer program products are also disclosed.
    Type: Grant
    Filed: November 3, 2015
    Date of Patent: November 13, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Nagapramod S. Mandagere, Mohit Saxena
  • Patent number: 10127097
    Abstract: The present disclosure describes systems and methods for propagating port state to intermediary devices of a cluster in a static link aggregation environment. The methods and systems include a cluster comprising a plurality of intermediary devices in communication with a network device via a static link aggregation comprising aggregated ports from different intermediary devices of the cluster. A first device of the static link aggregation is configured to detect that a health of the first device is below a predetermined threshold and, responsive to the detection, identify one or more ports in the aggregated ports as down. A second device of the link aggregation is configured to, responsive to the identification, remove the ports from a distribution list for the static link aggregation. Upon detection that a health of a device is above a predetermined threshold, the first device may identify the ports as up.
    Type: Grant
    Filed: June 29, 2015
    Date of Patent: November 13, 2018
    Assignee: Citrix Systems, Inc.
    Inventors: Ramanjaneyulu Y. Talla, Aakash Jain, Narendra Kataria, Sandhya Gopinath, Mohit Saxena