Distributing messages between local queues representative of a common shared queue

• US 20030110232A1
• Filed: 12/11/2001
• Published: 06/12/2003
• Est. Priority Date: 12/11/2001
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Miyake, Masashi E., Dryfoos, Robert O., Chen, Shawfu, Xiao, Wei-Yi, Feldman, Allan, Hu, David Y.
• Application Number:
  US10/014,089
• Publication Number:
  US 20030110232A1
• Time in Patent Office: Days
• US Class Current: 709/212
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers

Abstract

A common shared queue is provided, which includes a plurality of local queues. Each local queue is resident on a storage medium coupled to a processor. The local queues are monitored, and when it is determined that a particular local queue is being inadequately serviced, then one or more messages are moved from that local queue to one or more other local queues of the common shared queue.

Claims

1. A method of managing common shared queues of a communications environment, said method comprising:

providing a plurality of shared queues representative of a common shared queue, said plurality of shared queues being coupled to a plurality of processors; and

moving one or more messages from one shared queue of the plurality of shared queues to one or more other shared queues of the plurality of shared queues, in response to a detected condition.

2. The method of claim 1, wherein said plurality of shared queues reside on one or more external storage media coupled to the plurality of processors.

3. The method of claim 2, wherein said one or more external storage media comprise one or more direct access storage devices.

4. The method of claim 1, wherein each shared queue of said plurality of shared queues is local to a processor of said plurality of processors.

5. The method of claim 1, wherein said detected condition comprises a depth of said one shared queue being at a defined level.

6. The method of claim 1, wherein said moving comprises removing the one or more messages from the one shared queue and placing the one or more messages on the one or more other shared queues based on one or more distribution factors.

7. The method of claim 6, wherein the one or more distribution factors comprise processor power of at least one processor of the plurality of processors.

8. The method of claim 6, wherein the placing comprises determining a number of messages of the one or more messages to be placed on a selected shared queue of the one or more other shared queues.

9. The method of claim 8, wherein the one or more distribution factors comprise local processor power of the processor associated with the selected shared queue and total processor power of at least one processor of the plurality of processors, and wherein the determining comprises using a ratio of local processor power to total processor power in determining the number of messages to be placed on the selected shared queue.

10. The method of claim 9, wherein the determining further comprises adjusting the number of messages to be placed on the selected shared queue, if the number of messages is determined to be unsatisfactory for the selected shared queue.

11. The method of claim 10, wherein the number of messages is determined to be unsatisfactory, when a depth of the selected shared queue would be at a selected level should that number of messages be added.

12. The method of claim 1, wherein said moving is managed by at least one processor of the plurality of processors.

13. The method of claim 12, wherein said at least one processor provides an indication to at least one other processor of the plurality of processors that it is managing a move associated with the one shared queue.

14. A method of managing common shared queues of a communications environment, said method comprising:

providing a plurality of shared queues representative of a common shared queue, each shared queue of said plurality of shared queues being local to a processor of the communications environment;

monitoring, by at least one processor of the communications environment, queue depth of one or more shared queues of the plurality of shared queues;

determining, via the monitoring, that the queue depth of a shared queue of the one or more shared queues is at a defined level; and

moving one or more messages from the shared queue to one or more other shared queues of the plurality of shared queues, in response to the determining.

15. The method of claim 14, wherein said plurality of shared queues are resident on one or more direct access storage devices accessible to the processors coupled to the plurality of shared queues.

16. The method of claim 14, wherein said moving comprises determining, for each other shared queue of the one or more other shared queues, a number of messages of the one or more messages to be distributed to that other shared queue.

17. The method of claim 16, wherein the determining is based at least in part on processor power of the processor local to the other shared queue.

18. The method of claim 16, wherein the determining comprises adjusting the number, should that number of messages be undesirable for that other shared queue.

19. A method of providing a common shared queue, said method comprising:

providing a plurality of shared queues representative of a common shared queue, said plurality of shared queues being coupled to a plurality of processors; and

accessing, by a distributed application executing across the plurality of processors, the plurality of shared queues to process data used by the distributed application.

20. A system of managing common shared queues of a communications environment, said system comprising:

a plurality of shared queues representative of a common shared queue, said plurality of shared queues being coupled to a plurality of processors; and

means for moving one or more messages from one shared queue of the plurality of shared queues to one or more other shared queues of the plurality of shared queues, in response to a detected condition.

21. The system of claim 20, wherein said plurality of shared queues reside on one or more external storage media coupled to the plurality of processors.

22. The system of claim 21, wherein said one or more external storage media comprise one or more direct access storage devices.

23. The system of claim 20, wherein each shared queue of said plurality of shared queues is local to a processor of said plurality of processors.

24. The system of claim 20, wherein said detected condition comprises a depth of said one shared queue being at a defined level.

25. The system of claim 20, wherein said means for moving comprises means for removing the one or more messages from the one shared queue, and means for placing the one or more messages on the one or more other shared queues based on one or more distribution factors.

26. The system of claim 25, wherein the one or more distribution factors comprise processor power of at least one processor of the plurality of processors.

27. The system of claim 25, wherein the means for placing comprises means for determining a number of messages of the one or more messages to be placed on a selected shared queue of the one or more other shared queues.

28. The system of claim 27, wherein the one or more distribution factors comprise local processor power of the processor associated with the selected shared queue and total processor power of at least one processor of the plurality of processors, and wherein the means for determining comprises means for using a ratio of local processor power to total processor power in determining the number of messages to be placed on the selected shared queue.

29. The system of claim 28, wherein the means for determining further comprises means for adjusting the number of messages to be placed on the selected shared queue, if the number of messages is determined to be unsatisfactory for the selected shared queue.

30. The system of claim 29, wherein the number of messages is determined to be unsatisfactory, when a depth of the selected shared queue would be at a selected level should that number of messages be added.

31. The system of claim 20, wherein the moving is managed by at least one processor of the plurality of processors.

32. The system of claim 31, wherein said at least one processor provides an indication to at least one other processor of the plurality of processors that it is managing a move associated with the one shared queue.

33. A system of managing common shared queues of a communications environment, said system comprising:

a plurality of shared queues representative of a common shared queue, each shared queue of said plurality of shared queues being local to a processor of the communications environment;

means for monitoring, by at least one processor of the communications environment, queue depth of one or more shared queues of the plurality of shared queues;

means for determining that the queue depth of a shared queue of the one or more shared queues is at a defined level; and

means for moving one or more messages from the shared queue to one or more other shared queues of the plurality of shared queues, in response to the determining.

34. The system of claim 33, wherein said plurality of shared queues are resident on one or more direct access storage devices accessible to the processors coupled to the plurality of shared queues.

35. The system of claim 33, wherein said means for moving comprises means for determining, for each other shared queue of the one or more other shared queues, a number of messages of the one or more messages to be distributed to that other shared queue.

36. The system of claim 35, wherein the determining is based at least in part on processor power of the processor local to the other shared queue.

37. The system of claim 35, wherein the means for determining comprises means for adjusting the number, should that number of messages be undesirable for that other shared queue.

38. A system of providing a common shared queue, said system comprising:

a plurality of shared queues representative of a common shared queue, said plurality of shared queues being coupled to a plurality of processors; and

means for accessing, by a distributed application executing across the plurality of processors, the plurality of shared queues to process data used by the distributed application.

39. A system of managing common shared queues of a communications environment, said system comprising:

a plurality of shared queues representative of a common shared queue, said plurality of shared queues being coupled to a plurality of processors; and

at least one processor adapted to move one or more messages from one shared queue of the plurality of shared queues to one or more other shared queues of the plurality of shared queues, in response to a detected condition.

40. A system of managing common shared queues of a communications environment, said system comprising:

a plurality of shared queues representative of a common shared queue, each shared queue of said plurality of shared queues being local to a processor of the communications environment;

at least one processor of the communications environment adapted to monitor queue depth of one or more shared queues of the plurality of shared queues;

at least one processor adapted to determine that the queue depth of a shared queue of the one or more shared queues is at a defined level; and

at least one processor adapted to move one or more messages from the shared queue to one or more other shared queues of the plurality of shared queues, in response to the determining.

41. A system of providing a common shared queue, said system comprising:

a plurality of shared queues representative of a common shared queue, said plurality of shared queues being coupled to a plurality of processors; and

a distributed application executing across the plurality of processors accessing the plurality of shared queues to process data used by the distributed application.

42. At least one program storage device readable by a machine tangibly embodying at least one program of instructions executable by the machine to perform a method of managing common shared queues of a communications environment, said method comprising:

providing a plurality of shared queues representative of a common shared queue, said plurality of shared queues being coupled to a plurality of processors; and

moving one or more messages from one shared queue of the plurality of shared queues to one or more other shared queues of the plurality of shared queues, in response to a detected condition.

43. The at least one program storage device of claim 42, wherein said plurality of shared queues reside on one or more external storage media coupled to the plurality of processors.

44. The at least one program storage device of claim 43, wherein said one or more external storage media comprise one or more direct access storage devices.

45. The at least one program storage device of claim 42, wherein each shared queue of said plurality of shared queues is local to a processor of said plurality of processors.

46. The at least one program storage device of claim 42, wherein said detected condition comprises a depth of said one shared queue being at a defined level.

47. The at least one program storage device of claim 42, wherein said moving comprises removing the one or more messages from the one shared queue and placing the one or more messages on the one or more other shared queues based on one or more distribution factors.

48. The at least one program storage device of claim 47, wherein the one or more distribution factors comprise processor power of at least one processor of the plurality of processors.

49. The at least one program storage device of claim 47, wherein the placing comprises determining a number of messages of the one or more messages to be placed on a selected shared queue of the one or more other shared queues.

50. The at least one program storage device of claim 49, wherein the one or more distribution factors comprise local processor power of the processor associated with the selected shared queue and total processor power of at least one processor of the plurality of processors, and wherein the determining comprises using a ratio of local processor power to total processor power in determining the number of messages to be placed on the selected shared queue.

51. The at least one program storage device of claim 50, wherein the determining further comprises adjusting the number of messages to be placed on the selected shared queue, if the number of messages is determined to be unsatisfactory for the selected shared queue.

52. The at least one program storage device of claim 51, wherein the number of messages is determined to be unsatisfactory, when a depth of the selected shared queue would be at a selected level should that number of messages be added.

53. The at least one program storage device of claim 42, wherein said moving is managed by at least one processor of the plurality of processors.

54. The at least one program storage device of claim 53, wherein said at least one processor provides an indication to at least one other processor of the plurality of processors that it is managing a move associated with the one shared queue.

55. At least one program storage device readable by a machine tangibly embodying at least one program of instructions executable by the machine to perform a method of managing common shared queues of a communications environment, said method comprising:

providing a plurality of shared queues representative of a common shared queue, each shared queue of said plurality of shared queues being local to a processor of the communications environment;

monitoring, by at least one processor of the communications environment, queue depth of one or more shared queues of the plurality of shared queues;

determining, via the monitoring, that the queue depth of a shared queue of the one or more shared queues is at a defined level; and

moving one or more messages from the shared queue to one or more other shared queues of the plurality of shared queues, in response to the determining.

56. The at least one program storage device of claim 55, wherein said plurality of shared queues are resident on one or more direct access storage devices accessible to the processors coupled to the plurality of shared queues.

57. The at least one program storage device of claim 55, wherein said moving comprises determining, for each other shared queue of the one or more other shared queues, a number of messages of the one or more messages to be distributed to that other shared queue.

58. The at least one program storage device of claim 57, wherein the determining is based at least in part on processor power of the processor local to the other shared queue.

59. The at least one program storage device of claim 57, wherein the determining comprises adjusting the number, should that number of messages be undesirable for that other shared queue.

60. At least one program storage device readable by a machine tangibly embodying at least one program of instructions executable by the machine to perform a method of providing a common shared queue, said method comprising:

providing a plurality of shared queues representative of a common shared queue, said plurality of shared queues being coupled to a plurality of processors; and

accessing, by a distributed application executing across the plurality of processors, the plurality of shared queues to process data used by the distributed application.