Portal de Periódicos da CAPES

Compacting garbage collection with ambiguous roots

1988; Association for Computing Machinery; Volume: 1; Issue: 6 Linguagem: Inglês

10.1145/1317224.1317225

1558-0245

Joel F. Bartlett,

Computer Graphics and Visualization Techniques

Many modern garbage collectors [4] recover space by copying. Using an initial "root" set of pointers which are stored in known locations, all accessible objects are copied into a "new space". Two of the attractive properties of such a collector are that it results in memory compaction and it can have a running time proportional to the amount of accessible storage [2]. However, such schemes place a large burden on the underlying system as all pointers to the objects must be found and changed.