Patents by Inventor Yaron Weinsberg

Yaron Weinsberg 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: 20080294942
    Abstract: Systems and methods for optimizing performance in a computing environment are provided. The system comprises means for monitoring execution of annotated logic code associated with a software component to determine whether a condition has been satisfied, wherein annotations in the logic code provide one or more details about the software component, the details being useful to a healing agent to correct a problem associated with said condition during the execution of the logic code.
    Type: Application
    Filed: May 21, 2007
    Publication date: November 27, 2008
    Inventors: David Breitgand, Maayan Goldstein, Ealan Abraham Henis, Onn Menahem Shehory, Yaron Weinsberg
  • Publication number: 20080295113
    Abstract: Systems and methods for optimizing memory management in a runtime environment are provided. The method comprises monitoring one or more objects loaded into primary memory of a computing system to determine if at least a first object can be removed from the primary memory; instantiating a proxy object to replace the first object in the primary memory; removing the first object from the primary memory; and monitoring calls to the proxy object to determine whether the first object is invoked by a process.
    Type: Application
    Filed: May 21, 2007
    Publication date: November 27, 2008
    Inventors: David Breitgand, Maayan Goldstein, Ealan Abraham Henis, Onn Menahem Shehory, Yaron Weinsberg
  • Publication number: 20080282246
    Abstract: A method of scheduling tasks for execution in a computer system includes determining a dynamic worst case execution time for a non-periodic task. The dynamic worst case execution time is based on an actual execution path of the non-periodic task. An available time period is also determined, wherein the available time period is an amount of time available for execution of the non-periodic task. The non-periodic task is scheduled for execution if the dynamic worst case execution time is less than the available time period.
    Type: Application
    Filed: May 7, 2007
    Publication date: November 13, 2008
    Inventors: Danny Dolev, Tal Anker, Yaron Weinsberg