380C Lecture 17.ppt

A B C * Generational Heap Organization Divide the heap in to two spaces: young and old Allocate in to the young space When the young space fills up, collect it, copying into the old space When the old space fills up collect both spaces - ignore remembered sets Generalizing to m generations if space n m fills up, collect n through n-1 to space from space to space Young Old * Generational Heap Organization Divide the heap in to two spaces: young and old Allocate in to the young space When the young space fills up, collect it, copying into the old space When the old space fills up collect both spaces - ignore remembered sets Generalizing to m generations if space n m fills up, collect 1 through n-1 to space from space to space Young Old * GenerationalWrite Barrier Unidirectional barrier record only older to younger pointers no need to record younger to older pointers, since we never collect the old space independently most pointers are from younger to older objects [Appel’89, Zorn’90] track the barrier between young objects and old spaces to space to space from space Young Old ? ? address barrier * GenerationalWrite Barrier to space to space from space Young Old ? ? unidirectional boundary barrier // original program // compiler support for incremental collection p.f = o; if (p barrier o barrier) { remsetnursery U p.f; } p.f = o; * GenerationalWrite Barrier Unidirectional record only older to younger pointers no need to record younger to older pointers, since we never collect the old space independently most pointers are from younger to older objects [Appel’89, Zorn’90] most mutations are to young objects [Stefanovic et al.’99] to space to space from space Young Old ? ? * Results * Garbage Collec