Patents by Inventor Staffan Friberg

Staffan Friberg 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: 8825721
    Abstract: System and Methods for time based object aging for generational garbage collectors are provided. Time data is received from a user identifying the amount of time an object should survive in a generation defined in a heap. Generational garbage collection is performed, and objects are promoted from one generation to the next oldest generation based on the time data received.
    Type: Grant
    Filed: October 3, 2011
    Date of Patent: September 2, 2014
    Assignee: Oracle International Corporation
    Inventors: Charlie Hunt, Antonios Printezis, Staffan Friberg
  • Patent number: 8516019
    Abstract: System and Methods for time-based object aging for generational garbage collectors are provided. Time data is received from a user identifying the amount of time an object should survive in a generation defined in a heap. A circular buffer is generated to store a plurality of starting time for a plurality of garbage collections. Generational garbage collection is performed, and the time data in conjunction with the starting times stored in the circular buffer are used to determine when objects are promoted from one generation to the next oldest generation.
    Type: Grant
    Filed: October 3, 2011
    Date of Patent: August 20, 2013
    Assignee: Oracle America, Inc.
    Inventors: Charlie J. Hunt, Antonios Printezis, Staffan Friberg
  • Publication number: 20130086131
    Abstract: System and Methods for time-based object aging for generational garbage collectors are provided. Time data is received from a user identifying the amount of time an object should survive in a generation defined in a heap. A circular buffer is generated to store a plurality of starting time for a plurality of garbage collections. Generational garbage collection is performed, and the time data in conjunction with the starting times stored in the circular buffer are used to determine when objects are promoted from one generation to the next oldest generation.
    Type: Application
    Filed: October 3, 2011
    Publication date: April 4, 2013
    Applicant: Oracle International Corporation
    Inventors: Charlie Hunt, Antonios Printezis, Staffan Friberg
  • Publication number: 20130086132
    Abstract: System and Methods for time based object aging for generational garbage collectors are provided. Time data is received from a user identifying the amount of time an object should survive in a generation defined in a heap. Generational garbage collection is performed, and objects are promoted from one generation to the next oldest generation based on the time data received.
    Type: Application
    Filed: October 3, 2011
    Publication date: April 4, 2013
    Applicant: Oracle International Corporation
    Inventors: Charlie Hunt, Antonios Printezis, Staffan Friberg
  • Patent number: 8245206
    Abstract: A system and method for efficient string concatenation in a virtual machine (VM), or other runtime environment, and particularly for use in a system that includes a Java Virtual Machine (JVM). An embodiment improves the performance of string concatenation significantly by analysing the string concatenation chains during bytecode compilation and replacing the dynamic string concatenation code with fixed size structures without bounds checks or locks. The resulting code is also more suitable for inlining.
    Type: Grant
    Filed: December 12, 2007
    Date of Patent: August 14, 2012
    Assignee: Oracle International Corporation
    Inventors: Marcus Lagergren, Staffan Friberg
  • Publication number: 20080147955
    Abstract: A system and method for efficient string concatenation in a virtual machine (VM), or other runtime environment, and particularly for use in a system that includes a Java Virtual Machine (JVM). An embodiment improves the performance of string concatenation significantly by analysing the string concatenation chains during bytecode compilation and replacing the dynamic string concatenation code with fixed size structures without bounds checks or locks. The resulting code is also more suitable for inlining.
    Type: Application
    Filed: December 12, 2007
    Publication date: June 19, 2008
    Applicant: BEA SYSTEMS, INC.
    Inventors: Marcus Lagergren, Staffan Friberg