David J Allison

US Patent:

6363468, Mar 26, 2002

Filed:

Jun 22, 1999

Appl. No.:

09/337552

Inventors:

David Allison - San Ramon CA

Assignee:

Sun Microsystems, Inc. - Palo Alto CA

International Classification:

G06F 1206

US Classification:

711173, 711171, 711129, 711112

Abstract:

Systems and methods consistent with the present invention allocate memory of a memory array by partitioning the memory array into subheaps dedicated to frequently used memory blocks. To this end, the system collects memory statistics on memory usage patterns to determine memory block sizes most often used in the memory array. The system uses these statistics to partition the memory array into a main heap and at least one memory subheap. The system then allocates or deallocate memory of the memory array using the memory subheap. Furthermore, the system allocates memory of the memory subheap only for memory blocks having one of the memory block sizes most often used in the memory array.

US Patent:

6430665, Aug 6, 2002

Filed:

Jun 25, 1999

Appl. No.:

09/339808

Inventors:

David Allison - San Ramon CA
Elliot Poger - San Francisco CA
Raphael Jacoby - Mountain View CA

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F 1200

US Classification:

711172, 711158

Abstract:

Methods and systems consistent with the invention allocate memory of a memory array using a free list. The free list is a list of pointers to blocks of free memory located within the memory array. First, the system determines whether to sort the free list based on deallocation activity of the memory array. If so, the system sorts the free list according to the memory size of the blocks of free memory pointed to by the free list. The system then allocates memory of the memory array for the storage of data using the sorted free list.

US Patent:

6912640, Jun 28, 2005

Filed:

Mar 14, 2003

Appl. No.:

10/389270

Inventors:

David S. Allison - San Ramon CA, US
Deepankar Bairagi - Davis CA, US
Jeffrey M. Broughton - Pleasanton CA, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F012/00

US Classification:

711170, 707159, 707161, 707162, 711171, 711172, 711173

Abstract:

A method for executing an instruction stream includes partitioning the instruction stream using a partition point to obtain a first partition of the instruction stream and a second partition of the instruction stream, configuring the first partition and the second partition to fit separate e-caches, analyzing the first partition and the second partition to generate a runtime execution facility and a data transfer facility, and executing the first partition and the second partition on separate processors using the runtime execution facility and the data transfer facility.

US Patent:

6925640, Aug 2, 2005

Filed:

Oct 12, 2001

Appl. No.:

09/977508

Inventors:

David S. Allison - San Ramon CA, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F009/44

US Classification:

717165

Abstract:

Embodiments of the present invention are directed to a method and apparatus for extending a program element in a dynamically typed programming language. In one embodiment, a program element is extended without altering the source code defining the program element. An extend structure is used to extend a program element in a particular program. In one embodiment, the program element is a function. The function is extended by adding code to be executed by the function. In another embodiment, the program element is an enumeration. The enumeration is extend by adding additional constants to the enumeration. In another embodiment, the program element is a class. In one embodiment, a class is extended by adding code to the constructor of the class. In another embodiment, a class is extended by adding member variables to the class. In yet another embodiment, a class is extended by adding member functions to the class.

US Patent:

6961839, Nov 1, 2005

Filed:

Feb 13, 2003

Appl. No.:

10/365861

Inventors:

David S. Allison - San Ramon CA, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F012/00

US Classification:

711206, 711209

Abstract:

A system for generating native code of a software application includes a page table indexing a plurality of pages using a page pointer, wherein the page pointer includes an address of at least one of the plurality of pages, a memory cache including a page table cache and a page cache, and a statically-generated executable code to obtain data on at least one of the plurality of pages using the memory cache.

US Patent:

6988265, Jan 17, 2006

Filed:

Oct 12, 2001

Appl. No.:

09/977527

Inventors:

David S. Allison - San Ramon CA, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F 9/45

US Classification:

717143, 717141, 717142

Abstract:

The present invention provides a method and apparatus for statement boundary detection. In one embodiment of the present invention, a parser determines a natural end of a statement, where possible, based upon the context of the input stream and the syntax of the programming language. Thus, no statement terminator is necessary when a natural end to a statement is determined. The parser uses the natural end of a statement to terminate one statement and begin parsing another statement. In one embodiment, a special statement termination token is required to terminate a statement when no natural statement end exists. In another embodiment, a special statement termination token can be used to terminate a statement when a natural end of the statement exists.

US Patent:

6988266, Jan 17, 2006

Filed:

May 8, 2001

Appl. No.:

09/851018

Inventors:

William K. Lam - Newark CA, US
David S. Allison - San Ramon CA, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F 9/45

US Classification:

717160, 717161, 717150, 717151

Abstract:

A system and method for processing a variable looping statement into a constant looping statement to enable loop unrolling. A lower bound and an upper bound of the loop index within the variable looping statement are determined. A constant looping statement is then formed using the lower bound and upper bound to define a range over which the loop index varies within the constant looping statement. The constant looping statement further includes a conditional statement that reflects conditions in the initial expression and/or the exit expression of the variable looping statement. The conditional statement controls execution of the body of the generated constant looping statement, which includes the body from the original variable looping statement. Loop unrolling may then be performed on the generated constant looping statement.

US Patent:

7003764, Feb 21, 2006

Filed:

Oct 12, 2001

Appl. No.:

09/977526

Inventors:

David S. Allison - San Ramon CA, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F 9/45

US Classification:

717143, 707 6

Abstract:

The present invention provides a method and apparatus for the lexical analysis of computer source code. The lexical analyzer is dynamically configured at runtime to recognize a one or more reserved words or operators. Thus, the analyzer has the ability to interact with multiple languages. In one or more embodiments of the present invention, the analyzer is instantiated by a host application, for example, the parser of a compiler. The host application adds a list of tokens to the analyzer that must be recognized. These tokens comprise at least a subset of the reserved words and operators of the computer language. In one embodiment, the host application then queries the analyzer for the next token in the source code. In another embodiment, tokens are added during the query phase as needed. In a separate embodiment, tokens are dynamically removed from the analyzer as the needs of the host application change.