Patents by Inventor Arun Iyengar

Arun Iyengar 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: 20200409833
    Abstract: A method for transparently moving a block of memory with respect to an application using the block of memory, includes inserting, by a compiler, in an application that includes a memory allocation call, instructions for transparently moving a block of memory with respect to an application using the block of memory. The instructions include obtaining a first pointer returned by a memory allocator, where the first pointer points to an internal data structure, the internal data structure includes a read-write lock and a second pointer, and the second pointer points to an actual memory block. The instructions further include acquiring a read lock on a read-write lock in the internal data structure, before the first pointer is used by the application, obtaining the second pointer to the actual memory block, and dereferencing the second pointer to access the actual memory block for the application data.
    Type: Application
    Filed: June 28, 2019
    Publication date: December 31, 2020
    Inventors: WENQI CAO, ARUN IYENGAR, GONG SU, ZEHRA SURA, QI ZHANG
  • Patent number: 10831617
    Abstract: An information processing system, computer readable storage medium, and method for supporting resilient execution of computer programs. A method provides a resilient store wherein information in the resilient store can be accessed in the event of a failure. The method periodically checkpoints application state in the resilient store. A resilient executor comprises software which executes applications by catching failures. The method uses the resilient executor to execute at least one application. In response to the resilient executor detecting a failure, restoring application state information to the at least one application from a checkpoint stored in the resilient store, the resilient executor resuming execution of the at least one application with the restored application state information.
    Type: Grant
    Filed: April 23, 2019
    Date of Patent: November 10, 2020
    Assignee: International Business Machines Corporation
    Inventors: Arun Iyengar, Joshua J. Milthorpe
  • Patent number: 10831616
    Abstract: An information processing system, computer readable storage medium, and method for supporting resilient execution of computer programs. A method provides a resilient store wherein information in the resilient store can be accessed in the event of a failure. The method periodically checkpoints application state in the resilient store. A resilient executor comprises software which executes applications by catching failures. The method uses the resilient executor to execute at least one application. In response to the resilient executor detecting a failure, restoring application state information to the at least one application from a checkpoint stored in the resilient store, the resilient executor resuming execution of the at least one application with the restored application state information.
    Type: Grant
    Filed: April 18, 2019
    Date of Patent: November 10, 2020
    Assignee: International Business Machines Corporation
    Inventors: Arun Iyengar, Joshua J. Milthorpe
  • Publication number: 20200334249
    Abstract: An information processing system, a computer readable storage medium, and a computer-implemented method, collect tables from a corpus of documents, convert the collected tables to flattened table format and organized to be searchable by schema-less queries. A method collects tables, extracts feature values from collected table data and collected table meta-data for each collected table. A table classifier classifies each collected table as being a type of table. Based on the classifying, the collected table is converted to a flattened table including table values that are the table data and the table meta-data of the collected table. Dependencies of the data values are mapped. The flattened table and mapped dependencies are stored in a triple store searchable by schema-less queries. The table classifier learns and improves its accuracy and reliability. Dependency information is maintained among a plurality of database tables. The dependency information can be updated at variable update frequency.
    Type: Application
    Filed: April 19, 2019
    Publication date: October 22, 2020
    Inventors: Mustafa CANIM, Cristina CORNELIO, Arun IYENGAR, Ryan A. MUSA, Mariano RODRIGUEZ MURO
  • Publication number: 20200334251
    Abstract: An information processing system, a computer readable storage medium, and a computer-implemented method, collect tables from a corpus of documents, convert the collected tables to flattened table format and organized to be searchable by schema-less queries. A method collects tables, extracts feature values from collected table data and collected table meta-data for each collected table. A table classifier classifies each collected table as being a type of table. Based on the classifying, the collected table is converted to a flattened table including table values that are the table data and the table meta-data of the collected table. Dependencies of the data values are mapped. The flattened table and mapped dependencies are stored in a triple store searchable by schema-less queries. The table classifier learns and improves its accuracy and reliability. Dependency information is maintained among a plurality of database tables. The dependency information can be updated at variable update frequency.
    Type: Application
    Filed: April 19, 2019
    Publication date: October 22, 2020
    Inventors: Mustafa CANIM, Cristina CORNELIO, Arun IYENGAR, Ryan A. MUSA, Mariano RODRIGUEZ MURO
  • Publication number: 20200334250
    Abstract: An information processing system, a computer readable storage medium, and a computer-implemented method, collect tables from a corpus of documents, convert the collected tables to flattened table format and organized to be searchable by schema-less queries. A method collects tables, extracts feature values from collected table data and collected table meta-data for each collected table. A table classifier classifies each collected table as being a type of table. Based on the classifying, the collected table is converted to a flattened table including table values that are the table data and the table meta-data of the collected table. Dependencies of the data values are mapped. The flattened table and mapped dependencies are stored in a triple store searchable by schema-less queries. The table classifier learns and improves its accuracy and reliability. Dependency information is maintained among a plurality of database tables. The dependency information can be updated at variable update frequency.
    Type: Application
    Filed: April 19, 2019
    Publication date: October 22, 2020
    Inventors: Mustafa CANIM, Cristina CORNELIO, Arun IYENGAR, Ryan A. MUSA, Mariano RODRIGUEZ MURO
  • Patent number: 10802966
    Abstract: Provided are systems, methods, and media for simultaneous, non-atomic request processing of snooped operations of a broadcast scope within a SMP system. An example method includes detecting, by a first controller, based on a set of coherency resolution conditions, whether there are coherency resolution problems between two snooped operations. The method includes in response to detecting, by the first controller, that coherency resolution problems will not result, transmitting, from the first controller to a second controller, an indication signal indicating that coherency resolution problems will not result from the operation. The set of coherency resolution conditions includes: (a) detecting that a second operation of the two snooped operations operation is of a predetermined type, (b) detecting at time of snooping of the second operation that a directory state does not allow for exclusive data, and (c) detecting that the first controller has started committing to an update.
    Type: Grant
    Filed: February 14, 2019
    Date of Patent: October 13, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Arun Iyengar, Tim Bronson, Michael Andrew Blake, Vesselina Papazova, Arthur o'Neill, Jason D Kohl, Kenneth Klapproth
  • Publication number: 20200278886
    Abstract: Embodiments includes a computer-implemented method, a system and computer-program product for modifying central serialization of requests in multiprocessor systems. Some embodiments includes receiving an operation requiring resources from a pool of resources, determining an availability of the pool of resources required by the operation, and selecting a queue of a plurality of queues to queue the operation based at least in part on the availability of the pool of resources. Some embodiments also include setting a resource needs register and needs register for the selected queue, and setting a take-two bit for the selected queue.
    Type: Application
    Filed: March 1, 2019
    Publication date: September 3, 2020
    Inventors: Michael A. Blake, Arun Iyengar
  • Publication number: 20200272521
    Abstract: Embodiments are provided for implementing efficient resource allocation maintaining fairness between operation types. Embodiments include receiving an operation, and determining a number of resources that are required for the received operation. Embodiments also include determining a number of available resources, comparing the number of required resources and the number of available resources, and allocating the available resources in a first mode or a second mode based at least in part on the comparison and a number of queued operations.
    Type: Application
    Filed: February 26, 2019
    Publication date: August 27, 2020
    Inventors: Arun Iyengar, Michael A. Blake
  • Publication number: 20200264977
    Abstract: Provided are systems, methods, and media for simultaneous, non-atomic request processing of snooped operations of a broadcast scope within a SMP system. An example method includes detecting, by a first controller, based on a set of coherency resolution conditions, whether there are coherency resolution problems between two snooped operations. The method includes in response to detecting, by the first controller, that coherency resolution problems will not result, transmitting, from the first controller to a second controller, an indication signal indicating that coherency resolution problems will not result from the operation. The set of coherency resolution conditions includes: (a) detecting that a second operation of the two snooped operations operation is of a predetermined type, (b) detecting at time of snooping of the second operation that a directory state does not allow for exclusive data, and (c) detecting that the first controller has started committing to an update.
    Type: Application
    Filed: February 14, 2019
    Publication date: August 20, 2020
    Inventors: Arun Iyengar, Tim Bronson, Michael Andrew Blake, Vesselina Papazova, Arthur O'Neill, Jason D. Kohl1, Kenneth Klapproth
  • Patent number: 10715623
    Abstract: Methods, systems and computer program products for enhanced storage clients. An interface for using a storage service is provided. The interface for each storage service of a plurality of storage services can be implemented within a storage client. A cache can be integrated within the storage client for reducing a number of accesses to a storage service of the plurality of storage services. A compression method in the storage client can reduce a size of data objects. An encryption method in the storage client can preserve data privacy. An application can select at least one storage service of the plurality of storage services and use the at least one storage service via the storage client.
    Type: Grant
    Filed: May 3, 2019
    Date of Patent: July 14, 2020
    Assignee: International Business Machines Corporation
    Inventor: Arun Iyengar
  • Patent number: 10701172
    Abstract: A computer-implemented method, system, and computer program product, for enhanced storage clients. The computer-implemented method includes implementing an interface within a storage client, wherein the interface specifies at least one method or function to be implemented in a computer language for accessing each of a plurality of storage services through the interface. The storage client receives a request from an application, wherein the request is compatible with the interface. The storage client has an ability to communicate with each of the plurality of storage services to satisfy the request. The storage client communicates with at least one of the plurality of storage services to satisfy the request.
    Type: Grant
    Filed: March 29, 2019
    Date of Patent: June 30, 2020
    Assignee: International Business Machines Corporation
    Inventor: Arun Iyengar
  • Publication number: 20200177673
    Abstract: A computer readable storage medium and methods for distributing an application among computing nodes in a distributed processing system. A method estimates a cost of storing information pertaining to the application on different computing nodes; estimates a cost for computing resources required to execute the application on different computing nodes; estimates a cost of inter-node communication required to execute the application on different computing nodes; and selects at least one computing node to execute the application based on minimizing a total of at least one of the cost estimates.
    Type: Application
    Filed: February 6, 2020
    Publication date: June 4, 2020
    Applicant: International Business Machines Corporation
    Inventors: Arun IYENGAR, Wei TAN
  • Publication number: 20200151160
    Abstract: A processing system, computer program product, and methods for maintaining consistent values of objects in two or more stores. A method includes a data store associating an updated-version-request-time for each object of a plurality of objects, where each object of the plurality of objects resides on a respective another data store. The data store maintains a data structure ordering the plurality of objects by updated-version-request-times. The data store periodically examines the data structure to read updated-version-request-times. The data store makes a decision to request an updated version of an object belonging to the plurality of objects based on an updated-version-request-time of the object. The data structure can be a balanced tree.
    Type: Application
    Filed: January 16, 2020
    Publication date: May 14, 2020
    Inventor: Arun IYENGAR
  • Publication number: 20200151161
    Abstract: A processing system, computer program product, and methods for maintaining consistent values of objects in two or more stores. A method includes a data store associating an updated-version-request-time for each object of a plurality of objects wherein each object of the plurality of objects resides on the data store. The data store maintains a data structure ordering the plurality of objects by updated-version-request-times. The data store periodically examines the data structure to read updated-version-request-times. The data store makes a decision to notify another data store of a change to an object belonging to the plurality of objects based on an updated-version-request-time of the object. The data structure can be a balanced tree.
    Type: Application
    Filed: January 16, 2020
    Publication date: May 14, 2020
    Applicant: International Business Machines Corporation
    Inventor: Arun IYENGAR
  • Publication number: 20200112513
    Abstract: An adaptive monitoring method, system, and computer program product including an intelligent monitoring system which obtains at least one preference from a user, where the at least one preference includes at least one maximum monitoring overhead.
    Type: Application
    Filed: October 5, 2018
    Publication date: April 9, 2020
    Inventor: Arun Iyengar
  • Patent number: 10614054
    Abstract: A processing system, computer program product, and methods for maintaining consistent values of objects in two or more stores. A method includes a data store associating an update time for each object of a plurality of objects wherein each object of the plurality of objects resides on the data store. The data store maintains a data structure ordering the plurality of objects by update times. The data store periodically examines the data structure to read update times. The data store makes a decision to notify another data store of a change to an object belonging to the plurality of objects based on an update time of the object. The data structure can be a balanced tree.
    Type: Grant
    Filed: May 12, 2017
    Date of Patent: April 7, 2020
    Assignee: International Business Machines Corporation
    Inventor: Arun Iyengar
  • Patent number: 10606820
    Abstract: A processing system, computer program product, and methods for maintaining consistent values of objects in two or more stores. A method includes a data store associating an update time for each object of a plurality of objects, where each object of the plurality of objects resides on a respective another data store. The data store maintains a data structure ordering the plurality of objects by update times. The data store periodically examines the data structure to read update times. The data store makes a decision to request an updated version of an object belonging to the plurality of objects based on an update time of the object. The data structure can be a balanced tree.
    Type: Grant
    Filed: May 12, 2017
    Date of Patent: March 31, 2020
    Assignee: International Business Machines Corporation
    Inventor: Arun Iyengar
  • Patent number: 10587681
    Abstract: An information processing system, a computer readable storage medium, and a method for distributing an application among computing nodes in a distributed processing system. The method estimates a cost of storing information pertaining to the application on different computing nodes; estimates a cost for computing resources required to execute the application on different computing nodes; estimates a cost of inter-node communication required to execute the application on different computing nodes; and selects at least one computing node to execute the application based on minimizing a total of at least one of the cost estimates.
    Type: Grant
    Filed: July 2, 2018
    Date of Patent: March 10, 2020
    Assignee: International Business Machines Corporation
    Inventors: Arun Iyengar, Wei Tan
  • Publication number: 20200065245
    Abstract: A processing system server and methods for performing asynchronous data store operations. The server includes a processor which maintains a cache of objects in communication with the server. The processor executes an asynchronous computation to determine the value of a first object. In response to a request for the first object occurring before the asynchronous computation has determined the value of the first object, a value of the first object is returned from the cache. In response to a request for the first object occurring after the asynchronous computation has determined the value of the first object, a value of the first object determined by the asynchronous computation is returned. The asynchronous computation may comprise at least one future, such as a ListenableFuture, or at least one process or thread. Execution of an asynchronous computation may occur with a frequency correlated with how frequently the object changes or how important it is to have a current value of the object.
    Type: Application
    Filed: October 31, 2019
    Publication date: February 27, 2020
    Applicant: International Business Machines Corporation
    Inventor: Arun IYENGAR