| 摘要 |
PURPOSE:To make a range in which an exclusive occupancy is generated as small as possible and also to make a main storage capacity comparatively small, by dividing and subdividing a common resources area and systematizing it to a tree shape, at the time of carrying forward a processing, while occupying the shared resources in dependently to each other. CONSTITUTION:As for nodes A-E of a range which contains a root A in a tree struc ture, for instance, shown as a tree part alpha in the figure, the possibility that they are used by following up a fact that they are occupied themselves or one of the subordinate nodes is occupied is high, therefore, they are managed by a fixed management table 5. That is, management information is always held in a form of 1-to-1 in accordance with separate node. On the other hand, as for nodes F-K of a range shown as a tree part beta in the figure, the frequency by which they are occupied is not so high, and when it is tried to hold the management information in a form of 1-to-1 in accor dance with a separate node, sometimes the capacity of a main storage 1 become large. Therefore, when a state that the nodes are occupied as the present problem is generated, they are registered temporarily on a management table 6 and managed. In such a way, the common resources can be managed effectively, while reducing the memory capacity. |
