Patents by Inventor David J. Gimpl
David J. Gimpl 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: 10110441Abstract: Translating an identifier is provided. One or more processors receives text that includes a portion of text. One or more processors identifies an identifier of an element of a network, wherein identifying the element is based, at least in part, on the portion of text. One or more processors determines one or more details of the element, wherein determining the one or more details is based, at least in part, on the identifier. One or more processors modifies a presentation of the text, wherein modifying the presentation is based, at least in part, on the one or more details of the element.Type: GrantFiled: March 28, 2014Date of Patent: October 23, 2018Assignee: International Business Machines CorporationInventors: Ezequiel Cervantes, David J. Gimpl
-
Patent number: 9331894Abstract: System information may be retrieved by an element manager on a device in a data center system where the element manager detects an application programming interface (API) call to the element manager from a centralized manager. The element manager establishes a two-way communication channel between the first element manager and the centralized manager according to a communications protocol. The element manager queries the centralized manager for data center system information through the two-way communication channel. The centralized manager manages a storage area network containing the device of the element manager.Type: GrantFiled: May 31, 2013Date of Patent: May 3, 2016Assignee: International Business Machines CorporationInventors: Brenda B. Gimpl, David J. Gimpl, Nedzad Taljanovic
-
Publication number: 20150281061Abstract: Translating an identifier is provided. One or more processors receives text that includes a portion of text. One or more processors identifies an identifier of an element of a network, wherein identifying the element is based, at least in part, on the portion of text. One or more processors determines one or more details of the element, wherein determining the one or more details is based, at least in part, on the identifier. One or more processors modifies a presentation of the text, wherein modifying the presentation is based, at least in part, on the one or more details of the element.Type: ApplicationFiled: March 28, 2014Publication date: October 1, 2015Applicant: International Business Machines CorporationInventors: Ezequiel Cervantes, David J. Gimpl
-
Publication number: 20150185019Abstract: According to embodiments of the invention, methods and a computer system for compatibility based resource matching are disclosed. The method may include receiving route requirements from a plurality of users determining whether the route requirements for a first of the plurality of users are trip compatible with a second of the plurality of users; and determining a ridesharing route for the first and second users in response to determining the route requirements are trip compatible. The trip compatibility may be determined based on route requirements such as a starting point, a destination point, a driver or rider preference, an arrival window, a destination window, and fee rate.Type: ApplicationFiled: December 30, 2013Publication date: July 2, 2015Applicant: International Business Machines CorporationInventors: David J. Gimpl, Pei Ming Hu, Nedzad Taljanovic
-
Publication number: 20150185020Abstract: According to embodiments of the invention, methods and a computer system for compatibility based resource matching are disclosed. The method may include receiving route requirements from a plurality of users determining whether the route requirements for a first of the plurality of users are trip compatible with a second of the plurality of users; and determining a ridesharing route for the first and second users in response to determining the route requirements are trip compatible. The trip compatibility may be determined based on route requirements such as a starting point, a destination point, a driver or rider preference, an arrival window, a destination window, and fee rate.Type: ApplicationFiled: May 19, 2014Publication date: July 2, 2015Applicant: International Business Machines CorporationInventors: David J. Gimpl, Pei Ming Hu, Nedzad Taljanovic
-
Publication number: 20140359059Abstract: System information may be retrieved by an element manager on a device in a data center system where the element manager detects an application programming interface (API) call to the element manager from a centralized manager. The element manager establishes a two-way communication channel between the first element manager and the centralized manager according to a communications protocol. The element manager queries the centralized manager for data center system information through the two-way communication channel. The centralized manager manages a storage area network containing the device of the element manager.Type: ApplicationFiled: May 31, 2013Publication date: December 4, 2014Inventors: Brenda B. Gimpl, David J. Gimpl, Nedzad Taljanovic
-
Patent number: 8856785Abstract: For predicting and generating a quantity of image clones, a provision module provisions a specified number of a specified image clone to an image pool. The specified number N1 is calculated as N1=N0+CEIL(SE). N0 is a number of the specified image clones provisioned during a previous provisioning operation. SE is a storage estimate. CEIL rounds SE up to a nearest integer. A deployment module deploys a first image clone from the image pool in a subsequent deployment in response to a request.Type: GrantFiled: May 24, 2012Date of Patent: October 7, 2014Assignee: International Business Machines CorporationInventors: David J. Gimpl, Amey P. Gokhale, Fahad Mahmood
-
Publication number: 20130315492Abstract: For predicting and generating a quantity of image clones, a provision module provisions a specified number of a specified image clone to an image pool. The specified number N1 is calculated as N1=N0+CEIL(SE). N0 is a number of the specified image clones provisioned during a previous provisioning operation. SE is a storage estimate. CEIL rounds SE up to a nearest integer. A deployment module deploys a first image clone from the image pool in a subsequent deployment in response to a request.Type: ApplicationFiled: May 24, 2012Publication date: November 28, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: David J. Gimpl, Amey P. Gokhale, Fahad Mahmood
-
Patent number: 8543687Abstract: In an embodiment, a unit workload comprises an average processor speed and an average memory amount required by execution of images. If an integer multiple of the average processor speed required minus a free processor speed at a source computer is greater than a first threshold amount, an integer multiple of the average memory amount required minus a free memory amount at the source computer is greater than a second threshold amount, the integer multiple of the average processor speed required minus a processor speed requirement of a source image at the source computer is less than a third threshold amount, and the integer multiple of the average memory required minus a memory requirement of the source image at the source computer is less than a fourth threshold amount, then deployment of the source image is moved from the source computer to a destination computer.Type: GrantFiled: July 22, 2010Date of Patent: September 24, 2013Assignee: International Business Machines CorporationInventors: Nicholas F. Campion, David J. Gimpl, Gregory R. Hintermeister, David Peraza
-
Publication number: 20120023222Abstract: In an embodiment, a unit workload comprises an average processor speed and an average memory amount required by execution of images. If an integer multiple of the average processor speed required minus a free processor speed at a source computer is greater than a first threshold amount, an integer multiple of the average memory amount required minus a free memory amount at the source computer is greater than a second threshold amount, the integer multiple of the average processor speed required minus a processor speed requirement of a source image at the source computer is less than a third threshold amount, and the integer multiple of the average memory required minus a memory requirement of the source image at the source computer is less than a fourth threshold amount, then deployment of the source image is moved from the source computer to a destination computer.Type: ApplicationFiled: July 22, 2010Publication date: January 26, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Nicholas F. Campion, David J. Gimpl, Gregory R. Hintermeister, David Peraza
-
Patent number: 8055733Abstract: Hardware and partition information of an existing LPAR system is collected and stored in a first system plan file. The first system plan file is applied to a partition planning tool. The partition planning tool identifies hardware to be reused in a second LPAR system and filters hardware to be excluded from the second LPAR system. The partition planning tool creates a plan for the second LPAR system using the identified hardware to be reused and the partition information. The created plan for the second LPAR system is applied to a partition deployment tool to partition the second LPAR system. The created plan for the second LPAR system is used to move and place hardware to be reused in the second LPAR system.Type: GrantFiled: October 17, 2007Date of Patent: November 8, 2011Assignee: International Business Machines CorporationInventors: David J. Gimpl, Cale T. Rath, Devaughn Lawrence Rackham, George James Romano, Tammy Lynn Van Hove
-
Publication number: 20090105999Abstract: Hardware and partition information of an existing LPAR system is collected and stored in a first system plan file. The first system plan file is applied to a partition planning tool. The partition planning tool identifies hardware to be reused in a second LPAR system and filters hardware to be excluded from the second LPAR system. The partition planning tool creates a plan for the second LPAR system using the identified hardware to be reused and the partition information. The created plan for the second LPAR system is applied to a partition deployment tool to partition the second LPAR system. The created plan for the second LPAR system is used to move and place hardware to be reused in the second LPAR system.Type: ApplicationFiled: October 17, 2007Publication date: April 23, 2009Inventors: David J. Gimpl, Cale T. Rath, Devaughn Lawrence Rackham, George James Romano, Tammy Lynn Van Hove
-
Publication number: 20070294065Abstract: A method, apparatus and computer program product for implementing plans for logical partition (LPAR) systems includes the generation of a representation of existing hardware and LPAR configuration of a system that is used as input for further LPAR planning and configuration modeling to enable producing accurate and valid plans for possible deployment. The existing system is surveyed and the representation of existing hardware and LPAR configuration of the system is generated. The representation is applied to a partition planning tool and used to create a plan for the LPAR system.Type: ApplicationFiled: May 31, 2006Publication date: December 20, 2007Inventors: David J. Gimpl, Cale T. Rath, George James Romano, Tammy Lynn Van Hove