Patents by Inventor Alexei L. Pytel
Alexei L. Pytel 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).
-
Patent number: 10409573Abstract: A method, a computer program product, and a computer system for generating a set of scripts that perform processing equivalent to an original script and achieve maximum parallel executions. A computer receives an original script including annotations defined by a user, builds a graph comprising nodes and representing execution steps in the original script, associates one or more attributes to the nodes, and determines dependencies between the nodes, based on accessing data sets or files by the execution steps. The computer modifies the dependencies between the nodes, using instructions contained in the annotations. The computer generates a set of scripts that perform processing equivalent to the original script and achieve maximum parallel executions, based on the nodes of the graph and the dependencies. The computer generates a script that defines dependencies between the scripts.Type: GrantFiled: February 19, 2018Date of Patent: September 10, 2019Assignee: International Business Machines CorporationInventors: Kevin J. Kathmann, Gary S. Puchkoff, Alexei L. Pytel, Steven J. Simonson, Thomas J. Wasik
-
Publication number: 20190258462Abstract: A method, a computer program product, and a computer system for generating a set of scripts that perform processing equivalent to an original script and achieve maximum parallel executions. A computer receives an original script including annotations defined by a user, builds a graph comprising nodes and representing execution steps in the original script, associates one or more attributes to the nodes, and determines dependencies between the nodes, based on accessing data sets or files by the execution steps. The computer modifies the dependencies between the nodes, using instructions contained in the annotations. The computer generates a set of scripts that perform processing equivalent to the original script and achieve maximum parallel executions, based on the nodes of the graph and the dependencies. The computer generates a script that defines dependencies between the scripts.Type: ApplicationFiled: February 19, 2018Publication date: August 22, 2019Inventors: Kevin J. Kathmann, Gary S. Puchkoff, Alexei L. Pytel, Steven J. Simonson, Thomas J. Wasik
-
Patent number: 9588924Abstract: A hybrid messaging model including a method that sends a first request message from a control process executing on a computer to a plurality of subordinate processes. The first request message directs the subordinate processes to enter a first state. An expected state is set equal to the first state in response to sending the first request message. A status message, including the expected state, is periodically broadcast from the control process to the plurality of subordinate processes. At least one confirmation message is received from each of the subordinate processes confirming that the subordinate process is in the expected state. Each of the confirmation messages is responsive to either the first request message or to the status message. A second request message is sent from the control process to the plurality of subordinate processes in response to receiving at least one confirmation message from each of the subordinate processes.Type: GrantFiled: May 26, 2011Date of Patent: March 7, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kevin J. Kathmann, Alexei L. Pytel, Steven J. Simonson, Bruce W. Talbott, Thomas J. Wasik
-
Patent number: 9495400Abstract: A node container is constructed with multiple binary tree views. A processing device creates a primary view binary tree within the node container based on a primary key. A set of records that match fields of the primary key is chained to the primary view. The processing device also creates one or more alternate views within the node container to allow access to the same set of records via one or more alternate keys, which are subsets of the fields of the primary key. The chain of records is extracted from the node container when matched to a subsequent query search.Type: GrantFiled: October 1, 2012Date of Patent: November 15, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Alexei L. Pytel, Kevin J. Kathmann, Steven J. Simonson, Thomas J. Wasik
-
Patent number: 9026523Abstract: A method is provided for constructing a cache for storing results of previously evaluated queries in a binary tree based on a cache key. The cache is searched, by a processing device, for a node representing a set of previously evaluated queries that match a given record using an instance of the cache key. In response to finding a representative node that matches the instance of the cache key, the method performs processing associated with the set of previously evaluated queries. In response to finding no representative nodes, the method creates a new node using the instance of the cache key. The method of the invention then updates the cache by classifying the compatibility of newly registered queries with the cache key and evaluating whether compatible newly registered queries match the record.Type: GrantFiled: December 12, 2013Date of Patent: May 5, 2015Assignee: International Business Machines CorporationInventors: Alexei L. Pytel, Kevin J. Kathmann, Steven J. Simonson, Thomas J. Wasik
-
Patent number: 9003149Abstract: Transparent file system migration including a method that identifies a source physical storage location in a file system that supports simultaneous access by multiple independent processes. A target physical storage location in the file system is identified and its contents are migrated to the target physical storage location. The migrating includes disallowing new allocations to the source physical storage location and copying contents from the source physical storage location to the target physical storage location. A write request to write data to the source physical storage location is received prior to or during the migrating. The write request is serviced contemporaneously with the migrating. Read and write requests directed to the source physical storage location are redirected to the target physical storage location. The redirecting is responsive to the migrating completing. The requests are from the multiple independent processes and include both logical and physical input/outputs.Type: GrantFiled: May 26, 2011Date of Patent: April 7, 2015Assignee: International Business Machines CorporationInventors: Kevin J. Kathmann, Alexei L. Pytel, Steven J. Simonson, Bruce W. Talbott, Thomas J. Wasik
-
Publication number: 20140095508Abstract: A method is provided for constructing a cache for storing results of previously evaluated queries in a binary tree based on a cache key. The cache is searched, by a processing device, for a node representing a set of previously evaluated queries that match a given record using an instance of the cache key. In response to finding a representative node that matches the instance of the cache key, the method performs processing associated with the set of previously evaluated queries. In response to finding no representative nodes, the method creates a new node using the instance of the cache key. The method of the invention then updates the cache by classifying the compatibility of newly registered queries with the cache key and evaluating whether compatible newly registered queries match the record.Type: ApplicationFiled: October 1, 2012Publication date: April 3, 2014Applicant: INTERNATIONAL BUSINESS MACHINESInventors: Alexei L. Pytel, Kevin J. Kathmann, Steven J. Simonson, Thomas J. Wasik
-
Publication number: 20140095531Abstract: A node container is constructed with multiple binary tree views. A processing device creates a primary view binary tree within the node container based on a primary key. A set of records that match fields of the primary key is chained to the primary view. The processing device also creates one or more alternate views within the node container to allow access to the same set of records via one or more alternate keys, which are subsets of the fields of the primary key. The chain of records is extracted from the node container when matched to a subsequent query search.Type: ApplicationFiled: October 1, 2012Publication date: April 3, 2014Applicant: INTERNATIONAL BUSINESS MACHINESInventors: Alexei L. Pytel, Kevin J. Kathmann, Steven J. Simonson, Thomas J. Wasik
-
Publication number: 20120303721Abstract: A hybrid messaging model including a method that sends a first request message from a control process executing on a computer to a plurality of subordinate processes. The first request message directs the subordinate processes to enter a first state. An expected state is set equal to the first state in response to sending the first request message. A status message, including the expected state, is periodically broadcast from the control process to the plurality of subordinate processes. At least one confirmation message is received from each of the subordinate processes confirming that the subordinate process is in the expected state. Each of the confirmation messages is responsive to either the first request message or to the status message. A second request message is sent from the control process to the plurality of subordinate processes in response to receiving at least one confirmation message from each of the subordinate processes.Type: ApplicationFiled: May 26, 2011Publication date: November 29, 2012Applicant: International Business Machines CorporationInventors: Kevin J. Kathmann, Alexei L. Pytel, Steven J. Simonson, Bruce W. Talbott, Thomas J. Wasik
-
Publication number: 20120303913Abstract: Transparent file system migration including a method that identifies a source physical storage location in a file system that supports simultaneous access by multiple independent processes. A target physical storage location in the file system is identified and its contents are migrated to the target physical storage location. The migrating includes disallowing new allocations to the source physical storage location and copying contents from the source physical storage location to the target physical storage location. A write request to write data to the source physical storage location is received prior to or during the migrating. The write request is serviced contemporaneously with the migrating. Read and write requests directed to the source physical storage location are redirected to the target physical storage location. The redirecting is responsive to the migrating completing. The requests are from the multiple independent processes and include both logical and physical input/outputs.Type: ApplicationFiled: May 26, 2011Publication date: November 29, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kevin J. Kathmann, Alexei L. Pytel, Steven J. Simonson, Bruce W. Talbott, Thomas J. Wasik