Methods and systems for distributing information model nodes in memory
First Claim
1. A method in a data processing system having a business service application and a plurality of memories, the method comprising the steps of:
- monitoring access to each of a plurality of information model nodes associated with the business service application;
ranking each of the plurality of information model nodes based on a number of monitored accesses to each information model node;
identifying a weak association between two of the information model nodes based on the ranking of each of the plurality of information model nodes, the identifying including determining that the two information model nodes have sequential rankings and wherein the weak association includes a pointer from one to another of the two information nodes; and
distributing the plurality of information model nodes between two or more of the plurality of memories in accordance with the weak association, the distributing including determining a lower ranking one of the two information model nodes and distributing the lower ranking one to a different one of the memories than the other one of the two information model nodes.
2 Assignments
0 Petitions
Accused Products
Abstract
Methods, systems, and articles of manufacture consistent with the present invention provide a model validator that receives a request from a business service application to store data associated with a node in an information model, determines whether the node exists in the information model, and, when it is determined that the node does not exist, generates a new node in the information model based on at least a portion of the data and a current node in the information model. A usage profiler is also provided that monitors access to each node and, in response to the model validator generating a new node, re-ranks each node based on a number of monitored accesses to each node, identifies a weak association between two of the nodes based on the ranking of each of the nodes, and distributes the nodes between two or more memories in accordance with the weak association.
33 Citations
23 Claims
-
1. A method in a data processing system having a business service application and a plurality of memories, the method comprising the steps of:
-
monitoring access to each of a plurality of information model nodes associated with the business service application; ranking each of the plurality of information model nodes based on a number of monitored accesses to each information model node; identifying a weak association between two of the information model nodes based on the ranking of each of the plurality of information model nodes, the identifying including determining that the two information model nodes have sequential rankings and wherein the weak association includes a pointer from one to another of the two information nodes; and distributing the plurality of information model nodes between two or more of the plurality of memories in accordance with the weak association, the distributing including determining a lower ranking one of the two information model nodes and distributing the lower ranking one to a different one of the memories than the other one of the two information model nodes. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method in a data processing system having a business service application and a plurality of memories, the method comprising the steps of:
-
monitoring access to each of a plurality of information model nodes associated with the business service application; ranking each of the plurality of nodes based on a number of monitored accesses to each information model node; determining whether a first of the plurality of memories has space to store the two information model nodes, the first of the two information model nodes having a higher ranking than the second of the two information model nodes; when it is determined that the first of the plurality of memories does not have space to store the two information model nodes, identifying a weak association between two of the information model nodes based on the ranking of each of the plurality of information model nodes; and distributing the plurality of information model nodes between two or more of the plurality of memories in accordance with the weak association, wherein the step of distributing the plurality of information model nodes comprises the step of distributing each of the plurality of information model nodes having a ranking less than the ranking of the first node to a second of the plurality of memories, and wherein the step of distributing the plurality of information model nodes further comprises the step of storing each of the plurality of information model nodes having a ranking higher than or equal to the ranking of the first node in the first memory.
-
-
8. A computer-readable medium containing instructions for controlling a data processing system to perform a method, the data processing system having a business service application and a plurality of memories, the method comprising the steps of:
-
monitoring access to each of a plurality of information model nodes associated with the business service application; ranking each of the plurality of information model nodes based on a number of monitored accesses to each information model node; identifying a weak association between two of the information model nodes based on the ranking of each of the plurality of information model nodes; distributing the plurality of information model nodes between two or more of the plurality of memories in accordance with the weak association; receiving, via the first business tier system, a plurality of requests to traverse the weak association to the second node; calculating a number of the requests; determining whether the number of requests exceeds a predetermined threshold; and when it is determined that the number of requests exceeds the predetermined threshold, re-ranking each of the plurality of information model nodes. - View Dependent Claims (9, 10, 11, 12)
-
-
13. A computer-readable medium containing instructions for controlling a data processing system to perform a method, the data processing system having a business service application and a plurality of memories, the method comprising the steps of:
-
monitoring access to each of a plurality of information model nodes associated with the business service application; ranking each of the plurality of information model nodes based on a number of monitored accesses to each information model node; determining whether a first of the plurality of memories has space to store the two information model nodes, the first of the two information model nodes having a higher ranking than the second of the two information model nodes; when it is determined that the first of the plurality of memories does not have space to store the two information model nodes, identifying a weak association between two of the information model nodes based on the ranking of each of the plurality of information model nodes, the identifying including determining that the two information model nodes have sequential rankings and wherein the weak association includes a pointer from one to another of the two information nodes; and distributing the plurality of information model nodes between two or more of the plurality of memories in accordance with the weak association. - View Dependent Claims (14, 15)
-
-
16. A data processing system, comprising:
-
a storage having a plurality of information model nodes; a plurality of memories, at least one of the memories comprising a business service application associated with the information model nodes, and a usage profiler program that monitors access to each of a plurality of information model nodes associated with the business service application, ranks each of the plurality of nodes based on a number of monitored accesses to each node, identifies a weak association between two of the nodes based on the ranking of each of the plurality of information model nodes, and distributes the plurality of information model nodes between two or more of the plurality of memories in accordance with the weak association; and a processor that runs the usage profiler program, wherein the usage profiler program further generates an access pattern for each information model node so that each access pattern includes the number of monitored accesses to the respective information model node, and stores the access pattern for each information model node in association with the respective node. - View Dependent Claims (17, 18, 19, 20)
-
-
21. A data processing system, comprising:
-
a storage having a plurality of information model nodes; a plurality of memories, at least one of the memories comprising a business service application associated with the information model nodes, and a usage profiler program that monitors access to each of a plurality of information model nodes associated with the business service application, ranks each of the plurality of nodes based on a number of monitored accesses to each node, determines whether a first of the plurality of memories has space to store the two information model nodes, the first of the two information model nodes having a higher ranking than the second of the two information model nodes, when it is determined that the first of the plurality of memories does not have space to store the two information model nodes, identifies a weak association between two of the information model nodes based on the ranking of each of the plurality of information model nodes, and distributes the plurality of information model nodes between two or more of the plurality of memories in accordance with the weak association; and a processor that runs the usage profiler program. - View Dependent Claims (22, 23)
-
Specification