Code cache management

There is disclosed a dynamic cache (15) which is divided into sections, or chunks (20-1) through (20-N; 30-1) through (30-N), for the storage of optimized code. The optimized code may contain pointers (405) to code in other chunks. When a cache chunk is to be reused, then the pointers to other cache...

Full description

Saved in:
Bibliographic Details
Main Authors BUZBEE, WILLIAMS B, SHAH, LACKY V, MATTSON, JAMES S. JR
Format Patent
LanguageEnglish
French
German
Published 18.10.2000
Edition7
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:There is disclosed a dynamic cache (15) which is divided into sections, or chunks (20-1) through (20-N; 30-1) through (30-N), for the storage of optimized code. The optimized code may contain pointers (405) to code in other chunks. When a cache chunk is to be reused, then the pointers to other caches, as well as the pointers from other caches to code contained with the cache that is to be removed, are changed (407,410) to point to either code contained in a victim chunk (407) of the cache, or, alternatively, to point back to the translator (410). The system can dynamically change (50) the number and size of the cache chunks and the number and size of the victim chunks, if any.
Bibliography:Application Number: EP19990300069