Contention resolution with counter rollover

• US 20080127213A1
• Filed: 10/05/2007
• Published: 05/29/2008
• Est. Priority Date: 10/05/2006
• Status: Abandoned Application

• Current Assignee: John M. Holt
• Original Assignee: John M. Holt
• Inventors: Holt, John M.
• Application Number:
  US11/973,390
• Publication Number:
  US 20080127213A1
• Time in Patent Office: Days
• US Class Current: 719/315
• CPC Class Codes: G06F 9/52 Program synchronisation; Mutual exclusion, e.g. by means of semaphores

Abstract

In a system such as a multiple computer system where memory locations (A, B, C) can be substantially simultaneously updated from difference sources, an updating count (C, C1) is provided indicative of the sequence of each updating message or signal (195, 295) in a stream of such updating messages or signals. The updating count is stored in a counter. To reduce the storage requirements for the counter and the bandwidth requirements for the updating messages including the count value, small count values are utilized. From time to time sending of updating messages is halted and the count values re-set to avoid arithmetic overflow.

Claims

1. A method ensuring correct operation of at least one finite counter each storing an updating count value in a system having corresponding memory locations each of which can be updated from different sources, said method comprising the steps of:

(i) providing at least one further data bit in addition to, and associated with, each said counter;

(ii) changing the state of the further data bit of each counter if said counter reaches a predetermined maximum count value; and

(iii) modifying the comparison of the count values of sequentially received updating messages or signals in accordance with the state of the further data bit associated with each said received message and the state of the further data bit of the previously received message.

2. The method as in claim 1, including the further step of:

(iv) interrupting the operation of said system from time to time or on the occurrence of a predetermined condition, in order to re-set the count of at least one said counter.

3. The method as in claim 2, including the further step of:

(v) interrupting the operation of said system from time to time or on the occurrence of a predetermined condition, in order to re-set the value of at least one of said further data bits.

4. The method as in claim 3, wherein said predetermined condition comprises at least one of said counters approaching or reaching a maximum count value.

5. The method as in claims 1, wherein the size of said counter is greater than the maximum expected size of any queue of updating messages.

6. A multiple memory system having an updating count value, said system comprising at least one finite counter each having at least one corresponding memory location and comparison means to compare sequentially received updating messages or signals from different sources each of which can update said memory locations, wherein said updating messages or signals include a further data bit, which changes state if said counter reaches a predetermined maximum count value, and said comparison means modifies the comparison of sequentially received updating messages or signals in accordance with the states of said further data bit of said sequentially received messages.

7. The system as in claim 6, including interrupt means to interrupt the operation of said system from time to time or on the occurrence of a predetermined condition, in order to re-set the count of at least one counter.

8. The system as in claim 7, including interrupt means to interrupt the operation of said system from time to time or on the occurrence of a predetermined condition, in order to re-set the value of at least one of said further data bits.

9. The system as in claim 8, wherein said predetermined condition comprises at least one of said counters approaching or reaching a maximum count value.

10. The system as in claims 9, wherein the size of said counter is greater than the maximum expected size of any queue of undelivered updating messages.

11. A computer program stored in a computer readable media, the computer program including executable computer program instructions and adapted for execution by a computer to modify the operation of the computer;

the modification of operation including performing method for ensuring correct operation of at least one finite counter each storing an updating count value in a system having corresponding memory locations each of which can be updated from different sources, said method comprising the steps of;

(i) providing at least one further data bit in addition to, and associated with, each said counter;

(ii) changing the state of the further data bit of each counter if said counter reaches a predetermined maximum count value; and

(iii) modifying the comparison of the count values of sequentially received updating messages or signals in accordance with the state of the further data bit associated with each said received message and the state of the further data bit of the previously received message.

12. The computer program as in claim 11, the method including the further step of:

(iv) interrupting the operation of said system from time to time or on the occurrence of a predetermined condition, in order to re-set the count of at least one said counter.

13. The computer program as in claim 12, the method including the further step of:

(v) interrupting the operation of said system from time to time or on the occurrence of a predetermined condition, in order to re-set the value of at least one of said further data bits.

14. The computer program as in claim 12, wherein said predetermined condition comprises at least one of said counters approaching or reaching a maximum count value.

15. The computer program as in claim 14, wherein the size of said counter is greater than the maximum expected size of any queue of updating messages.