1. A method for analyzing processes using a processor, comprising:
identifying a node of a process that is potentially affected by an affected resource using information relating to a link between the node and the affected resource, the process having a related process instance that has an execution stage; and
applying an interval prediction model corresponding to the execution stage of the process instance and the node, the interval prediction model determining a probability that the process instance will reach the node within an interval of time occurring before a designated occurrence and adjusting the process being analyzed based on the probability.
2. The method of claim 1, further comprising applying an outcome prediction model corresponding to the execution stage of the process instance and the node, the outcome prediction model determining a probability that the node will be executed by the process instance.
3. The method of claim 2, further comprising predicting that the process instance will be impacted if the outcome prediction model and the interval prediction model indicate that the process instance will execute the node before the resource is restored with a confidence level above a threshold value.
4. The method of claim 2, wherein applying the outcome prediction model includes applying a classification model.
5. The method of claim 1, wherein applying the interval prediction model includes applying a classification model to determine whether the process instance will reach the node within a defined period.
6. The method of claim 1, wherein applying the interval prediction model includes utilizing time series forecasting to determine whether the process instance will reach the node within a defined period.
7. The method of claim 1, further comprising installing an information technology resource monitoring system in a managed process to facilitate identification of the affected resource.
8. The method of claim 1, further comprising:
identifying the process instance as a likely impacted instance; and
adjusting the process instance to avoid the likely impact.
9. The method of claim 1, further comprising installing probes to monitor a status of a set of resources.
10. The method of claim 1, wherein the interval prediction model predicts a time interval for the process instance to reach the node.
11. The method of claim 10, further comprising comparing the time interval for the process instance to reach the node to a time interval statistic to restore the affected resource.
12. A method for analyzing processes using a processor, comprising:
identifying an at-risk instance using an established forward path through a node being affected by a status change of a system resource;
determining whether the at-risk instance will execute the node with a confidence level above a certain threshold value; and
determining and providing an indication to a user as to whether the at-risk instance will reach the node prior to returning the status to an original condition.
13. The method of claim 12, wherein determining whether the at-risk instance will execute the node comprises using an outcome prediction model.
14. The method of claim 12, wherein determining whether the at-risk instance will reach the node comprises using an interval prediction model.
15. The method of claim 14, wherein the interval prediction model includes time series forecasting to determine whether the at-risk instance will reach the node within a defined period.
16. The method of claim 14, wherein the interval prediction model predicts a time for the at-risk instances to reach the node.
17. The method of claim 16, further comprising comparing the time for the at-risk instance to reach the node to a restoration time interval statistic.
18. The method of claim 12, further comprising predicting that the at-risk instance will be impacted when an outcome prediction model used to determine whether the at-risk instance will execute the node and an interval prediction model used to determine whether the at-risk instance will reach the node indicate that the at-risk instance will be affected with a confidence level above a threshold value.
19. The method of claim 12, further comprising identifying a blocked instance that is being impacted by the status change of the system resource using an established relationship between the blocked instance and the system resource.
20. The method of claim 12, further comprising:
identifying the at-risk instance as an impacted instance; and
adjusting the process to accommodate the impacted instance.
21. A system for analyzing processes, comprising:
a processor-based identification module adapted to identify a node of a process that is potentially affected by an affected resource using information relating to a link between the node and the affected resource, the process having a related process instance that has an execution stage;
a processor-based outcome prediction model corresponding to the execution stage of the process instance and the node, the processor-based outcome prediction model adapted to determine a probability that the node will be executed by the process instance; and
a processor-based interval prediction model corresponding to the execution stage of the process instance and the node, the processor-based interval prediction model adapted to determine a probability that the process instance will reach the node within an interval of time occurring before a designated occurrence and provide an indication of the probability to a user.
22. The system of claim 21, wherein the processor-based interval prediction model is adapted to predict a time interval for the process instance to reach the node.
23. The system of claim 21, further comprising a processor-based comparison module adapted to compare the time interval for the process instance to reach the node to a time interval statistic to restore the affected resource.
24. The system of claim 21, further comprising a processor-based impact module adapted to develop a prediction that the process instance will be impacted when the processor-based outcome prediction model and the processor-based interval prediction model indicate that the process instance will be affected with a confidence level above a threshold value.
25. The system of claim 21, wherein the processor-based interval prediction model includes a classification model.
26. Application instructions that when executed by a computer comprising a processor, comprise:
instructions adapted to identify a node of a process that is potentially affected by an affected resource using information relating to a link between the node and the affected resource, the process having a related process instance that has an execution stage;
instructions adapted to utilize an outcome prediction model corresponding to the execution stage of the process instance and the node, the outcome prediction model adapted to determine a probability that the node will be executed by the process instance; and
instructions adapted to utilize an interval prediction model corresponding to the execution stage of the process instance and the node, the interval prediction model adapted to determine a probability that the process instance will reach the node in an interval of time occurring before a designated occurrence.
27. The application instructions of claim 26, further comprising instructions adapted to compare the time interval for the process instance to reach the node to a time interval statistic to restore the affected resource.
28. The application instructions of claim 26, further comprising instructions adapted to develop a prediction that the process instance will be impacted when the outcome prediction model and the interval prediction model indicate that the process instance will be affected with a confidence level above a threshold value.
29. A system for analyzing processes, comprising:
processor-based means for identifying a node of a process that is potentially affected by an affected resource using information relating to a link between the node and the affected resource, the process having a related process instance that has an execution stage;
processor-based means for applying an outcome prediction model corresponding to the execution stage of the process instance and the node, the outcome prediction model determining a probability that the node will be executed by the process instance; and
processor-based means for applying an interval prediction model corresponding to the execution stage of the process instance and the node, the interval prediction model determining a probability that the process instance will reach the node before a designated occurrence.
30. A method for analyzing processes, comprising:
installing probes to monitor a status of a set of resources;
identifying a node of a process that is potentially affected by an affected resource in the set of resources using information relating to a link between the node and the affected resource, the process having a related process instance that has an execution stage;
applying an outcome prediction model corresponding to the execution stage of the process instance and the node, the outcome prediction model determining a probability that the node will be executed by the process instance; and
applying an interval prediction model corresponding to the execution stage of the process instance and the node, the interval prediction model predicting a time interval for the process instance to reach the node and determining a probability that the process instance will reach the node before a designated occurrence;
comparing the time interval for the process instance to reach the node to a time interval statistic to restore the affected resource;
predicting that the process instance will be impacted when the outcome prediction model and the interval prediction model indicate that the process instance will be affected with a confidence level above a threshold value.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method of generating an address for a circular buffer in a memory, comprising the steps of:
storing a first reference value representative of a begin address of the circular buffer;
storing a second reference value representative of an end address of the circular buffer;
storing a third reference value representative of a current write address of the circular buffer;
storing a fourth reference value representative of a current read address of the circular buffer; and
protecting data stored in memory locations within the circular buffer to prevent stored data being overwritten by further data.
2. The method according to claim 1, further comprising the step of:
storing a fifth reference value representative of the cyclic state of the circular buffer.
3. The method according to claim 2, wherein the fifth value is a boolean value.
4. The method according to claim 2, further comprising the step of preventing writing of data into the circular buffer depending upon the value of the fifth value.
5. The method according to claim 3, wherein the boolean value of the fifth value has one of two binary values, and the fifth value changes from one binary value to another as the value of either of the third and fourth value changes such as to pass the address of the end of the circular buffer.
6. The method according to claim 1, wherein the buffer is an incrementing buffer; further comprising the step of writing data into the circular buffer as determined by the following truth table:
4
second value >
fifth value one
buffer has free memory locations
third value >
binary value
and these can be allocated
fourth value
third value <
fifth value other
buffer has free memory locations
fourth <
binary value
and these can be allocated
second value
fourth value
fifth value one
buffer has free memory locations
third value
binary value
and these can be allocated
fourth value
fifth value other
buffer is full and no memory
third value
binary value
locations can be allocated
7. The method according to claim 1, wherein the data to be stored in the circular buffer is received at at least a first and a second data rate.
8. The method according to claim 7, further comprising the step of allocating an amount of memory space in the circular buffer in accordance with the data rate.
9. The method according to claim 1, wherein the circular buffer is used in a mobile telecommunications system.
10. A circular buffer having an address generator for generating an address for the circular buffer in a memory, comprising:
a first memory storage location storing a first reference value representative of a begin address of the circular buffer;
a second memory storage location storing a second reference value representative of an end address of the circular buffer;
a third memory storage location storing a third reference value representative of a current write address of the circular buffer;
a fourth memory storage location storing a fourth reference value representative of a current read address of the circular buffer; and
a memory controller for protecting data stored in memory locations within the circular buffer to prevent stored data being overwritten by further data.
11. The circular buffer according to claim 10, further comprising:
a fifth memory storage location storing a fifth reference value representative of the cyclic state of the circular buffer.
12. The circular buffer according to claim 11, wherein the memory controller is adapted to prevent writing of data into the circular buffer depending upon the value of the fifth value.
13. The circular buffer according to claim 12, wherein the fifth value has one of two binary values, and the memory controller is adapted to change the fifth value from one binary value to another as the value of either of the third and fourth value changes such as to pass the address of the end of the circular buffer.
14. The circular buffer according to claim 13, wherein the buffer is an incrementing buffer and the memory controller is adapted to allow writing of data into the circular buffer as determined by the following truth table:
5
second value >
fifth value one
buffer has free memory locations
third value >
binary value
and these can be allocated
fourth value
third value <
fifth value other
buffer has free memory locations
fourth <
binary value
and these can be allocated
second value
fourth value
fifth value one
buffer has free memory locations
third value
binary value
and these can be allocated
fourth value
fifth value other
buffer is full and no memory
third value
binary value
locations can be allocated
15. The circular buffer according to claim 10, wherein the data to be stored in the circular buffer is received at at least a first and a second data rate and the memory controller is adapted to allocate an amount of memory space in the circular buffer in accordance with the data rate.
16. A mobile telecommunications system comprising a circular buffer having an address generator for generating an address for the circular buffer in a memory, comprising:
a first memory storage location storing a first reference value representative of a begin address of the circular buffer;
a second memory storage location storing a second reference value representative of an end address of the circular buffer;
a third memory storage location storing a third reference value representative of a current write address of the circular buffer;
a fourth memory storage location storing a fourth reference value representative of a current read address of the circular buffer; and
a memory controller for protecting data stored in memory locations within the circular buffer to prevent stored data being overwritten by further data.
17. The mobile telecommunications system according to claim 16, wherein the circular buffer is according to any of claims 11 to 15.