Patent US3045318A successfully refreshed from Google Patents.
Patent EP0052713A2 successfully refreshed from Google Patents.
EP0052713A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
A process management system for scheduling work requests in a data processing system
Assignee: International Business Machines Corp
•
Filing: 1981-09-23
•
Granted: —
•
Expires: 2001-09-23
Abstract
Abstract Arrangement for scheduling the execution of predefined sequences of instructions for processing in a digital processor operating in a real time environment. Multiple processes (82,84, 86, 88, 90) for performing the multiple tasks assigned to a system processor are defined in storage space allocated in memory associated with the processor. A process includes a process control block (120) which contains the information on the current status of the process and for communicating with the work requests queued to that process and other processes. A process driver (122) invokes the program specified on and in response to the work request (125). At least one queue of work requests (125) is associated with each process, and the process driver (122) of the highest priority process selects the highest priority work request from its queue for processing. Multiple work requests may be scheduled for a given process by one or more processes.
Inventors
- 👤 Kenneth Milton Herrington
- 👤 Kenneth Layton Jeffries
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-26 05:59
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4843; G06F9/4881; G06F40/00; G06F40/10; G06F40/166
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
255 words
Arrangement for scheduling work requests in a text processing system operating in a real time environment and comprising a processor, a memory and processor input/output devices, said arrangement being characterized in that it comprises : multiple processes stored in said memory connected to said processor, said processes including a process control block and a process driver; a predefined set of instructions stored in said memory for being processed in response to work requests; means for dispatching a priority associated with each of said process for determining the order in which the processes are run in the processor; . at least one queue of work requests associated with each of said processes for scheduling the work requests assigned to said process; means for generating a priority coded interrupt signal in response to processor input/output devices and to said processes; means responsive to said priority coded interrupt signal for assigning a work request to a selected queue associated with a process to call up said process to execute one of said predetermined set of instructions; a priority code corresponding to the priority coded interrupt signal being assigned to said work request; means for the highest priority process driver to process the highest priority work request associated with the highest priority queue by invoking one of said predefined set of instructions called by that work request; and means for signaling the completion of the predefined set of instructions for a selected work request, whereby work requests are scheduled asynchronously for processing on an event or time interval basis.
Claim 2
Dependent Claim
255 words
Arrangement for scheduling work requests in a text processing system operating in a real time environment and comprising a processor, a memory and processor input/output devices, said arrangement being characterized in that it comprises : multiple processes stored in said memory connected to said processor, said processes including a process control block and a process driver; a predefined set of instructions stored in said memory for being processed in response to work requests; means for dispatching a priority associated with each of said process for determining the order in which the processes are run in the processor; . at least one queue of work requests associated with each of said processes for scheduling the work requests assigned to said process; means for generating a priority coded interrupt signal in response to processor input/output devices and to said processes; means responsive to said priority coded interrupt signal for assigning a work request to a selected queue associated with a process to call up said process to execute one of said predetermined set of instructions; a priority code corresponding to the priority coded interrupt signal being assigned to said work request; means for the highest priority process driver to process the highest priority work request associated with the highest priority queue by invoking one of said predefined set of instructions called by that work request; and means for signaling the completion of the predefined set of instructions for a selected work request, whereby work requests are scheduled asynchronously for processing on an event or time interval basis.
Claim 3
Dependent Claim
42 words
Arrangement according to claim 1 further comprising : a single queue of work requests assigned to a plurality of processes, whereby the next highest priority work request on said queue is processed by the next available one of said plurality of processes.
Claim 4
Dependent Claim
62 words
Arrangement according to claim 1 or 2, further comprising : means for holding a process from executing a next work request from the queue of work requests associated with said process; and means for releasing a held process to allow it to continue to execute one of said predefined sequence of instructions for the next highest priority work request on its queue.
Claim 5
Dependent Claim
65 words
Arrangement according to claim 1, 2 or 3, further comprising : means for holding a queue to prevent a process associated with that queue from executing the next highest priority work request on that queue; and means for releasing a held queue to allow the process associated with that queue to continue executing its primary program for the next highest work request on that queue.
Claim 6
Dependent Claim
27 words
Arrangement according to anyone of claim 1 to 4, further comprising : means for said process driver to load said predefined set of instructions into said memory.
Claim 7
Dependent Claim
29 words
Arrangement according to anyone of claims 1 to 5 wherein said predefined set of instructions comprises subsets of instructions, each of them being associated with each of said processes.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.