Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Daynes
Laurent Daynes, Saint-Ismier FR
| Patent application number | Description | Published |
|---|---|---|
| 20090089767 | METHOD AND SYSTEM FOR IMPLEMENTING A JUST-IN-TIME COMPILER - A method for implementing a just-in-time compiler involves obtaining high-level code templates in a high-level programming language, where the high-level programming language is designed for compilation to an intermediate language capable of execution by a virtual machine, and where each high-level code template represents an instruction in the intermediate language. The method further involves compiling the high-level code templates to native code to obtain optimized native code templates, where compiling the high-level code templates is performed, prior to runtime, using an optimizing static compiler designed for runtime use with the virtual machine. The method further involves implementing the just-in-time compiler using the optimized native code templates, where the just-in-time compiler is configured to substitute an optimized native code template when a corresponding instruction in the intermediate language is encountered at runtime. | 04-02-2009 |
Laurent P. Daynes, Saint Ismier FR
| Patent application number | Description | Published |
|---|---|---|
| 20090210379 | DYNAMIC MULTIPLE INHERITANCE METHOD DISPATCH AND TYPE EXTENSION TESTING BY FRUGAL PERFECT HASHING - Apparatus, methods, and computer program products are disclosed for constructing and using member dispatch tables for Object-Oriented programming environments. | 08-20-2009 |
Laurent Philippe Daynes, Saint-Ismier FR
| Patent application number | Description | Published |
|---|---|---|
| 20080238616 | Protocol for message delivery among independently evolving processes - The present invention relates to a method for message delivery from a sender process to a receiver process within a computer system, comprising performing an atomic check for the receiver process and a parent of the receiver process, returning a first status of the receiver process and a second status of the parent of the receiver process based on the atomic check, and delivering the message according to the first status and the second status, wherein the first status and the second status stay unchanged during the atomic check. | 10-02-2008 |
| 20090089345 | METHOD AND SYSTEM FOR MINOR GARBAGE COLLECTION IN A MULTITASKING ENVIRONMENT - A method for minor garbage collection in a multitasking environment involves marking cards as clean, where the cards designate ranges of memory locations in a shared older generation. The method further involves marking a card as dirty when a reference field of an object within the card is modified, where a memory location of the reference field is designated by the card, where the reference field references a live young object in a task-specific young generation, and where the task-specific young generation is associated with a first task. The method further involves marking the card as single-dirty when the card only includes roots of live young objects in the task-specific young generation, and optimizing task-specific minor garbage collection for a second task by skipping the card when the card is marked as single-dirty. | 04-02-2009 |
| 20090276478 | METHOD AND SYSTEM FOR HYBRID GARBAGE COLLECTION OF MULTI-TASKING SYSTEMS - In general, the invention relates to a method for garbage collection. The method includes examining old regions to obtain a mark bitmap, a connectivity matrix, and fragmentation information, where the mark bitmap describes marked words and unmarked words for the old regions. The method further includes identifying a fragmented region in the old regions based on the fragmentation information, where the fragmented region includes at least one of the marked words. The method further includes copying the at least one of the marked words to a new region allocated from a pool of free regions, designating each of the unmarked words not in the fragmented region as free, adjusting a cross-region reference to the fragmented region in the marked words to point to the new region based on the connectivity matrix, and adding the fragmented region to the pool of free regions. | 11-05-2009 |
Laurent Phillipe Daynes, Saint-Ismier FR
| Patent application number | Description | Published |
|---|---|---|
| 20110119318 | ZERO-COPY MATURING OF LARGE OBJECTS IN GENERATIONAL HEAP WITH COPYING COLLECTION - A method for performing garbage collection promotion, comprising determining that an age of a large young object is greater than a predetermined tenuring threshold, wherein the predetermined tenuring threshold specifies an age beyond which objects are promoted, setting a plurality of types of a plurality of large memory regions from young to old to promote the large young object to a large old object, wherein the plurality of large memory regions host the large young object, scavenging references of the large old object, wherein the large old object is a large promoted object, scanning a large young object list to identify a plurality of unvisited large young objects, wherein a plurality of visited bits of the plurality of unvisited large young objects are unset, and releasing a plurality of unvisited large memory regions, wherein the unvisited large memory regions host the plurality of unvisited large young objects. | 05-19-2011 |