Patent US5794049A successfully refreshed from Google Patents.
US5794049A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Computer system and method for executing architecture specific code with reduced run-time memory space requirements
Assignee: Oracle America Inc
•
Filing: 1996-06-05
•
Granted: 1998-08-11
•
Expires: 2016-06-05
Abstract
Abstract A client computer system and associated method in a computer network over which is provided programs with methods in architecture neutral code. The client computer is capable of executing the programs with reduced run-time memory space requirements when the methods are in architecture specific code generated from the architecture neutral code of the methods. Specifically, a network communications interface receives the methods in architecture neutral code. A network communications manager loads uncompressed in available space in the run-time memory the architecture neutral code of the methods when received. A code generator then generates in the run-time memory uncompressed architecture specific code of the methods from the loaded architecture neutral code of the methods. An execution controller controls execution of the programs so that the methods are invoked and not invoked at different times. A code compressor compresses in the run-time memory the uncompressed architecture specific code of compressible ones of the methods that are not invoked so that space is made available in the run-time memory. The code compressor also decompresses in available space in the run-time memory the compressed architecture specific code of decompressible ones of the methods so that the decompressible ones of the methods may be invoked.
Inventors
- 👤 Timothy G. Lindholm
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 16:47
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/40; G06F8/41; G06F8/44; G06F8/443; G06F8/4441; G06F9/00; G06F9/06; G06F9/44; G06F9/445; G06F9/44505
Claims Analysis
Total Claims: 30
Claim 1
Independent Claim
202 words
In a computer network over which is provided programs with methods in architecture neutral code, a client computer system for executing the programs with reduced run-time memory space requirements when the methods are in architecture specific code generated from the architecture neutral code of the methods, the client computer system comprising: a run-time memory; a network communications interface that receives the methods in architecture neutral code; a network communications manager that loads, in uncompressed form, into available space in the run-time memory the architecture neutral code of the methods when received; a code generator that generates in the run-time memory uncompressed architecture specific code of the methods from the loaded architecture neutral code of the methods; an execution controller that controls execution of the programs, whereby the methods are invoked and not invoked at different times; a code compressor to (A) compress in the run-time memory the uncompressed architecture specific code of compressible ones of the methods that are not invoked, whereby space is made available in the run-time memory, and (B) decompress into available space in the run-time memory the compressed architecture specific code of decompressible ones of the methods so that the decompressible ones of the methods may be invoked.
Claim 2
Dependent Claim
202 words
In a computer network over which is provided programs with methods in architecture neutral code, a client computer system for executing the programs with reduced run-time memory space requirements when the methods are in architecture specific code generated from the architecture neutral code of the methods, the client computer system comprising: a run-time memory; a network communications interface that receives the methods in architecture neutral code; a network communications manager that loads, in uncompressed form, into available space in the run-time memory the architecture neutral code of the methods when received; a code generator that generates in the run-time memory uncompressed architecture specific code of the methods from the loaded architecture neutral code of the methods; an execution controller that controls execution of the programs, whereby the methods are invoked and not invoked at different times; a code compressor to (A) compress in the run-time memory the uncompressed architecture specific code of compressible ones of the methods that are not invoked, whereby space is made available in the run-time memory, and (B) decompress into available space in the run-time memory the compressed architecture specific code of decompressible ones of the methods so that the decompressible ones of the methods may be invoked.
Claim 3
Dependent Claim
37 words
The client computer system of claim 1 wherein the code compressor decompresses the compressed architecture specific code of the decompressible ones of the methods as soon as the decompressible ones of the methods are to be invoked.
Claim 4
Dependent Claim
29 words
The client computer system of claim 1 wherein the code compressor decompresses the compressed architecture specific code of the decompressible ones of the methods after a predetermined time interval.
Claim 5
Dependent Claim
37 words
The client computer system of claim 1 wherein the code compressor compresses the uncompressed architecture specific code of the compressible ones of the methods as soon as the compressible ones of the methods are no longer invoked.
Claim 6
Dependent Claim
35 words
The client computer system of claim 1 wherein the code compressor compresses the uncompressed architecture specific code of the compressible ones of the methods when space in the run-time memory is needed but not available.
Claim 7
Dependent Claim
71 words
The client computer system of claim 5 further comprising: a least recently invoked list that lists those of the methods that are currently not invoked in order of least recently invoked method to most recently invoked method; the compressible ones of the methods are the least recently invoked methods in the least recently invoked list with uncompressed architecture specific code when space in the run-time memory is needed but not available.
Claim 8
Dependent Claim
16 words
The client computer system of claim 1 wherein the run-time memory is a random access memory.
Claim 9
Dependent Claim
38 words
The client computer system of claim 1 wherein the code compressor flushes from the run-time memory the compressed architecture specific code of flushable ones of the methods when space in the run-time memory is needed but not available.
Claim 10
Dependent Claim
70 words
The client computer system of claim 1 further comprising: a secondary memory; the code compressor (A) stores in the secondary memory the compressed architecture specific code of storable ones of the methods when space in the run-time memory is needed but not available, and (B) retrieves from the secondary memory the compressed architecture specific code of retrievable ones of the methods whose compressed architecture specific code is to be decompressed.
Claim 11
Dependent Claim
178 words
In a computer network over which is provided programs with methods in architecture neutral code, a method of executing the programs with reduced run-time memory space requirements when the methods are in architecture specific code generated from the architecture neutral code of the methods, the method comprising the steps of: providing a run-time memory; receiving the programs in architecture neutral code; loading, in uncompressed form, into available space in the run-time memory the architecture neutral code of the methods when they are received; generating in the run-time memory uncompressed architecture specific code of the methods from the loaded architecture neutral code of the methods; executing the programs, whereby the methods are invoked and not invoked at different times; compressing in the run-time memory the uncompressed architecture specific code of compressible ones of the methods that are not invoked, whereby space is made available in the run-time memory; and decompressing into available space in the run-time memory the compressed architecture specific code of decompressible ones of the methods so that the decompressible ones of the methods may be invoked.
Claim 12
Dependent Claim
178 words
In a computer network over which is provided programs with methods in architecture neutral code, a method of executing the programs with reduced run-time memory space requirements when the methods are in architecture specific code generated from the architecture neutral code of the methods, the method comprising the steps of: providing a run-time memory; receiving the programs in architecture neutral code; loading, in uncompressed form, into available space in the run-time memory the architecture neutral code of the methods when they are received; generating in the run-time memory uncompressed architecture specific code of the methods from the loaded architecture neutral code of the methods; executing the programs, whereby the methods are invoked and not invoked at different times; compressing in the run-time memory the uncompressed architecture specific code of compressible ones of the methods that are not invoked, whereby space is made available in the run-time memory; and decompressing into available space in the run-time memory the compressed architecture specific code of decompressible ones of the methods so that the decompressible ones of the methods may be invoked.
Claim 13
Dependent Claim
36 words
The method of claim 10 wherein the decompressing step includes decompressing the compressed architecture specific code of the decompressible ones of the methods as soon as the decompressible ones of the methods are to be invoked.
Claim 14
Dependent Claim
28 words
The method of claim 10 wherein the decompressing step includes decompressing the compressed architecture specific code of the decompressible ones of the methods after a predetermined time interval.
Claim 15
Dependent Claim
36 words
The method of claim 10 wherein the compressing step includes compressing the uncompressed architecture specific code of the compressible ones of the methods as soon as the compressible ones of the methods are no longer invoked.
Claim 16
Dependent Claim
33 words
The method of claim 10 wherein the compressing step includes compressing the architecture specific code of the compressible ones of the methods when space in the run-time memory is needed but not available.
Claim 17
Dependent Claim
73 words
The method of claim 14 further comprising the steps of: providing a least recently executed list that lists those of the methods that are currently not invoked in order of least recently invoked method to most recently invoked method; the compressible ones of the methods are the least recently invoked methods in the least recently invoked list with uncompressed architecture specific code when space in the run-time memory is needed but not available.
Claim 18
Dependent Claim
14 words
The method of claim 10 wherein the run-time memory is a random access memory.
Claim 19
Dependent Claim
37 words
The method of claim 10 further comprising the step of flushing from the run-time memory the compressed architecture specific code of flushable ones of the programs when space in the run-time memory is needed but not available.
Claim 20
Dependent Claim
66 words
The method of claim 10 further comprising the steps of: providing a secondary memory; storing in the secondary memory the compressed architecture specific code of storable ones of the methods when space in the run-time memory is needed but not available; and retrieving from the secondary memory the compressed architecture code of retrievable ones of the methods whose compressed architecture specific code is to be decompressed.
Claim 21
Dependent Claim
225 words
A computer program product for use with a client computer system in a computer network over which is provided programs with methods in architecture neutral code, the client computer system including a network communications interface to receive the methods in architecture neutral code and a run-time memory to execute the programs with the methods in architecture specific code generated from the architecture neutral code of the methods, the computer program product comprising a computer readable storage medium and a computer program mechanism embedded therein, the computer program mechanism comprising: a network communications manager that loads, in uncompressed form, into available space in the run-time memory the architecture neutral code of the methods when received; a code generator that generates in the run-time memory uncompressed architecture specific code of the methods from the loaded architecture neutral code of the methods; an execution controller that controls execution of the programs, whereby the methods are invoked and not invoked at different times; a code compressor to (A) compress in the run-time memory the uncompressed architecture specific code of compressible ones of the methods that are not invoked, whereby space is made available in the run-time memory, and (B) decompress in available space in the run-time memory the compressed architecture specific code of decompressible ones of the methods so that the decompressible ones of the methods may be invoked.
Claim 22
Dependent Claim
225 words
A computer program product for use with a client computer system in a computer network over which is provided programs with methods in architecture neutral code, the client computer system including a network communications interface to receive the methods in architecture neutral code and a run-time memory to execute the programs with the methods in architecture specific code generated from the architecture neutral code of the methods, the computer program product comprising a computer readable storage medium and a computer program mechanism embedded therein, the computer program mechanism comprising: a network communications manager that loads, in uncompressed form, into available space in the run-time memory the architecture neutral code of the methods when received; a code generator that generates in the run-time memory uncompressed architecture specific code of the methods from the loaded architecture neutral code of the methods; an execution controller that controls execution of the programs, whereby the methods are invoked and not invoked at different times; a code compressor to (A) compress in the run-time memory the uncompressed architecture specific code of compressible ones of the methods that are not invoked, whereby space is made available in the run-time memory, and (B) decompress in available space in the run-time memory the compressed architecture specific code of decompressible ones of the methods so that the decompressible ones of the methods may be invoked.
Claim 23
Dependent Claim
37 words
The computer program product of claim 19 wherein the code compressor decompresses the compressed architecture specific code of the decompressible ones of the methods as soon as the decompressible ones of the methods are to be invoked.
Claim 24
Dependent Claim
29 words
The computer program product of claim 19 wherein the code compressor decompresses the compressed architecture specific code of the decompressible ones of the methods after a predetermined time interval.
Claim 25
Dependent Claim
37 words
The computer program product of claim 19 wherein the code compressor compresses the uncompressed architecture specific code of the compressible ones of the methods as soon as the compressible ones of the methods are no longer invoked.
Claim 26
Dependent Claim
35 words
The computer program product of claim 19 wherein the code compressor compresses the uncompressed architecture specific code of the compressible ones of the methods when space in the run-time memory is needed but not available.
Claim 27
Dependent Claim
71 words
The computer program product of claim 23 further comprising: a least recently executed list that lists those of the methods that are currently not invoked in order of least recently invoked method to most recently invoked method; the compressible ones of the methods are the least recently invoked methods in the least recently invoked list with uncompressed architecture specific code when space in the run-time memory is needed but not available.
Claim 28
Dependent Claim
16 words
The computer program product of claim 19 wherein the run-time memory is a random access memory.
Claim 29
Dependent Claim
38 words
The computer program product of claim 19 wherein the code compressor flushes from the run-time memory the compressed architecture specific code of flushable ones of the methods when space in the run-time memory is needed but not available.
Claim 30
Dependent Claim
75 words
The computer program product of claim 19 wherein: the client computer system further includes a secondary memory; the code compressor (A) stores in the secondary memory the compressed architecture specific code of storable ones of the methods when space in the run-time memory is needed but not available, and (B) retrieves from the secondary memory the compressed architecture specific code of retrievable ones of the methods whose compressed architecture specific code is to be decompressed.
References Cited (Backward Citations)
US5359713A
Cited
US5504901A
Cited
US5600823A
Cited
US5604905A
Cited
US5375242A
Cited
US5699539A
Cited
US5577230A
Cited
US5701476A
Cited
US5590331A
Cited
US5692047A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-08-10 | 2002-02-09 | 2002-08-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-08-10 | 2006-02-09 | 2006-08-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-08-10 | 2010-02-09 | 2010-08-11 | $7700.00 | Window Closed / Lapsed |