Patent ID: 6662287
Filing Date: 2003-12-09
Classification: G06F,Y10S

Abstract:
A process of managing free addresses in a memory, comprising steps of:a) providing a hierarchical tree containing a plurality of vertices arranged in a plurality of levels such that a bottom level contains a plurality of bottom vertices each containing a plurality of representations of a Free or Taken status of respective addresses in the memory, a top vertex, and at least one intermediate level between the top vertex and the bottom level containing at least one hierarchy vertex, each hierarchy vertex having a plurality of child vertices in a next lower level and each bottom vertex being a child to a respective hierarchy vertex in a lowest intermediate level, each hierarchy vertex containing a plurality of labels such that each label is associated with a child vertex and defines whether or not a path that includes the respective child vertex ends in a respective bottom level vertex containing at least one Free representation; b) input a memory command to the tree; and c) changing the representation of the status of an address based on the command.