Patents by Inventor David Michael Eads
David Michael Eads 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: 11563748Abstract: Application permissions can be set in a cloud computing environment based on a user's authorization level in the cloud computing environment. For example, a system can determine that a user has a particular authorization level in a cloud computing environment. The system can determine that the user is to have particular permissions for a continuous integration tool by mapping the particular authorization level to the particular permissions. The system can then set a permission setting for the continuous integration tool to limit the user to the particular permissions.Type: GrantFiled: February 4, 2021Date of Patent: January 24, 2023Assignee: RED HAT, INC.Inventors: David Michael Eads, Benjamin Michael Parees, Jordan Thomas Liggitt, Gabriel Garcia Montero
-
Publication number: 20210160250Abstract: Application permissions can be set in a cloud computing environment based on a user's authorization level in the cloud computing environment. For example, a system can determine that a user has a particular authorization level in a cloud computing environment. The system can determine that the user is to have particular permissions for a continuous integration tool by mapping the particular authorization level to the particular permissions. The system can then set a permission setting for the continuous integration tool to limit the user to the particular permissions.Type: ApplicationFiled: February 4, 2021Publication date: May 27, 2021Inventors: David Michael Eads, Benjamin Michael Parees, Jordan Thomas Liggitt, Gabriel Garcia Montero
-
Patent number: 10958659Abstract: Application permissions can be set in a cloud computing environment based on a user's authorization level in the cloud computing environment. For example, a system can determine that a user has a particular authorization level in a cloud computing environment. The system can determine that the user is to have particular permissions for a continuous integration tool by mapping the particular authorization level to the particular permissions. The system can then set a permission setting for the continuous integration tool to limit the user to the particular permissions.Type: GrantFiled: August 30, 2017Date of Patent: March 23, 2021Assignee: Red Hat, Inc.Inventors: David Michael Eads, Benjamin Michael Parees, Jordan Thomas Liggitt, Gabriel Garcia Montero
-
Publication number: 20190068612Abstract: Application permissions can be set in a cloud computing environment based on a user's authorization level in the cloud computing environment. For example, a system can determine that a user has a particular authorization level in a cloud computing environment. The system can determine that the user is to have particular permissions for a continuous integration tool by mapping the particular authorization level to the particular permissions. The system can then set a permission setting for the continuous integration tool to limit the user to the particular permissions.Type: ApplicationFiled: August 30, 2017Publication date: February 28, 2019Inventors: David Michael Eads, Benjamin Michael Parees, Jordan Thomas Liggitt, Gabriel Garcia Montero
-
Patent number: 8788457Abstract: A method, system and computer program product for ensuring that archival data deleted in a source table is already stored in a target table. An external data source sets a flag in the first table to identify the row in the source table to be deleted. An application sets a flag in a second table for each row of the source table that is marked to be deleted according to the first table. The application performs uncommitted read operations on the source table for each row corresponding to the distinct primary key values stored in the first table. The application inserts the data read into the corresponding rows of the target table. The application deletes the rows in the source table indicated to be deleted by the second table. In this manner, the archival data deleted from the source table is ensured to already be stored in the target table.Type: GrantFiled: September 21, 2007Date of Patent: July 22, 2014Assignee: International Business Machines CorporationInventors: Benjamin Michael Parees, David Michael Eads, David Michael Enyeart, Luis Eduardo Guillen-Sanchez, Latha Sivakumar, Dan McBryde Willey
-
Patent number: 8572027Abstract: A method, system and computer program product for performing synchronization between source and target tables. An external data source inserts a new row in a first table as it modifies or creates a row in the source table where each new row in the first table includes a primary key value associated with the modified/created row in the source table. An application copies the distinct values for the primary keys listed in the first table and inserts them in a second table. The application performs uncommitted read operations on the source table for each row corresponding to the primary key values stored in the second table. The application inserts the data read into the corresponding rows of the target table. In this manner, a platform agnostic application may be able to synchronize the relational source and target tables in an efficient manner while minimizing the contention at the source table.Type: GrantFiled: September 21, 2007Date of Patent: October 29, 2013Assignee: International Business Machines CorporationInventors: Benjamin Michael Parees, David Michael Eads, David Michael Enyeart, Luis Eduardo Guillen-Sanchez, Latha Sivakumar, Dan McBryde Willey
-
Patent number: 8521689Abstract: A method, system and computer program product for achieving a balance between pre-filter efficiency and pre-filter throughput. Event subscriptions are obtained for a given event consumer. The event subscriptions define the events to be routed to this event consumer. Pre-filters of varying complexity and filtering power are constructed based on these event subscriptions. A balance between pre-filter efficiency and pre-filter throughput may be achieved by selecting the best pre-filter out of these constructed pre-filters to filter events to its associated event consumer. The best pre-filter is selected by comparing a complexity threshold (e.g., a limit for the number of atomic Boolean expressions in a pre-filter) with the actual complexity (e.g., the actual number of atomic Boolean expressions) for each constructed pre-filter and selecting the most complex pre-filter without exceeding the threshold.Type: GrantFiled: April 20, 2007Date of Patent: August 27, 2013Assignee: International Business Machines CorporationInventors: John William Alcorn, Kevin Spencer Barker, David Michael Eads, Joachim H. Frank
-
Publication number: 20090083337Abstract: A method, system and computer program product for performing synchronization between source and target tables. An external data source inserts a new row in a first table as it modifies or creates a row in the source table where each new row in the first table includes a primary key value associated with the modified/created row in the source table. An application copies the distinct values for the primary keys listed in the first table and inserts them in a second table. The application performs uncommitted read operations on the source table for each row corresponding to the primary key values stored in the second table. The application inserts the data read into the corresponding rows of the target table. In this manner, a platform agnostic application may be able to synchronize the relational source and target tables in an efficient manner while minimizing the contention at the source table.Type: ApplicationFiled: September 21, 2007Publication date: March 26, 2009Applicant: International Business Machines CorporationInventors: Benjamin Michael Parees, David Michael Eads, David Michael Enyeart, Luis Eduardo Guillen-Sanchez, Latha Sivakumar, Dan McBryde Willey
-
Publication number: 20090083341Abstract: A method, system and computer program product for ensuring that archival data deleted in a source table is already stored in a target table. An external data source sets a flag in the first table to identify the row in the source table to be deleted. An application sets a flag in a second table for each row of the source table that is marked to be deleted according to the first table. The application performs uncommitted read operations on the source table for each row corresponding to the distinct primary key values stored in the first table. The application inserts the data read into the corresponding rows of the target table. The application deletes the rows in the source table indicated to be deleted by the second table. In this manner, the archival data deleted from the source table is ensured to already be stored in the target table.Type: ApplicationFiled: September 21, 2007Publication date: March 26, 2009Applicant: International Business Machines CorporationInventors: Benjamin Michael Parees, David Michael Eads, David Michael Enyeart, Luis Eduardo Guillen-Sanchez, Latha Sivakumar, Dan McBryde Willey
-
Publication number: 20080263093Abstract: A method, system and computer program product for achieving a balance between pre-filter efficiency and pre-filter throughput. Event subscriptions are obtained for a given event consumer. The event subscriptions define the events to be routed to this event consumer. Pre-filters of varying complexity and filtering power are constructed based on these event subscriptions. A balance between pre-filter efficiency and pre-filter throughput may be achieved by selecting the best pre-filter out of these constructed pre-filters to filter events to its associated event consumer. The best pre-filter is selected by comparing a complexity threshold (e.g., a limit for the number of atomic Boolean expressions in a pre-filter) with the actual complexity (e.g., the actual number of atomic Boolean expressions) for each constructed pre-filter and selecting the most complex pre-filter without exceeding the threshold.Type: ApplicationFiled: April 20, 2007Publication date: October 23, 2008Applicant: International Business Machines CorporationInventors: John William Alcorn, Kevin Spencer Barker, David Michael Eads, Joachim H. Frank