JPH02188858A - Job selecting process system - Google Patents

Abstract

PURPOSE:To enable plural users to execute each job with the even waiting time by providing a job selecting process part to select the input jobs with limitation of the limit value given from an input job queue and to connect the selected job to an execution waiting queue. CONSTITUTION:A job selecting process part 12 shifts a job having the relevant user identification name on an input job queue 11 to an execution waiting queue 13 as long as the number of jobs does not exceed the limit value 15 on the queue 13 containing the same user identification name. A job start process part 14 takes out successively the jobs connected to the queue 13 and executes them. Thus it is possible to start the jobs to be inputted later before the end of many preceding jobs even in the case a single user inputs continuously many jobs as long as the value 15 is properly set at a small value.

Description

[Detailed Description of the Invention] [Summary] Regarding the management of the execution order of jobs input from multiple users on a computer shared by those users, the present invention allows jobs to be sent to multiple users with equal waiting time. In a computer that sequentially executes jobs that are input with a predetermined user identification name, a first queue and a queue that connect the jobs are used. the second queue and the input job to the first queue;
means for connecting to the queue of the user, and the number of the jobs on the second queue having the same user ID does not exceed a predetermined limit, means for moving the job having the job to a second queue;
The configuration is such that the jobs connected to the second queue are sequentially retrieved and executed.

[Industrial application field]

The present invention provides a computer that is shared by multiple users.
The present invention relates to a job selection processing method for managing the execution order of jobs input by users.

[Prior art and problems to be solved by the invention] FIG. 3 shows an example of the configuration of a computer system, in which a processing unit 41 stores in its main memory a program retrieved from an external storage device 42 and executed to manage and utilize the system. It is configured to perform the processing specified by the user.

When a user performs processing using this system, the user inputs job definition information from the input device 43, such as a card reader, and requests the required processing.

Job definition information consists of control information that specifies the program and data to be executed and other execution conditions, as well as necessary programs and data.In addition, in the case of a computer that is shared by multiple users, it also includes the output of processing results and other information. For billing purposes, etc., each user is given a predetermined user identification name.

A job management mechanism executed by the processing unit f41 of the computer receives this job definition information (hereinafter simply referred to as job), stores it in the external storage device 42, and then retrieves it into the main memory in a predetermined order and stores it. Start execution of this job according to the definition information.

FIG. 4 is a block diagram showing an example of the configuration of a job management mechanism executed by the processing device 41, and the job input processing section 1 includes:
After reading the job input by the user and performing a format check and other predetermined processing, the job is stored in the external storage device 42, and a control block consisting of a pointer indicating the job storage location and other information is stored in the main memory. The queue elements of the execution queue 2 are connected, for example, in the order of arrival so as to form a queue of jobs that are input sequentially.

The job start processing unit 3 sequentially removes queue elements from the execution queue 2 from the top and starts the process specified in the definition information of the job specified by the queue element. In this case, the number of jobs that can be processed in parallel at the same time, that is, the job multiplicity, is limited in advance by the computer, and after starting up to that number of jobs, the job start processing unit 3 detects this, takes the next queue element from the pending queue 2, and begins execution of the indicated job as described above.

Now, as illustrated in the execution queue 2 in Figure 4,
When a certain user's entry form box (identified by the user identification name attached to the definition information) indicated by ○ is entered in large numbers in a row as shown in the figure, the following entries will be distinguished and indicated. A job entered by a user does not start until the previous user's job has been processed, which unduly delays the wait time for the subsequent user's job to complete.

The object of the present invention is to provide a job selection processing method that manages the execution order so that jobs are executed with equal waiting time for a plurality of users.

[Means to solve the problem]

FIG. 1 is a block diagram showing the configuration of the present invention.

The figure shows the configuration of the job selection processing method of the computer, where 10 is a job input processing unit that receives job input and connects it to the input queue 11, and 12 is a job input processing unit that receives input jobs from the input job queue under the limit of 15. A job selection processing section 14 selects a job and connects it to the execution queue 13, and a job start processing section 14 takes out a job from the execution queue 13 and executes it.

[For production]

An input job queue 11, which is a first queue for connecting jobs, and an execution queue 13, which is a second queue, are connected to a computer that sequentially executes jobs that are input with a predetermined user identification name. The job input processing unit 10 connects the input job to the input job queue 11.

The job selection processing unit 12 limits the number of jobs on the execution queue 13 having the same user identification name to a limit 4a15.
Jobs with the user identification name in question on the input job queue 11 are moved to the execution queue 13 unless the number exceeds .

The job start processing unit 14 sequentially takes out the jobs connected to the execution queue 13 in this way and executes them.

By using the above processing method and setting the limit value to an appropriately small value, even if the user inputs many jobs in succession, other jobs input later will be It will start without waiting for many jobs to finish.

〔Example〕

In FIG. 1, a job input processing unit 10 reads and processes an input job created by a user, similar to the conventional job input processing unit 1, but once the input job is connected to an input job queue 11, The job selection processing unit 12 is notified. The configuration of the input job queue 11 is similar to that of the conventional execution queue 2, but each queue element is set with the user identification name of the job.

The job selection processing unit 12 retains the limit (i15) set as system initialization information, and when the job input processing unit 10 adds a job to the input job queue 11 and receives notification from the startup unit 30, the job selection processing unit 12 The counting unit 31 counts the number of jobs with the same user identification name as the added job in the execution queue 13, and if the count value is less than the limit value 15, the switching unit 32 selects the queue element of the added job. Move from the input job queue 11 to the end of the execution queue 13.

Also, when the job start processing unit 14 retrieves a job from the execution queue 13, the startup unit 33 receives a notification and searches the input job queue 11 for a queue element with the same user identification name as the retrieved job. If the element exists, one element is moved to the end of the execution queue 13.

The input jobs connected to the execution queue 13 are sequentially retrieved from the beginning by the job start processing unit 14, and similarly to the conventional job start processing unit 3, the job processing is started, and the user of the retrieved job The job selection unit 12 is notified of the identification name.

FIG. 2 shows an example of the processing flow of the job selection processing section 12. When a notification is received from the job input processing section 10, the activation section 30, job counting section 31, and switching section 32 When the user identification name of the input job added in processing step 20 is received, the execution queue 13 is scanned in processing step 21, the number of queue elements of jobs with the same user identification name is counted, and processing step 21 is performed. 2
In step 2, the count value is compared with the limit value 15, and if it reaches the limit value, the process ends, but if it is less than the limit value, in process step 23, the queue element of the job is transferred from the input job queue 11 to the queue waiting for execution. Move to step 13 and end the process.

Further, when a notification is received from the job start processing section 14, the starting section 33 and the switching section 34 receive and receive the user identification name of the job that has been executed in step 24 of FIG. 2(b). Then, in processing step 25, the input job queue 11 is scanned from the beginning, and if there is no queue element with the same user identification name set, the processing ends, but if there is a queue element with the same user identification name, processing step 26
Then, the job is moved from the input queue 11 to the execution queue 13, and the process ends.

For example, the limit value may be the same value as the job multiplicity, or
If it is set to a smaller value, for example 1, the above process will cause one job to be placed in the execution queue 13 for every different user identification name of the jobs connected to the input job queue 11. When a job is connected and a job starts executing, if there is a job with the same user identification name, it is added from the input job queue 11 to the execution queue 13, so that each user receives services equally. Become.

〔Effect of the invention〕

As is clear from the above description, according to the present invention, in a computer shared by multiple users, the execution order is managed so that jobs can be executed with equal waiting time for multiple users, and the system service It has a significant industrial effect of improving properties.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of the present invention, FIG. 2 is a flowchart of the processing of the present invention, FIG. 3 is a block diagram of a configuration example of a computer system, and FIG. 4 is a block diagram showing a conventional configuration example. . In the figure, 1.10 is a job selection processing unit, 2.13 is an execution queue, 3.14 is a job selection processing unit, 11 is an input queue, 12 is a job selection processing unit, 15 is a limit value, and 20 to 26 are Processing step, 30. 33 is a starting section, 31 is a job counting section, 32. 34 is a switching section, 41 is a processing device, 42 is an external storage device, 43 is an input device. A block diagram showing an example of a conventional configuration.

Claims (1)

[Claims] In a computer that sequentially executes jobs input with predetermined user identification names, a first queue (11) and a second queue (13) connecting the jobs; means (10) for connecting said inputted job to a first queue (11); and a means (10) for connecting said inputted job to a first queue (11); means (12) for moving the job having the user identification name on the first queue (11) to the second queue as long as the value (15) is not exceeded; A job selection processing method characterized by being configured to sequentially extract and execute the jobs connected to (14).