Patent ID: 6324550
Filing Date: 2001-11-27
Classification: G06F,Y10S

Abstract:
In a computer system which includes objects with references between objects forming an at least first directed graph; said computer system performing computing functions by way of a plurality of tasks each of which operate with or on said objects and at least one of which tasks is designated as a cleaner task; the system having the property that it is possible for the cleaner task to discover all objects and all starting points; each of said tasks adapted to indicate to the cleaner task the identify of any handle which has been displaced;a method of identification of unused ones of said objects, said method comprising the steps of, in order:(a) initiating said cleaner task, said cleaner task defining a set of unused objects which comprises initially all objects in said system;(b) said cleaner task traversing said directed graphs commencing at the respective initial starting points of said graphs; during traverse, removing from said set of unused objects the handle of each said object encountered during the traverse;(c) said cleaner task traversing all graphs for which the starting point is any handle which has been identified as displaced during execution of step b; and, during traverse, removing from said set of unused objects the handle of each said object encountered during the traverse.