Patents by Inventor David P. Grove

David P. Grove 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: 10334214
    Abstract: Apparatus, such as can be included in an electronic device, performs a method for operating apparatus configured for combined vibratory and projection functions. The apparatus includes a mirror configured to reflect a projected image and a motor. The mirror is coupled as a counterweight to the motor to configure the apparatus for a vibratory function. The motor is further configured to translate and rotate the mirror about a first axis to align the mirror with a projector to reflect the projected image during a projection function.
    Type: Grant
    Filed: November 4, 2015
    Date of Patent: June 25, 2019
    Assignee: MOTOROLA MOBILITY LLC
    Inventors: David K. Lim, William R. Groves, Jiri Slaby, Jason P. Wojack
  • Patent number: 10163061
    Abstract: A quality-directed adaptive analytic retraining is provided. Training example data with which to retrain a machine learning model that has been previously trained is received. The training example data is stored in a memory. The machine learning model is evaluated at least by running the machine learning model with the training example data. A normalized quality measure may be determined based on the evaluating. Whether to retrain the machine learning model is determined at least based on the normalized quality measure. Responsive to determining that the machine learning model is to be retrained, the machine learning model is retrained.
    Type: Grant
    Filed: June 18, 2015
    Date of Patent: December 25, 2018
    Assignee: International Business Machines Corporation
    Inventors: David P. Grove, Martin J. Hirzel, Wei Zhang
  • Publication number: 20160371601
    Abstract: A quality-directed adaptive analytic retraining is provided. Training example data with which to retrain a machine learning model that has been previously trained is received. The training example data is stored in a memory. The machine learning model is evaluated at least by running the machine learning model with the training example data. A normalized quality measure may be determined based on the evaluating. Whether to retrain the machine learning model is determined at least based on the normalized quality measure. Responsive to determining that the machine learning model is to be retrained, the machine learning model is retrained.
    Type: Application
    Filed: June 18, 2015
    Publication date: December 22, 2016
    Inventors: David P. Grove, Martin J. Hirzel, Wei Zhang
  • Patent number: 8326895
    Abstract: A computer readable storage medium for associating a phase with an activation of a computer program that supports garbage collection include: a plurality of stacks, each stack including at least one stack frame that includes an activation count; and a processor with logic for performing steps of: zeroing the activation count whenever the program creates a new stack frame and after garbage collection is performed; determining whether an interval has transpired during program execution; examining each stack frame's content and incrementing the activation count for each frame of the stacks once the interval has transpired; detecting the phase whose activation count is non-zero and associating the phase with the activation; and ensuring that when the phase ends, an action is immediately performed.
    Type: Grant
    Filed: May 22, 2010
    Date of Patent: December 4, 2012
    Assignee: International Business Machines Corporation
    Inventors: Stephen J Fink, David P. Grove
  • Publication number: 20120304178
    Abstract: Concurrent reduction optimizations for thieving schedulers may include a thieving worker thread operable take a task from a first worker thread's task dequeue, the thieving worker thread and the first worker thread having same synchronization point in a program at which the thieving worker thread and the first worker thread can resume their operations. The thieving worker thread may be further operable to create a local copy of memory locations associated with the task in local memory of the thieving worker thread, and store result of the thieving worker executing the task as the local copy. The thieving worker thread may be further operable to atomically perform a reduction operation to a master location that both the thieving worker thread and the first worker thread can access, in response to the thieving worker thread completing the task.
    Type: Application
    Filed: May 24, 2011
    Publication date: November 29, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: David P. Grove, Igor Peshansky, Vijay Saraswat, Olivier Tardieu
  • Publication number: 20100229156
    Abstract: A computer readable storage medium for associating a phase with an activation of a computer program that supports garbage collection include: a plurality of stacks, each stack including at least one stack frame that includes an activation count; and a processor with logic for performing steps of: zeroing the activation count whenever the program creates a new stack frame and after garbage collection is performed; determining whether an interval has transpired during program execution; examining each stack frame's content and incrementing the activation count for each frame of the stacks once the interval has transpired; detecting the phase whose activation count is non-zero and associating the phase with the activation; and ensuring that when the phase ends, an action is immediately performed.
    Type: Application
    Filed: May 22, 2010
    Publication date: September 9, 2010
    Applicant: International Business Machines Corporation
    Inventors: Stephen J. Fink, David P. Grove
  • Patent number: 7730457
    Abstract: A system for associating a phase with an activation of a computer program that supports garbage collection include: a plurality of stacks, each stack including at least one stack frame that includes an activation count; and a processor with logic for performing steps of: zeroing the activation count whenever the program creates a new stack frame and after garbage collection is performed; determining whether an interval has transpired during program execution; examining each stack frame's content and incrementing the activation count for each frame of the stacks once the interval has transpired; detecting the phase whose activation count is non-zero and associating the phase with the activation; and ensuring that when the phase ends, an action is immediately performed. Detecting phases in a running computer program, creates an activation count associated with each stack frame.
    Type: Grant
    Filed: April 17, 2008
    Date of Patent: June 1, 2010
    Assignee: International Business Machines Corporation
    Inventors: Stephen J. Fink, David P. Grove
  • Publication number: 20080215649
    Abstract: A system for associating a phase with an activation of a computer program that supports garbage collection include: a plurality of stacks, each stack including at least one stack frame that includes an activation count; and a processor with logic for performing steps of: zeroing the activation count whenever the program creates a new stack frame and after garbage collection is performed; determining whether an interval has transpired during program execution; examining each stack frame's content and incrementing the activation count for each frame of the stacks once the interval has transpired; detecting the phase whose activation count is non-zero and associating the phase with the activation; and ensuring that when the phase ends, an action is immediately performed. detecting phases in a running computer program, creates an activation count associated with each stack frame.
    Type: Application
    Filed: April 17, 2008
    Publication date: September 4, 2008
    Inventors: Stephen J. Fink, David P. Grove
  • Patent number: 7412694
    Abstract: A system and method for detecting phases in a running computer program, creates an activation count associated with each stack frame. The activation count is zeroed whenever a new frame is created in a stack and incremented for each frame encountered during periodic intervals. A phase is detected with an activation whose activation count is non-zero.
    Type: Grant
    Filed: September 18, 2003
    Date of Patent: August 12, 2008
    Assignee: International Business Machines Corporation
    Inventors: Stephen J. Fink, David P. Grove
  • Patent number: 7150009
    Abstract: A method for implementing an object model for an object-oriented programming language. Also contemplated is a method whereby some object state is materialized directly in those objects deemed likely to use such a state, but is externalized for those objects deemed unlikely to use the state.
    Type: Grant
    Filed: December 10, 2002
    Date of Patent: December 12, 2006
    Assignee: International Business Machines Corporation
    Inventors: David F. Bacon, Stephen J. Fink, David P. Grove
  • Patent number: 7103877
    Abstract: A system and method for characterizing runtime behavior of a computer program executing in an execution environment, the method comprising: identifying one or more instances of yield points in a program to be executed, each yield point indicating a potential sampling operation during program execution; during program execution, in response to an identified yield point instance, ascertaining a state of the execution environment for indicating whether a sampling operation is to be performed; and, when the state of the execution environment indicates a sampling operation, recording relevant information for characterizing behavior of the execution environment. Relevant information for characterizing program behavior includes frequencies of methods executed in the program, and calling context associated with methods called by the program.
    Type: Grant
    Filed: November 1, 2000
    Date of Patent: September 5, 2006
    Assignee: International Business Machines Corporation
    Inventors: Matthew R. Arnold, Stephen J. Fink, David P. Grove, Michael J. Hind, Peter F. Sweeney
  • Patent number: 6971091
    Abstract: A sampling-based system and method for adaptively optimizing a computer program executing in an execution environment that comprises one or more compiler devices for providing various levels of program optimization. The system comprises a runtime measurements sub-system for monitoring execution of the computer program to be optimized, the monitoring including obtaining raw profile data samples and characterizing the raw profile data; a controller device for receiving the characterized raw profile data from the runtime measurements sub-system and analyzing the data for determining whether a level of program optimization for the executing program is to be performed by a compiler device, the controller generating a compilation plan in accordance with a determined level of optimization; and, a recompilation sub-system for receiving a compilation plan from the controller and invoking a compiler device for performing the level of program optimization of the executing program in accordance with the compilation plan.
    Type: Grant
    Filed: November 1, 2000
    Date of Patent: November 29, 2005
    Assignee: International Business Machines Corporation
    Inventors: Matthew R. Arnold, Stephen J. Fink, David P. Grove, Michael J. Hind, Peter F. Sweeney
  • Patent number: 6857120
    Abstract: A method for characterizing runtime behavior of a computer program executing in an execution environment comprising: generating a call stack runtime data structure for tracking methods currently active in an executing program thread, an active method on the call stack is represented by a frame; determining condition for sampling an executing program to determine current program behavior; and, upon determination of a sampling condition, the sampling including examining at least one frame in the call stack in response to evaluate context of one or more methods represented in the call stack, the at least one frame in the call stack providing context relating to an executing program's calling structure.
    Type: Grant
    Filed: November 1, 2000
    Date of Patent: February 15, 2005
    Assignee: International Business Machines Corporation
    Inventors: Matthew R. Arnold, Stephen J. Fink, David P. Grove, Michael J. Hind, Peter F. Sweeney, John Whaley
  • Publication number: 20040111703
    Abstract: A method for implementing an object model for an object-oriented programming language. Also contemplated is a method whereby some object state is materialized directly in those objects deemed likely to use such a state, but is externalized for those objects deemed unlikely to use the state.
    Type: Application
    Filed: December 10, 2002
    Publication date: June 10, 2004
    Applicant: IBM Corporation
    Inventors: David F. Bacon, Stephen J. Fink, David P. Grove