Multi user threaded executor

1. A system for exclusive threads for multiple queues, the system comprising:

one or more processors; and

a non-transitory computer readable medium storing a plurality of instructions, which when executed, cause the one or more processors to:

add, by a computing system, a first event associated with a first entity to a first queue in response to receiving the first event;

add, by the computing system, a second event associated with a second entity to a second queue in response to receiving the second event;

add, by the computing system, a third event associated with the second entity to the second queue in response to receiving the third event;

remove, by a first thread in the computing system, the first event from the first queue, the first thread being associated with the first queue and a third queue and having the exclusive right to remove any event only from the first queue or the third queue;

process, by the first thread in the computing system, the first event; and

process, by the first thread in the computing system, an event in the third queue when all events in the first queue have been processed by the first thread.

2. The system of claim 1 , comprising further instructions, which when executed, cause the one or more processors to add, by the computing system, a fourth event associated with the first entity to the first queue in response to receiving the fourth event.

3. The system of claim 2 , comprising further instructions, which when executed, cause the one or more processors to:

remove, by the first thread in the computing system, the fourth event from the first queue; and

process, by the first thread in the computing system, the fourth event.

4. The system of claim 1 , comprising further instructions, which when executed, cause the one or more processors to:

remove, by a second thread in the computing system, the second event from the second queue, wherein any event in the second queue is removed exclusively by the second thread; and

process, by the second thread in the computing system, the second event.

5. The system of claim 4 , comprising further instructions, which when executed, cause the one or more processors to:

remove, by the second thread in the computing system, the third event from the second queue; and

process, by the second thread in the computing system, the third event.

6. The system of claim 1 , wherein adding the first event associated with the first entity to the first queue is based on applying a hash function to a unique identifier associated with the first entity.

7. The system of claim 1 , wherein adding the second event associated with the second entity to the second queue is based on applying a hash function to a unique identifier associated with the second entity.

8. A computer program product comprising computer-readable program code to be executed by one or more processors when retrieved from a non-transitory computer-readable medium, the program code including instructions to:

add, by a computing system, a first event associated with a first entity to a first queue in response to receiving the first event;

add, by the computing system, a second event associated with a second entity to a second queue in response to receiving the second event;

add, by the computing system, a third event associated with the second entity to the second queue in response to receiving the third event;

remove, by a first thread in the computing system, the first event from the first queue, the first thread being associated with the first queue and a third queue and having the exclusive right to remove any event only from the first queue or the third queue;

process, by the first thread in the computing system, the first event; and

process, by the first thread in the computing system, an event in the third queue when all events in the first queue have been processed by the first thread.

9. The computer program product of claim 8 , wherein the program code comprises further instructions to add, by the computing system, a fourth event associated with the first entity to the first queue in response to receiving the fourth event.

10. The computer program product of claim 9 , wherein the program code comprises further instructions to:

remove, by the first thread in the computing system, the fourth event from the first queue; and

process, by the first thread in the computing system, the fourth event.

11. The computer program product of claim 8 , wherein the program code comprises further instructions to:

remove, by a second thread in the computing system, the second event from the second queue, wherein any event in the second queue is removed exclusively by the second thread; and

process, by the second thread in the computing system, the second event.

12. The computer program product of claim 11 , wherein the program code comprises further instructions to:

remove, by the second thread in the computing system, the third event from the second queue; and

process, by the second thread in the computing system, the third event.

13. The computer program product of claim 8 , wherein adding the first event associated with the first entity to the first queue is based on applying a hash function to a unique identifier associated with the first entity.

14. The computer program product of claim 8 , wherein adding the second event associated with the second entity to the second queue is based on applying a hash function to a unique identifier associated with the second entity.

15. A method comprising:

adding, by a computing system, a first event associated with a first entity to a first queue in response to receiving the first event;

adding, by the computing system, a second event associated with a second entity to a second queue in response to receiving the second event;

adding, by the computing system, a third event associated with the second entity to the second queue in response to receiving the third event;

removing, by a first thread in the computing system, the first event from the first queue, the first thread being associated with the first queue and a third queue and having the exclusive right to remove any event only from the first queue or the third queue;

processing, by the first thread in the computing system, the first event; and

processing, by the first thread in the computing system, an event in the third queue when all events in the first queue have been processed by the first thread.

16. The method of claim 15 , wherein the method further comprises:

adding, by the computing system, a fourth event associated with the first entity to the first queue in response to receiving the fourth event;

removing, by the first thread in the computing system, the fourth event from the first queue; and

processing, by the first thread in the computing system, the fourth event.

17. The method of claim 15 , wherein the method further comprises:

removing, by a second thread in the computing system, the second event from the second queue, wherein any event in the second queue is removed exclusively by the second thread; and

processing, by the second thread in the computing system, the second event.

18. The method of claim 17 , wherein the method further comprises:

removing, by the second thread in the computing system, the third event from the second queue; and

processing, by the second thread in the computing system, the third event.

19. The method of claim 15 , wherein adding the first event associated with the first entity to the first queue is based on applying a hash function to a unique identifier associated with the first entity.

20. The method of claim 15 , wherein adding the second event associated with the second entity to the second queue is based on applying a hash function to a unique identifier associated with the second entity.