Publisher flow control and bounded guaranteed delivery for message queues

• US 7,779,418 B2
• Filed: 07/29/2005
• Issued: 08/17/2010
• Est. Priority Date: 12/30/2004
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Mishra, Shailendra, Surlaker, Kapil, Bhatt, Neerja
• Primary Examiner(s): Nguyen; Van H
• Application Number:
  US11/192,869
• Publication Number:
  US 20060149787A1
• Time in Patent Office: 1,845 Days
• Field of Search: 719310-314, 719/315, 719/318
• US Class Current: 719/314
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues

Abstract

Techniques for managing messages in computer systems are provided. In one embodiment, in response to a publisher attempting to enqueue a message in a queue, a determination is made whether a condition is satisfied. The condition is based on the current usage of the queue by the publisher. Based on whether the condition is satisfied, a decision is made whether to enqueue the message in the queue. The decision whether to enqueue the message may comprise restricting the publisher from enqueueing any more messages in the queue until the same or a different condition is satisfied.

Claims

1. A method for managing messages in computer systems, the method comprising:

if one or more conditions are satisfied, then spilling over first one or more messages from a queue in volatile memory to a permanent store, wherein the first one or more messages were enqueued in the queue by a publisher;

in response to spilling over the first one or more messages, updating a parameter associated with the publisher, wherein the parameter indicates a particular message of second one or more messages that were enqueued by the publisher in the queue after the first one or more messages;

wherein the first one or more messages and the second one or more messages have not been consumed by all consumers of one or more consumers that are associated with the publisher; and

in response to the occurrence of an event that requires a replay operation, performing the steps of;

inspecting the parameter to identify the first one or more messages in the permanent store;

retrieving the first one or more messages from the permanent store and enqueueing the first one or more messages in the queue without causing the publisher to re-create and to re-enqueue the first one or more messages in the queue even though the first one or more messages have not been consumed by all consumers of the one or more consumers that are associated with the publisher; and

causing the publisher to re-enqueue the second one or more messages in the queue as part of the replay operation;

wherein the method is performed by the one or more computing devices.

2. The method of claim 1, further comprising the step of:

in response to the occurrence of the event that requires the replay operation, determining that no message enqueued in the queue prior to the particular message should be re-enqueued in the queue by the publisher during the replay operation;

wherein the second one or more messages do not include any message of the first one or more messages.

3. The method of claim 2, wherein the second one or more messages include all messages that have been enqueued in the queue by the publisher after the particular message.

4. The method of claim 1, wherein the one or more conditions are associated with the cost incurred by the publisher in producing the first one or more messages.

5. The method of claim 4, wherein a particular condition of the one or more conditions is associated with the amount of time it takes the publisher to re-create the first one or more messages after a re-start performed by the publisher.

6. The method of claim 4, wherein a particular condition of the one or more conditions is associated with the amount of computing resources it takes the publisher to re-create the first one or more messages.

7. The method of claim 4, wherein a particular condition of the one or more conditions is associated with the number of messages enqueued in the queue by the publisher after enqueueing the last message that was consumed by all consumers of one or more consumers that are associated with the publisher.

8. A non-transitory machine-readable medium storing one or more sequences of instructions which, when executed by one or more processors, cause the one or more processors to perform steps comprising:

if one or more conditions are satisfied, then spilling over first one or more messages from a queue in volatile memory to a permanent store, wherein the first one or more messages were enqueued in the queue by a publisher;

in response to spilling over the first one or more messages, updating a parameter associated with the publisher, wherein the parameter indicates a particular message of second one or more messages that were enqueued by the publisher in the queue after the first one or more messages;

wherein the first one or more messages and the second one or more messages have not been consumed by all consumers of one or more consumers that are associated with the publisher; and

in response to the occurrence of an event that requires a replay operation, performing the steps of;

inspecting the parameter to identify the first one or more messages in the permanent store;

retrieving the first one or more messages from the permanent store and enqueueing the first one or more messages in the queue without causing the publisher to re-create and to re-enqueue the first one or more messages in the queue even though the first one or more messages have not been consumed by all consumers of the one or more consumers that are associated with the publisher; and

causing the publisher to re-enqueue the second one or more messages in the queue as part of the replay operation.

9. The non-transitory machine-readable medium of claim 8, wherein the one or more sequences of instructions further comprise instructions which, when executed by the one or more processors, cause the one or more processors to perform the step of:

in response to the occurrence of the event that requires the replay operation, determining that no message enqueued in the queue prior to the particular message should be re-enqueued in the queue by the publisher during the replay operation;

wherein the second one or more messages do not include any message of the first one or more messages.

10. The non-transitory machine-readable medium of claim 9, wherein the second one or more messages include all messages that have been enqueued in the queue by the publisher after the particular message.

11. The non-transitory machine-readable medium of claim 8, wherein the one or more conditions are associated with the cost incurred by the publisher in producing the first one or more messages.

12. The non-transitory machine-readable medium of claim 11, wherein a particular condition of the one or more conditions is associated with the amount of time it takes the publisher to re-create the first one or more messages after a re-start performed by the publisher.

13. The non-transitory machine-readable medium of claim 11, wherein a particular condition of the one or more conditions is associated with the amount of computing resources it takes the publisher to re-create the first one or more messages.

14. The non-transitory machine-readable medium of claim 11, wherein a particular condition of the one or more conditions is associated with the number of messages enqueued in the queue by the publisher after enqueueing the last message that was consumed by all consumers of one or more consumers that are associated with the publisher.