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

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Strong, Hovey R., Lorie, Raymond A.
• Primary Examiner(s): Smith, Jerry
• Assistant Examiner(s): Harkcom, Gary V.
• Application Number:
  US06/315,568
• Time in Patent Office: 910 Days
• Field of Search: 364/200 MS File, 364/900 MS File
• US Class Current: 718/102
• CPC Class Codes: G06F 9/50 Allocation of resources, e.g. of the central processing unit [CPU]

Abstract

Weak synchronization and scheduling of each processor among concurrent asynchronous processors is governed by either task execution invoked by an external response indicating its low bid among the well-ordered set of most recently bid signals, task deferred until such indication is received from subsequent bid evaluations, or task aborted as by transfer to another task upon indication that an instantaneous bid was not the minimum.

Claims

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.

2. A method according to claim 1, characterized in that the step of sensing the numerically coded signals includes the step of

processing selected values of the numerically coded signals as if the values were the minimum valued signal of the first set of signals with respect to subsequent determinations of the minimum valued signal of the second set of signals.

3. A method according to claim 1, wherein at each processor the execution of a task includes the sequential execution of instructions, the steps further including either:

(a) deferring execution of the next instruction until an indication is received, or

(b) executing a branch in response to an indication that its sensed signal was not the minimum valued of the second set of signals.

4. A method for weakly synchronizing and externally scheduling n processors with reference to the mutually exclusive access by one of the processors to a shared resource, n being a positive integer, each processor executing tasks asynchronously with respect to the task execution by the other processors, each processor continuously generating a numerically coded signal from a first set of numerically coded signals resident therein and indicative of its processing state, each processor being coupled to a common evaluation facility through a counterpart port, comprising the steps of:

(a) sensing the currently generated numerically coded signal from each processor 1, 2, . . . , i, . . . n either in the form of an integer magnitude in the range from 1 to n or a reserved word k;

(b) converting the reserved word k sensed at the counterpart port to a unique port identity magnitude in the positive real number range k to k+1;

(c) n-way comparing each currently sensed signal from each processor through its counterpart port; and

(d) sending to each processor indication of whether its most recently sensed signal is the minimum of a second set of signals consisting of all the most recently sensed signals.

5. A method according to claim 4, characterized in that the method comprises the further step of processing selected magnitudes of the sensed signals converted to unique port identities in the integer value range from 1 to n as if the values were zero with respect to subsequent n-way comparisons of the current sensed signal from each processor upon the condition that said selected magnitudes are found to be minimum valued among the current sensed signals.