Automatic resizing of shared memory for messaging

• US 20070118600A1
• Filed: 10/10/2005
• Published: 05/24/2007
• Est. Priority Date: 10/10/2005
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Arora, Nimar
• Granted Patent: US 7,937,257 B2
• Time in Patent Office: Days
• US Class Current: 709/206
• CPC Class Codes: G06F 11/3419 by assessing time
• CPC Class Codes: G06F 11/3447 Performance evaluation by modeling
• CPC Class Codes: G06F 11/3457 Performance evaluation by simulation
• CPC Class Codes: G06F 11/3485 for I/O devices
• CPC Class Codes: G06F 2201/88 Monitoring involving counting
• CPC Class Codes: G06F 9/5016 the resource being the memory

Abstract

Methods and systems for estimating the hypothetical performance of a messaging application are disclosed. A number of pool sizes may be identified, each pool size being a potential size for the memory allocated to the messaging application. An online simulation is running during the execution of the messaging application. The online simulation tracks the requests made by the messaging application and predicts the operation of the messaging application for each pool size. The data predicted includes the number of spill and unspill operations that read and write to disk. In addition, a method for calculating the age of the oldest message in a memory pool is disclosed. The age is used in determining the number of spill and unspill operations.

Claims

1. A method for estimating the hypothetical performance of an application, comprising:

identifying at least one pool size, each pool size specifying the size of a memory that could hypothetically be used by the application;

tracking one or more requests that are made by the application during execution; and

for each pool size, calculating the number of spills or unspills that would result from the one or more requests if the application were allocated the amount of memory specified by the pool size.

2. The method of claim 1, wherein the application is a messaging application.

3. The method of claim 1, wherein the one or more requests comprises:

a request selected from the group consisting of an enqueue request, a dequeue request, and a browse request.

4. The method of claim 1, wherein calculating the number of spills comprises:

incrementing the number of spills in response to an enqueue request, if it is determined that memory would be full at the time of the enqueue request.

5. The method of claim 1, wherein calculating the number of unspills comprises:

incrementing the number of unspills in response to a dequeue or browse request, if it is determined that the message specified by the dequeue or browse request would be stored on disk at the time of the dequeue or browse request.

6. The method of claim 1, further comprising:

displaying spill data based on the spill count or unspill data based on the unspill count.

7. The method of claim 6, wherein the spill data comprises one selected from the group consisting of a number of spills, a number of unspills, and a total number of spills and unspills.

8. The method of claim 6, wherein the spill data comprises one selected from the group consisting of time spent performing spill operations, time spent performing unspill operations, and total time spent performing spill and unspill operations.

9. The method of claim 6, further comprising:

receiving a selection from a user, the selection indicating a memory size for the application; and

resizing the memory allocated to the application in accordance with the selection.

10. The method of claim 1, further comprising:

automatically resizing the memory allocated to an application based on the number of spills or unspills.

11. A method for estimating the hypothetical age of a memory with a predetermined size, comprising:

tracking one or more requests that are made by an application during execution;

generating one or more outstanding message count data points based on the requests, each data point specifying an age and a message count, the message count being an estimate of the number of messages in the queue that are younger than the age; and

interpolating among the data points to find an age corresponding to the number of messages that can be stored in a memory with the predetermined size.

12. The method of claim 11, wherein generating one or more outstanding message count data points comprises incrementing the message count specified by a data point in response to an enqueue request.

13. The method of claim 11, wherein generating one or more outstanding message count data points comprises decrementing the message count specified by a data point in response to a dequeue request.

14. The method of claim 11, wherein generating one or more outstanding message data points comprises generating a message count by obtaining an enqueue count specifying a number of messages enqueued during a first time period, and subtracting from it a dequeue count specifying the number of those messages that have been dequeued.

15. The method of claim 14, further comprising selecting an age from within the first time period.

16. The method of claim 11, wherein interpolating among the data points comprises:

generating an outstanding message tracker function that includes each data point.

17. The method of claim 16, wherein interpolating among the data points further comprises:

determining an age at which the outstanding message tracker function reaches the predetermined size.

18. The method of claim 16,

wherein the method is used to estimate the hypothetical ages of a plurality of memories, each with a predetermined size,

and wherein interpolation among the data points is performed to find a plurality of ages, each age corresponding to the number of messages that can be stored in one memory.

19. A computer program product comprising a computer usable medium having executable code to execute a process for estimating the hypothetical performance of an application, the process comprising the steps of:

identifying at least one pool size, each pool size specifying the size of a memory that could hypothetically be used by the application;

tracking one or more requests that are made by the application during execution; and

for each pool size, calculating the number of spills or unspills that would result from the one or more requests if the application were allocated the amount of memory specified by the pool size.

20. A system for estimating the hypothetical performance of an application, comprising:

means for identifying at least one pool size, each pool size specifying the size of a memory that could hypothetically be used by the application;

means for tracking one or more requests that are made by the application during execution; and

means for calculating, for each pool size, the number of spills or unspills that would result from the one or more requests if the application were allocated the amount of memory specified by the pool size.