Labels:dialog box | sky | web site | window OCR: Object- Oriented Programming Mark-Sweep Optimization Problem: Repeated scans of memory Desired algorithim: WI hen we mark an object, push it on stack. Repeat: Pop next object off at stack Mark all reachable obiects until stack is empty Unfortunately: The stack may be arbitrarily deep No extra memory when the running! Solution: Allocate one extra word per object. Use this pointer maintain alinked list of obiects "the stack When a.t7 object 1S found to be reachable Set "mark' bit Add it.to the linked list HArTT Porter 2001 algorithm objects Hart
