Advanced synchronization and contention resolution

• US 20080120478A1
• Filed: 10/05/2007
• Published: 05/22/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,391
• Publication Number:
  US 20080120478A1
• Time in Patent Office: Days
• US Class Current: 711/150
• CPC Class Codes: G06F 9/526 Mutual exclusion algorithms

Abstract

A multiple computer environment is disclosed in which an application program executes simultaneously on a plurality of computers (M1, M2, . . . Mn) interconnected by a communications network (3) and in which the local memory of each computer is maintained substantially the same by updating in due course. A lock mechanism is provided to permit exclusive access to an asset, object, or structure (ie memory location) by acquisition and release of the lock. In particular, before a new lock can be acquired by any other computer on a memory location previously locked by one computer, any updating count(s) for the previously locked memory location are transmitted to all the other computers and their corresponding memory locations (before the in due course updating). Thus the lock acquiring computer can ascertain if its local memory has been adequately updated.

Claims

1. A computer system including a plurality of computers each having a local memory and each being interconnected via a communications network wherein a different portion of an application program written to execute on only a single computer executes substantially simultaneously on a corresponding one of said plurality of computers, at least one memory location accessible by said plurality of computers is replicated in the local memory of each said computer, said memory location including an updating count indicative of the sequence of updating of said memory location, said computer system further comprising:

updating means associated with each said computer to in due course update each said memory location via said communications network after each occasion at which each said memory location has its content written to, or re-written, with a new content, and new updating count; and

lock means associated with each said computer to acquire a lock on an object, asset or resource;

said lock means including a recording means in which is recorded the name and updating count of all said local memory locations written to prior to releasing said lock; and

said lock means after releasing said lock and prior to permitting the acquisition of the same lock by another one of said computers transmitting said updated memory location(s) and corresponding updating count(s) to said another one computer,

whereby any said computer on acquiring said lock has acquired the new updating count(s).

2. The system as in claim 1, wherein the object, asset or resource locked is the object asset or resource to which said new content is written.

3. The computer system as in claim 1, wherein said lock means comprises a lock server computer in addition to said plurality of computers, and also connected to said plurality of computers via said communications network.

4. The computer system as in claim 1, wherein said recording means comprises a look up table.

5. The computer system as in claim 4, wherein said look up table includes all updating counts for each recorded memory location.

6. The computer system as in claim 4, wherein said look up table includes only the final updating count for each recorded memory location.

7. The computer system as in claims 6, wherein the contents of said look up table comprises the address of a memory location at which said updated content is stored.

14. The multiple computer system as in claim 1, wherein the contents of said look up table comprises the address of a memory location at which said updated content is stored.

8. A multiple computer system comprising:

a plurality of computers each having a local memory and each being interconnected via a communications network;

means for executing a different partial portion of an application program written to execute in its entirety on only a single computer, said execution occurring substantially simultaneously on said different ones of said plurality of computers;

at least one memory location accessible by said plurality of computers is replicated in the local memory of each said computer;

said at least one accessible memory location including or storing an updating count indicative of the sequence of updating of said memory location;

updating means associated with each said computer to in due course update each said memory location via said communications network after each occasion at which each said memory location has its content written to, or re-written, with a new content, and new updating count; and

lock means associated with each said computer to acquire a lock on an object, asset or resource;

said lock means including a recording means in which is recorded the name and updating count of all said local memory locations written to prior to releasing said lock; and

said lock means after releasing said lock and prior to permitting the acquisition of the same lock by another one of said computers transmitting said updated memory location(s) and corresponding updating count(s) to said another one computer;

whereby any said computer on acquiring said lock has acquired the new updating count(s).

9. The multiple computer system as in claim 8, wherein the object, asset or resource locked is the object asset or resource to which said new content is written.

10. The multiple computer system as in claim 8, wherein said lock means comprises a lock server computer in addition to said plurality of computers, and also connected to said plurality of computers via said communications network.

11. The multiple computer system as in claim 8, wherein said recording means comprises a look up table.

12. The multiple computer system as in claim 11, wherein said look up table includes all updating counts for each recorded memory location.

13. The multiple computer system as in claim 11, wherein said look up table includes only the final updating count for each recorded memory location.

15. A plurality of computers interconnected via at least one communications network and operable to ensure carrying out of a method comprising:

a different portion of an application program written to execute on only a single computer executes substantially simultaneously on a corresponding one of a plurality of computers;

providing each of said plurality of computers with a local memory;

interconnected each of said plurality of computers via a communications network;

making at least one memory location accessible by said plurality of computers and replicated in the memory of each said plurality of computers;

associated with the corresponding memory location after each occasion at which each said memory location has its contents written to, or re-written, with a new content, an updating count indicative of the sequence of updating;

in due course updating all said corresponding memory locations of said computers via said communications network with said new content and new updating count;

prior to initially writing said new content, acquiring a lock on an object, asset or resource;

recording the name and updating count of all said local memory locations written to prior to releasing said lock;

releasing said lock; and

prior to permitting the acquisition of the same lock by another one of said computers, transmitting said updated memory location(s) and most recent updating count(s) to said another one computer, whereby any said computer on acquiring said lock has acquired the new updating count(s).

16. A computer program product stored in a computer readable media, the computer program including executable computer program instructions and adapted for execution by at least one computer to modify the operation at least one computer, the modification of operation including performing a method operable to permit a plurality of computers to carry out the method up as defined in claim 15.