Patent EP0132381A2 successfully refreshed from Google Patents.
EP0132381A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method of synchronizing the sequence by which a variety of randomly called unrelated activities are executed in a digital processor
Assignee: Unisys Corp
•
Filing: 1984-07-19
•
Granted: —
•
Expires: 2004-07-19
Abstract
Abstract @ A method of synchronizing the sequence by which a variety of unrelated activities are executed in a digital processor when the activities are randomly called by multiple callers includes the steps of: providing a single processor queue for holding respective pointers to each different kind of activity that the processor performs; entering the pointer of an activity in the processor queue the first time that the activity is called; providing respective activity queues for each different kind of activity that the processor performs; entering a pointer to the caller of an activity in the respective queue for the called activity each time the activity is called subsequent to its first call; repeatedly executing a single activity pointed to by one pointer in the processor queue until that activity is executed once for each of its callers, provided that if the single activity calls another activity then, executing the single activity only up to the point where the call occurs; and proceeding in the same fashion with the execution of another activity pointed to by the processor queue.
Inventors
- 👤 Howard Hunt Green
- 👤 Christopher Jerome Tomlinson
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-27 22:47
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4843; G06F9/4881
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
184 words
A method of synchronizing the sequence by which a variety of unrelated activities are executed in a digital processor when said activities are randomly called by multiple callers, including the steps of: providing a single processor queue for holding respective pointers to each different kind of activity that the processor performs; entering the pointer of an activity in said processor queue the first time that the activity is called; providing respective activity queues for each different kind of activity that the processor performs; entering a pointer to the caller of an activity in the respective queue for the called activity each time the activity is called subsequent to its first call; repeatedly executing a single activity pointed to by one pointer in the processor queue until that activity is executed once for each of its callers as pointed to by its activity queue, provided that if said single activity calls another activity then, executing said single activity only up to the point where the call occurs; and proceeding in the same fashion with the execution of another activity pointed to by the processor queue.
Claim 2
Independent Claim
184 words
A method of synchronizing the sequence by which a variety of unrelated activities are executed in a digital processor when said activities are randomly called by multiple callers, including the steps of: providing a single processor queue for holding respective pointers to each different kind of activity that the processor performs; entering the pointer of an activity in said processor queue the first time that the activity is called; providing respective activity queues for each different kind of activity that the processor performs; entering a pointer to the caller of an activity in the respective queue for the called activity each time the activity is called subsequent to its first call; repeatedly executing a single activity pointed to by one pointer in the processor queue until that activity is executed once for each of its callers as pointed to by its activity queue, provided that if said single activity calls another activity then, executing said single activity only up to the point where the call occurs; and proceeding in the same fashion with the execution of another activity pointed to by the processor queue.
Claim 3
Dependent Claim
26 words
A method according to Claim 1 and further including the step of storing said single processor queue and respective activity queues as records in a memory.
Claim 4
Dependent Claim
32 words
A method according to Claim 1 and further including the step of limiting access to said queues such that said pointers can be entered therein by only one caller at a time.
Claim 5
Dependent Claim
25 words
A method according to Claim 1 and further including the step of coupling said queues to said processor and callers via a single time-shared bus.
Claim 6
Dependent Claim
40 words
A method according to Claim 1 and further including the step of storing the various activities that said processor performs in a memory which is coupled to and addressable by said processor but not by said callers of said activities.
Claim 7
Dependent Claim
33 words
A method according to Claim 1 and further including the step of removing said pointer to the calling activity from said activity queue when said called activity is executed for said calling activity.
Claim 8
Dependent Claim
153 words
A data processing system, including: a digital processor; a memory containing a variety of callable activities that said processor performs; a single processor queue; respective pointers in said processor queue pointing to each different kind of activity that has been called for said processor to perform; respective activity queues for each kind of activity that the processor performs; each activity queue containing pointers to the callers of that particular activity; means for directing said processor to repeatedly execute a single activity pointed to by one pointer in said processor queue until said single activity is executed once for each caller in the corresponding activity queue, provided that if said single activity calls another activity then to execute said single activity only up to the point where the call occurs; and means for directing said processor to proceed in the same fashion with the execution of another activity pointed to by said processor queue.
Claim 9
Dependent Claim
153 words
A data processing system, including: a digital processor; a memory containing a variety of callable activities that said processor performs; a single processor queue; respective pointers in said processor queue pointing to each different kind of activity that has been called for said processor to perform; respective activity queues for each kind of activity that the processor performs; each activity queue containing pointers to the callers of that particular activity; means for directing said processor to repeatedly execute a single activity pointed to by one pointer in said processor queue until said single activity is executed once for each caller in the corresponding activity queue, provided that if said single activity calls another activity then to execute said single activity only up to the point where the call occurs; and means for directing said processor to proceed in the same fashion with the execution of another activity pointed to by said processor queue.
Claim 10
Dependent Claim
39 words
A system according to Claim 7 wherein said means for directing includes a controller means that is responsive to an instruction from said processor to interrogate said pointers in said queues and to inform said processor of their status.
Claim 11
Dependent Claim
22 words
A system according to Claim 7 wherein said single processor queue and respective activity queues are comprised of records in a memory.
Claim 12
Dependent Claim
29 words
A system according to Claim 7 and further including means for limiting access to said queues such that said pointers are entered by only one caller at a time.
Claim 13
Dependent Claim
22 words
A system according to Claim 7 and further including a single time-shared bus coupling said queues to said processor and multiple callers.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.