METHOD AND SYSTEM FOR REGULATING COMMUNICATION TRAFFIC USING A LIMITER THREAD

• US 20080022289A1
• Filed: 09/27/2007
• Published: 01/24/2008
• Est. Priority Date: 09/13/2001
• Status: Active Grant

• Current Assignee: Bryce Curtis
• Original Assignee: Bryce Curtis
• Inventors: CURTIS, BRYCE
• Granted Patent: US 8,001,545 B2
• Time in Patent Office: Days
• US Class Current: 719/313
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues

Abstract

A methodology for using multiple execution threads to regulate message traffic is presented. An application thread spawns a limiter thread, and each have access in shared memory to a message count that reflects a number of messages that are transmitted by the application thread within a regulated time period. The limiter thread cycles by entering a sleep state for the regulated time period, resetting the message count upon awakening, and then reentering a sleep state. The application thread executes a loop that compares the message count against a maximum number of messages for the regulated time period; if the comparison is favorable, then another message is transmitted and the message count is adjusted. If the comparison is not favorable, then the application thread enters a sleep state; after awakening, it repeats the comparison, and depending on the result, it transmits a message or reenters a sleep state.

Claims

1-8. -8. (canceled)

9. A computer program product in a computer readable medium for use in regulating an amount of generated communication traffic using multiple execution threads or processes in a data processing system, the computer program product comprising:

instructions for starting a first thread or process and a second thread or process, wherein the first thread or process and the second thread or process access a message count variable in shared memory, wherein the message count variable represents a number of messages that are transmitted by the first thread or process within a first time unit;

instructions for sleeping the second thread or process for the first time unit;

instructions for resetting the message count variable by the second thread or process and re-sleeping the second thread or process for the first time unit in response to an awakening of the second thread or process;

instructions for comparing the message count variable with a predetermined count value on the first thread or process;

instructions for sleeping the first thread or process for a second time unit in response to a first comparative result;

instructions for repeating the comparison step on the first thread or process in response to an awakening of the first thread or process; and

instructions for adjusting the message count variable and transmitting a message on the first thread or process in response to a second comparative result.

10. The computer program product of claim 9 further comprising:

instructions for stopping the second thread or process after the first thread or process has completed its transmission of messages.

11. The computer program product of claim 9 wherein the second time period is substantially shorter than the first time period.

12. The computer program product of claim 9 wherein the second thread or process resets the message count variable to zero and the first thread or process adjusts the message count variable by incrementing the message count variable.

13. The computer program product of claim 9 wherein the second thread or process resets the message count variable to a non-zero number and the first thread or process adjusts the message count variable by decrementing the message count variable.

14-19. -19. (canceled)