×

Weak synchronization and scheduling among concurrent asynchronous processors

  • US 4,445,197 A
  • Filed: 10/27/1981
  • Issued: 04/24/1984
  • Est. Priority Date: 10/27/1981
  • Status: Expired due to Term
First Claim
Patent Images

1. A method for weakly synchronizing and externally scheduling a plurality of processors with reference to mutually exclusive access by one processor of the plurality to a shared resource, each processor executing tasks asynchronously with respect to the task execution by the other processors, each processor generating an associated numerically coded identity signal, comprising the steps of:

  • (a) selectively generating one of a first set of numerically coded signals by each processor and indicative of the processor'"'"'s internal state (i.e. idle, busy, waiting);

    (b) sensing the numerically coded signal from each processor, the sensed signals collectively constituting a second set of numerically coded signals, both the first and second sets of signals being well ordered in that there always exists at least one minimum valued signal in each set, each sensed signal also constituting a numerical bid for mutually exclusive access to the shared resource;

    (c) providing external indication to each processor whether its sensed signal was the minimum valued signal in the second set of signals; and

    at each processor, either(d) executing a task including that portion requiring uninterrupted access to the shared resource upon indication that the corresponding sensed signal was minimum valued,(e) deferring execution of a task until indication that its sensed signal is minimum valued is received, or(f) responsive to the indication that its sensed signal was not minimum valued, selecting another task.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×