Prev | Up

Object Table Techniques

An object table is a vector of identically sized header objects or Object Table Entries. The application objects are all built from a single OTE and one or more indirect blocks. OTE's do not move in memory, but since they are identically sized, free-list techniques prevent fragmentation.

The blocks hanging off the OTE provide the room for more data when the object would be large than the OTE. Note that this system uses an extra level of indirection in order to create a GC'd heap with some useful properties:

Object Table methods can be added to most other existing algorithms, and already provide the double-indirection needed to make incrementalal (or even concurrant) GC feasible.

Problems with Object Tables


Last updated by Tue 16 January 1996