Conditional deferred queuing

• US 9,141,447 B2
• Filed: 12/15/2010
• Issued: 09/22/2015
• Est. Priority Date: 12/15/2010
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Inventors: Sigalov, Fai, Boctor, Victor, De Graaf, Wilbert, Gourevitch, Greg, Wallace, Shaun Michael
• Primary Examiner(s): Kraft, Shih-Wei
• Application Number:
  US12/969,251
• Publication Number:
  US 20120159514A1
• Time in Patent Office: 1,742 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues

Abstract

Conditional deferred queuing may be provided. Upon receiving a message, one or more throttle conditions associated with the message may be identified. A lock associated with the throttle condition may be created on the message until the throttle condition is satisfied. Then, the lock on the message may be removed and the message may be delivered.

Claims

1. A method, implemented by a computing device, for providing conditional deferred queuing, the method comprising:

receiving, by a processor of the computing device, a message;

identifying, by the processor, a priority associated with the message;

assigning, by the processor, the message to a priority queue associated with the identified priority;

enqueuing, by the processor, the message on an active message queue associated with the priority queue;

identifying, by the processor, a throttle condition associated with the message at the computing device, the throttle condition including a concurrency limit condition that sets a limit on a number of messages that are concurrently processed for an individual user;

in response to identifying the throttle condition, creating, by the processor, a lock on the message associated with the throttle condition and assigning the message to a locked message queue of a conditional queue associated with the priority queue;

when the throttle condition is not satisfied, maintaining, by the processor, the message in the locked message queue and maintaining the lock on the message;

in response to determining that the throttle condition is satisfied, removing, by the processor, the lock on the message and moving the message to an unlocked queue associated with the conditional queue;

determining, by the processor, whether a dequeue request associated with the priority queue has been received;

in response to determining that the dequeue request has been received, determining, by the processor, whether the message is a first message in the unlocked queue associated with the priority queue; and

in response to determining that the message is the first message in the unlocked queue, delivering, by the processor, the message.

2. The method of claim 1, wherein the message comprises at least one of the following:

an e-mail message, an instant messaging service message, and a text message.

3. The method of claim 1, wherein identifying the throttle condition comprises identifying at least one of the following:

a resource availability condition, a message identifier condition, and a tenancy condition.

4. The method of claim 1, wherein the priority queue further comprises a plurality of messages not associated with the throttle condition.

5. The method of claim 4, further comprising:

receiving a delivery request associated with the identified priority;

determining whether the lock is maintained on the message; and

in response to determining that the lock is maintained on the message associated with the throttle condition, delivering at least one of the plurality of messages not associated with the throttle condition.

6. The method of claim 1, wherein delivering the message comprises delivering the message to at least one recipient user.

7. The method of claim 1, wherein delivering the message comprises delivering the message to a message processing component.

8. A computer-readable storage device, not including a signal, which stores a set of instructions which when executed performs a method for providing conditional deferred queuing, the method executed by the set of instructions comprising:

receiving, by a processor, a message;

identifying, by the processor, a priority associated with the message;

assigning, by the processor, the message to a priority queue associated with the identified priority;

enqueuing, by the processor, the message on an active message queue associated with the priority queue;

identifying, by the processor, a throttle condition associated with the message including a concurrency limit condition that sets a limit on a number of messages that are concurrently processed for an individual user;

in response to identifying the throttle condition, creating, by the processor, a lock on the message associated with the throttle condition and assigning the message to a locked message queue of a conditional queue associated with the priority queue;

when the throttle condition is not satisfied, maintaining, by the processor, the message in the locked message queue and maintaining the lock on the message;

determining whether the throttle condition is satisfied;

in response to determining that the throttle condition is satisfied, removing, by the processor, the lock on the message and moving the message to an unlocked queue associated with the conditional queue;

determining, by the processor, whether a dequeue request associated with the priority queue has been received;

in response to determining that the dequeue request has been received, determining, by the processor, whether the message is a first message in the unlocked queue associated with the priority queue; and

in response to determining that the message is the first message in the unlocked queue, delivering, by the processor, the message.

9. The computer-readable storage device of claim 8, wherein the throttle condition includes a concurrency limit condition associated with at least one of the following:

a recipient of the message and a sender of the message.

10. The computer-readable storage device of claim 8, wherein the throttle condition comprises a message identifier condition limiting processing of a plurality of copies of the message.

11. The computer-readable storage device of claim 8, wherein the throttle condition comprises a resource availability condition.

12. The computer-readable storage device of claim 11 wherein the resource availability condition comprises a threshold number of simultaneous messages that can be handled by a message processing component.

13. The computer-readable storage device of claim 8, wherein the throttle condition comprises a tenancy condition associated with queuing a plurality of messages associated with a plurality of message processing tenants.

14. A system for providing a context-aware environment, the system comprising:

a memory storage; and

a processing unit coupled to the memory storage, wherein the processing unit is operative to;

receive, by the processing unit, a message;

identify, by the processing unit, a priority associated with the message;

assign, by the processing unit, the message to a priority queue associated with the identified priority;

enqueue, by the processor, the message on an active message queue associated with the priority queue;

identify, by the processing unit, a throttle condition associated with the message including a concurrency limit condition that sets a limit on a number of messages that are concurrently processed for an individual user;

in response to identifying the throttle condition, creating, by the processor, a lock on the message associated with the throttle condition and assigning the message to a locked message queue of a conditional queue associated with the priority queue;

when the throttle condition is not satisfied, maintaining, by the processing unit, the message in the locked message queue and maintaining the lock on the message;

in response to determining that the throttle condition is satisfied, removing, by the processing unit, the lock on the message and moving the message to an unlocked queue associated with the conditional queue;

determine, by the processing unit, whether a dequeue request associated with the priority queue has been received;

in response to determining that the dequeue request has been received, determine, by the processing unit, whether the message is a first message in the unlocked queue associated with the priority queue; and

in response to determining that the message is the first message in the unlocked queue, deliver, by the processing unit, the message.

15. The system of claim 14, wherein identifying the throttle condition comprises identifying at least one of the following:

a resource availability condition, a message identifier condition, and a tenancy condition.

16. The system of claim 14, wherein the priority queue further comprises a plurality of messages not associated with the throttle condition.

17. The system of claim 16, further comprising:

receiving a delivery request associated with the identified priority;

determining whether the lock is maintained on the message; and

in response to determining that the lock is maintained on the message associated with the throttle condition, delivering at least one of the plurality of messages not associated with the throttle condition.

18. The system of claim 14, wherein delivering the message comprises delivering the message to at least one recipient user.

19. The system of claim 14, wherein delivering the message comprises delivering the message to a message processing component.