Michey Niranjan Mehta

US Patent:

6446257, Sep 3, 2002

Filed:

Feb 4, 1999

Appl. No.:

09/244320

Inventors:

Salil Pradhan - Santa Clara CA
Mark D. Hennecke - Cupertino CA
Michey N Mehta - San Jose CA
Ruslan Meshenberg - Santa Clara CA

Assignee:

Hewlett-Packard Company - Palo Alto CA

International Classification:

G06F71701

US Classification:

717154, 707206

Abstract:

A generational garbage collection tool and method for a computer system that pre-allocates computer resources during compile-time for later use by a generational garbage collector at run-time. The invention reduces the overall cost of dealing with long-lived objects and thereby allows a generational garbage collector to focus deallocation efforts on young objects, which are more likely to be dead. The present embodiment reduces pause time to a level that does not disturb interactive users. The embodiment allocates space for interior pointers at compile-time when the location of interior pointers is known and thereby facilitates generational garbage collection. By enabling the use of threaded interior pointers during generational garbage collection, live object relocation is improved by requiring an update to one pointer instead of updating each pointer that references an object. The present embodiment identifies the pointers that may be updated due to generational garbage collection, and by selectively allocating space to only those pointers that may be accessed during generational garbage collection and not all pointers, computer resources are saved. Further, the present embodiment may include locking information in the pointer to determine whether the object is presently being updated and is therefore locked.

US Patent:

8209512, Jun 26, 2012

Filed:

Mar 16, 2009

Appl. No.:

12/404935

Inventors:

Scott Rhine - Isanti MN, US
Michey N. Mehta - San Jose CA, US
David M. Bernardo - West Townsend MA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 12/00

US Classification:

711170, 711156

Abstract:

According to one embodiment, a request is received for executing a process on a computer. Information is accessed for a plurality of cells associated with the computer. A cell is selected that is the preferred candidate among the plurality of cells for executing the process using memory, which resides on the selected cell, based, at least in part, on the accessed information and the request.

US Patent:

53613511, Nov 1, 1994

Filed:

Sep 21, 1990

Appl. No.:

7/586778

Inventors:

Dmitry Lenkov - San Jose CA
Shankar Unni - San Jose CA
Michey Mehta - San Jose CA
Mark W. McDowell - Fort Collins CO
Manoj Dadoo - San Jose CA
Bruno Melli - Fort Collins CO

Assignee:

Hewlett-Packard Company - Palo Alto CA

International Classification:

G06F 1100

US Classification:

395700

Abstract:

The present invention is directed to computer software compilation systems and methods which support run-time data type identification of objects in computer programming languages which support polymorphism. The present invention comprises translators, compilers, and debuggers. The compiler and translator store modified debug information in an object code file. The modified debug information contains information regarding either multiple virtual tables or concatenated virtual tables. A debug lookup table is constructed from the modified debug information. The debugger uses the debug lookup table to determine the actual data types of the objects, and to completely and accurately display and modify the objects' contents. Also, innovative type inquiry operators reference the concatenated virtual tables to determine the actual data types of the objects during run-time. The operation of the compiler, translator, and debugger is transparent to computer programmers and operators.

US Patent:

56131208, Mar 18, 1997

Filed:

Oct 20, 1994

Appl. No.:

8/325155

Inventors:

Andrew J. Palay - Mountain View CA
Shankar Unni - Campbell CA
Michey N. Mehta - San Jose CA

Assignee:

Silicon Graphics, Inc. - Mountain View CA

International Classification:

G06F 945

US Classification:

395710

Abstract:

A system and method for compiling and linking a source file is described. A compiler generates class information pertaining to object-oriented classes referenced in the source file. The class information is sufficient to enable a linker to resolve class definitions and to perform class relocation operations. The compiler also generates an object file from the source file. The object file includes the class information. The compiler generates the object file such that resolution of class definitions and performance of class relocation operations are delayed until operation of the linker. A linker links the object file potentially with at least one other object file or shared library to thereby generate an executable file or shared library. The linker uses the class information contained in the object file to resolve class definitions and to perform class relocation operations.

US Patent:

55600093, Sep 24, 1996

Filed:

Sep 21, 1990

Appl. No.:

7/586521

Inventors:

Dmitry Lenkov - San Jose CA
Shankar Unni - San Jose CA
Michey Mehta - San Jose CA
Mark W. McDowell - Fort Collins CO
Manoj Dadoo - San Jose CA
Bruno Melli - Fort Collins CO

Assignee:

Hewlett-Packard Company - Palo Alto CA

International Classification:

G06F 945

US Classification:

395700

Abstract:

The present invention comprises a computer-based system and method for generating meaningful symbolic debug information in translator-based software compilation systems. The present invention includes a translator, a compiler, a merger, and a debugger. The compiler and translator each generate symbolic debug information for a source code. The merger combines the debug information generated by the compiler and translator into a final debug information. The final debug information completely and accurately describes the source code. The debugger uses the final debug information to completely and accurately display the original source code, and to efficiently and effectively use actual variable and function names (from the original source code) when working with variables and functions.