JPS5878238A - Queue controlling system - Google Patents

Abstract

PURPOSE:To minimize the capacity of a required control table to facilitate the instruction processing for the operation of a queue, by separating pointers required for the queue from general tables to form an independent control table by allowing said control table to respond to the general table when necessary. CONSTITUTION:Task management tables 400, 420... arranged in order of task number are provided in an area of a main memory 300, and a pointer 400 having the start address of the table 400, queue headers 450 for execution queue, and queue headers 460 for shared resource occupation queue are formed. Control tables due to idle management queue headers 480 or the like are provided in accordance with separate queue blockd 490, 495.... A processing device 370 is provided as the shared resource for the memory 300. When the processing is terminated after start addresses of tables 400, 420... are set onto control tables due to headers 480 or the like and are registered to the queue, setting of control tables is canceled, and they are disengaged from the queue.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a queue control method, and more particularly, to a queue control method that minimizes the data area required to form a queue,
The present invention relates to a control method that can prevent an increase in the capacity of main memory.

Computer systems include various shared resources, such as central processing units (APTRs), channels,
Memory, lines, etc. exist. As a result of the introduction of multiple programming to improve the efficiency of computer system usage, a large number of processes coexist within the system, and due to the limited number of shared resources that can be used, wait times due to competition for these resources are reduced. There is a queue.

A computer system's memory, on the other hand, is used to manage shared resources, schedule jobs and flow of control,
management of the combination of four-grams, commands, zip control language, etc., receiving job processing instructions from the user, outputting the output, etc., from the user's program ν-gram. An operating system with functions related to file access and the like used in subroutines is stored.

By the way, when forming a queue, conventionally all control tables that may be registered in the queue are provided with pointers and rears necessary for forming the queue. However, all of these two cabinet tables are not queued at the same time, and when they are queued, the number of management tables is small, so much control table pointer area is wasted. It has become.

Moreover, as the number of 1!1IlIl tables increases, the useless pointer area increases, so the memory capacity occupied by the entire operating system (hereinafter referred to as 08) becomes enormous, and the user area There is a problem of being under pressure.

/Representatives of queues that occur in computer systems are execution queues for user programs (hereinafter referred to as tasks) and queues for shared resource occupancy among tasks.

The first is the OS required to form a traditional queue.
FIG. 2 is an explanatory diagram of a control table of FIG.

O8 has tables 100, 120, . ...130, arrange them in order of task number, and point all the destination addresses 140
Managed by. In addition, O8 includes queue headers 150 and 155 for execution queues corresponding to the priority level of one task and queue headers 160 and 170t1 for shared resource occupation queues corresponding to various shared resources in order to manage the execution queues. Provide each.

The various queues listed above, the task management table 100, 110゜120.13 in the queue header for the corresponding queue.
041-Managed by connecting,
Therefore, each task management table 100, 110, 120
．． 130 has the status of the task! ! Information for managing J 11
In addition to 0, forward pointers 102 and backward pointers 104 are provided for execution queues, and forward pointers 106 and backward pointers 108 are provided for shared resource occupancy queues.

The need to provide both forward and backward pointers makes the control of 11 faster when removing a part of the address that is linked in a ring, or when tasks that occur sequentially are linked to the top of the queue. This is to do so.

Also, each queue header 150.155.160.170
Also provided are forward tI pointers 152 and 162 and backward pointers 154 and 164, respectively. The sizes of these forward pointers and backward pointers are the same.

Figure 2 c &) 伽) are respectively conventional queue management letters s.
It is an explanatory diagram showing t-.

When there is a task for which an execution request has been issued, the O8 sends the execution queue queue header 1 corresponding to the priority level of that task.
A management table for the task is inserted at the end of the execution queue managed by 50, and the task is made to wait for its turn to be executed.

Now, as shown in FIG. 2(,), the task management table 100.
is continued, and when inserting the task management table 130 next to the table 1200, 08 inserts the table 13 into the forward pointer 122 of the task management table 120.
0, set the start address Yr of the execution queue queue header 150 in the forward pointer 132 of the table 130, set the start address of the table 120 in the backward pointer 134 of the table 130, and Backward pointer 15 of header 150
By setting the forwarding address of the table 130 to 4, the task management table 130 is set to the queue header 150
Register it in the execution queue managed by . When the turn for execution comes and the processing is completed, the management table for that task is
It is removed from the execution queue by O8.

On the other hand, if there is a task that is waiting for exclusive use of a shared resource during execution, 08 inserts the entire management table of that task at the end of the shared resource exclusive queue managed by the exclusive waiting queue header 160 corresponding to that shared resource. However, the execution of the task is interrupted at t'''C when the shared resource is released from the waiting state.

In this case, as shown in FIG.
, 190 is connected, I! In this case, the task management table 190 is not removed from the execution queue and newly connected to the middle knee header 160 for the shared resource occupancy queue; 11. connected to the execution queue. Yet another method of persisting in the shared resource occupation queue KIe1 is used. That is, the task management table 190
If the shared resource corresponding to queue header 160 is waiting for occupancy while executing the task corresponding to [K, -
? Assuming that no table is connected to the knee header 160, O8 stores table 1 in the forward pointer 162 and backward mainter 164 of the queue header 160.
90, and set the start address tV of the ladder 160 to the queue to the forward pointer 196 and backward pointer 198 of the table 190, thereby setting the table 190 to the shared resource exclusive queue managed by the queue header 160. register. Then, when the shared rinse exclusive waiting state is released, the management table 1 of that task is
90 is removed from the occupancy queue by O8.

In this way, conventionally, the forward pointer 102 for forming a queue for the task management tape N100,
106, backward pointers 164 and 108 must be provided, and 16 bytes are used as pointers for each case of the management table.

For example, if there are 11,256 registered tasks, the total memory capacity required for the management table pointer is 409
6 bytes (-16x256), and 324J by estimating the number of tasks that will be connected to the execution queue at the same time.
If it is iA, the pointer area that is effectively used at that time is only 512 bytes (-16×32), and the other 5584 bytes are wasted.

An object of the present invention is to eliminate such conventional drawbacks by reducing the capacity of the control table required to form a queue to a minimum of 1K, thereby eliminating wasted area.
Moreover, it is an object of the present invention to provide a queue control system that allows the user to operate the queue using the same ink 7 ace as the conventional one.

In order to achieve the above object, the queue control method of the present invention separates the pointers necessary for forming the queue from the first control table and consists of only the pointers that manage the entire state of tasks. After configuring the second control table, setting the start address of the first control table on the 20th control table, and registering it in the queue, when the processing is completed, The feature is to cancel the settings and disconnect from the above queue.

Hereinafter, the implementation of the present invention will be explained by wA-.

FIG. 3 is a schematic block diagram of a queuing control system illustrating an embodiment of the present invention.

In the oat storage area on the main memory 300, task management tapes 4400, 420, etc. are arranged in the order of task numbers, a pointer 440 with the start address of the table 400, and a queue header 450 for the task execution queue.
．． Queue header 460 for various shared resource occupancy queues
In addition to the matrix pointer table (hereinafter referred to as a queue block) 490.4 newly created according to the present invention,
95 and a queue header 480 that manages their free space.
Rumored control tables are provided. In addition, programs 310.3151 are also stored.

The processing device 370, which is a shared resource, includes an arithmetic circuit 54.
0. Control circuit 3δ0. Control memory 360 and memory
Address register 330. An interface circuit is provided for all the memory data registers 335, etc., and its operation is the same as in the prior art. That is, the address program of the next command to be executed according to the command from the control circuit 350;
40 to the memory address register 330 and an access request is issued to the main memory 300, the next instruction to be executed is read from the main memory 300 and is stored in the memory data register 336. Set. The command set in the memory data register 335 is immediately sent to the control circuit 350, where it is decoded and the microprogram 7 that executes all the instructions among the microprograms stored in the control memory 360 is sent.
00°900.1100. IIJo, 1400.145
Control is passed to 0. The control circuit 350 sequentially reads out and decodes the microprogram from the control memory 360, and based on it reads the microprogram from the control memory 360 and executes the arithmetic operation 340 and the memory ink 7.
Controls the ace and memory control circuit δ20.

The queue operation instructions newly created by the present invention are microprogram Too, 900, 1100.1150°14
It is 00.1450.

FIG. 4 is a structural diagram of a control table showing an embodiment of the present invention.

Task management tables 400, 420. , . . 430 are arranged in the order of task numbers as in the past, and their start addresses are managed by the pointer 440. The configuration of one case of the task management table is the conventional task. The remaining task status information area 404 is removed from the queue management table (16 bytes) and the cube chic 490, 495 is used when connecting to the queue.
. . . is provided with a pointer 402 (4 bytes)) for associating.

The queue blocks 490 and 495 are tables containing pointer information necessary when forming a queue, and the configuration in one case is a forward pointer 492 for lhl key = (execution queue), a backward pointer 494, and a second queue block. (
forward pointer 496 for shared resource occupancy queue)
．． Consists of backward pointer 498 and associated table pointer 499, totaling 20 pies) (4
Baishi x 5). These cube blocks 490.
495 is managed as an empty cubic list in the initial state, that is, when not in use, and a free management queue header 480 is newly provided for this management. The free management queue header 480 includes a forward pointer 482 and a backward pointer 48 for connecting free Kubricks.
have a cow Queue header for execution queue 60.455
is a ladder to the execution queue corresponding to the rut destination level of the task that has a bidirectional pointer as in the past, and is a queue for the shared resource exclusive queue, - header 460, 47
0 is also a dedicated queue queue header corresponding to each shared resource that has a bidirectional pointer as in the past.

FIG. 5(,)(b) is an explanatory diagram of a queue forming method showing an embodiment of the present invention.

In FIG. 5(a), a case will be described in which the tasks shown in the task management table 550 are connected to an execution queue managed by the execution queue queue header 4δ0.

When an execution request is issued to the task indicated by the task management table 6δ0, O8 executes one from the top of the free cube V vine matrix managed by the free management queue header 480.
Remove the cube chic 500, set the start address of the +knee block 500 in the pointer 552 of the task management table δδ0, and
By setting all the start addresses of the table 6δ0 in the table pointer 509, the table 5δ0 is associated with the block 500.

Furthermore, 1.O8 performs an operation of inserting the queue block 500 into the execution queue in the same manner as before. That is, the forward pointer 502 of the queue block 600
holds the start address of the queue block 510 next in line, and information is set so that the pointer 504 for him holds all the start addresses of the execution queue queue headers 450 lined up at its mouth σ. Note that when another queue block is connected next to the execution queue queue header 4-50, the head address of the cube chic that is lined up in front is held.

Next, in Figure 5), the task management table δ9
Assume that a shared resource occupancy queue corresponding to the shared resource occupancy queue queue header 460 occurs while the task represented by 0 is being executed.

In this case, all operations for inserting into the exclusive queue managed by one queue header 460 are performed in the queue block 540 corresponding to the table 590, but the queue header 460
The pointer value of the queue block 540 is the start address of the queue header 460 or the queue block 54
00 The address of the forward pointer 546 for the second queue is 7. That is, O8 sets the address of the forward pointer 546 of the cube chic δ4o in the forward pointer 46 of the queue header 460, and sets the forward pointer 546 . The starting address of the queue header 4600 is set in the backward pointer 548.

FIG. 6 is an explanatory diagram of a queue manipulation instruction showing an embodiment of the present invention. In FIG. 6, the uppercase letter ' (letter) indicates the mnemonic of each instruction, and the child letter (letter) indicates the operand. . to)
qhd is the start address of the queue header, topbj
is the start address of the table, r・g is the register number, and ・ad4r is the jump destination address in case of an error.
Each is shown below.

(a) The G T I Q T command removes one queue block (QIm) from the head of the free queue block list managed by the free management knee header (I Q B H) indicated by topqhd, and It performs the function of associating the task management table (TOB) shown in FIG. At this time, if there is no free queue block (QB) S in the free management queue header (gq, na) indicated by topqhd, e
Jump to the address indicated by id4r.

%) ffRBQ'j' command is used to store the queue buffer (QB) associated with the task management table (TOB) indicated by toptbj and its task management table (TOB).
! 1), and its cube chic (Q
B)) It serves the function of inserting it at the head of the free cubesic list managed by the free management queue header (QBM) indicated by topqhd.

(Q) The engineering NQL instruction is in the queue indicated by topqbl.
At the end of the queue managed by the header (IQBH), there is a task management table indicated by toptbj (actually a cube lock (QB) corresponding to this task management tape, 1%/(TCB))'? It performs the function of inserting the queue so that it becomes the first queue.

(a) The engineering NQLS command writes a table (actually, a queue block ( QB))
The function is to insert the queue so that it becomes the second queue.

(e) The RM V Q T command has the function of removing the table indicated by toptbj (actually, the queue block (QB) corresponding to this table ('!' OB)) from the first queue.

(f) The RMTQS command uses the table indicated by toptbj (actually, the queue block corresponding to this table)
The function is to remove the second cue from the second cue.

Figure 7 shows step 7 of the processing procedure of the GTFQT command shown in Figure 6.
0-chart and FIG. 8 are the same (explanatory diagram of data manipulation of GTFQ and T commands).

In block 705, as shown in FIG. 8(a),
The contents of the forward pointer 482 of the free management queue header 480 indicated by pqhd 602 are retrieved.

Next, in block 710, the contents of forward pointer 482 and jopqhd 602 (ie, the start address of management queue header 480) are compared to check whether there is any free queue block.

That is, if the forward pointer 482 points to the entire queue header itself, this means that nothing is connected, so the contents of the pointer 482 are checked. Ratio! If the results are equal, there are no free queue blocks, so the process proceeds to block 735 and is left to the user's processing. In other words, e
When branching to addr, the program counter V is set to eaddr.・：By re, ・a
Move to the order at address 6dr.

If there is an empty queue block, in block 715, the contents of the forward pointer 4x2 (ie, the start address of the empty queue block) are set in the register 800 indicated by re(606 (dotted arrow in FIG. 8)).

Next, the brick 720 removes the first cube block 810 from the empty queue block list from the empty queue block list by performing the following operation.

That is, the forward pointer 81 of the queue block 810
2 to the forward pointer 482 of the free management queue header 480? cube jitter 820 as indicated by the contents of the backward pointer 8140 of the cube block 810 and the contents of the inner tube forward pointer 812 (dotted arrow in FIG. 8).
backward pointer 824 (or management queue head +
80 backward pointer 484) (dotted line arrow in FIG. 8).Next, in block 725, the following operation is performed to associate the cube-vine 81.0 with the table 830 indicated by toptb1604. (See Figure 8). That is, the table pointer 81 of the queue block 810
toptbz604 (i.e. table 830
Yt stage setting, the start address of the queue block 810 set in the register 800 in block 715 is set in the pointer 832 of the table 830 (dotted line arrow in FIG. 8). When the processing of block 725 is completed, this instruction is completed, and the process moves on to execution of the instruction at the next address (730).

FIG. 8 (By moving from the state of Xun to the state of
This corresponds to the table 830 indicated by tb/.

Is Figure 9 the same as Figure 6? R11Q? 10 is a flowchart showing the instruction processing procedure, and FIG. 10 is also a data operation diagram thereof.

In block 906, the contents of the table 103040 pointer 1032 indicated by toptb 1614 (il! address of the queue pull holder 10100 corresponding to that table) are retrieved. Next, in block 910, the queue block 1010 is set to topqha6 by the following operation.
12 and is inserted at the beginning of the free queue block list managed by the queue header 480. That is, the contents of forward pointer 482 of queue header +80 are set to forward pointer 1012 of queue plotter 1010, topqha 612 is set to backward pointer 1014 of queue plotter 1010, and the contents of queue header 4
The contents of the pointer 10320 of the table 1030 are set in the backward color pointer 1024 of the cube seal 1020 (or the backward l pointer 484 of the queue header 480) indicated by the contents of the forward pointer 482 of 80.

Next, in blocks 415 and 920, the association between table 1030 and queue block 1010 is completely canceled by the following operations. That is, pointer 1032 of table 1030 and pointer 1019 of queue block
Allse1=f1000 is set for each. When block 920 ends, this instruction ends, so the instruction at the next address is executed (925).

FIG. 11(A) is a 7U-chart showing the processing procedure of the NQLT command in FIG. 6, and 12W1 is a data operation diagram thereof.

In block 1105, the inner bounds of pointer 1232 of table 1230 indicated by toptb 1624 are retrieved. Next, in block 1110, the contents of the backward pointer 464 of the task execution queue queue header 450 indicated by toH, ha 622 are retrieved.

Next, in block 1116, the cube jitter 1210t indicated by pointer 1232 of table 1230 is inserted at the end of the queue as the first queue of the queue managed by queue header 450 by the following operation. That is, the tliJ pointer 1202 of the cube jitter 1200 indicated by the contents of the backward pointer 454 of the queue header 450 (or the forward linter 462 of the queue queue header 4-50) and the backward pointer 4 of the queue header 460 are set. do. By ending the block 1115', the present instruction 'ft is ended and execution of the next instruction begins (1120).

FIG. 11(B) is a free chart showing the processing procedure of the NQLB command in FIG. 6, and FIG. 13 is the same data manipulation procedure.

The differences between the engineering NQLT command and this command (engineering yQLs) are as follows:
While the former targets the entire first queue, the latter targets the second queue. In other words, Fig. 11 (
Blocks 1155 and 1160 of B) are shown in FIG. 11(A).
Since the contents are the same as blocks 1105 and 1110,
O The plotter 1165 will explain the difference in the block 1165.
Queue block 13 indicated by pointer 1332 of 30
The queue managed by the 101 shared resource occupancy queue queue header 460 is inserted at the end of the queue as a second queue. That is, the queue block 13000 forward pointer 1306 indicated by the contents of the backward pointer 464 of the queue queue header 400 (or the forward pointer 462 of the queue queue header 460
) to the forward pointer 1 of the queue block 151O.
316, sets the contents of backward pointer 464 of queue queue header 460 to backward pointer 1318 of queue block 1310, and sets the contents of linter 1332 of table 1330 plus 8 (bytes) 1340 (i.e. , the address of the forward linter 1316 of the cube block 1310) is set in the forward pointer 1306 of the k-cube block 1300 (the forward pointer L62 of the forward queue queue header 460) and the backward mainter 464 of the queue queue header 460.

Figure 14) is a flowchart showing the processing procedure of the RMVQ〒 command in Figure 6. 15g is the same data operation diagram.

In block 1405, the contents of pointer 1542 of table 1540 indicated by toptb/642 are retrieved.Next, in block 1410, the queue block 151O indicated by the contents of linter 1542 of table 1540 is connected by the following sweep. Remove it from the first queue. The contents of the forward pointer 1512 of the queue block 151O are transferred to the forward pointer 15 of the queue block 15000 indicated by the contents of the backward pointer 1514.
02 (or the forward pointer 462 of the execution queue queue header 450) and
00 backward pointer 1514 contents to forward pointer 1
Backward pointer 1δ24 of queue block 1520 (or queue queue header 4
50 backward pointer winter 54).

When the processing of block 1410 is completed, this instruction ends and the execution moves on to the next instruction (1415).

FIG. 14) is a seven-shot chart showing the processing procedure of the RM'1rQB instruction in the 611JK, and FIG. 16 is a data operation diagram thereof.

The difference between the ILMVQ and TE commands mentioned earlier and this command is that the former is for the first queue, while the latter is for the second queue.

Therefore, the pupil ivy 1465 in Fig. 14
Since it is the same as block 1406 in the figure ((translation)) and only block 1460 is different, only the different operations will be described.

to) The contents of the forward pointer 1616 of the cube jitter 161O indicated by the contents of the pointer 16420 of the table 1640 indicated by t'bj 652 are transferred to the cube block 160 indicated by the contents of the backward pointer 1618.
00 forward pointer 1606 (or forward own pointer 46 of shared resource occupancy queue queue header 460
2), set the backward pointer 16180 contents of the cue block 1610 to the backward pointer 16 of the cue block 16200 whose forward self is indicated by the contents of the ink 1616.
28 (or pointer 464 of queue header 460) K is set.

The operations of each instruction shown in Figure 6 have been explained above, but as is clear from these explanations, the queue pointer is separated from the task management table (TOB) and becomes an independent queue block (QB). and prepare only the minimum number of cases in the queue block (QB)'ft, and create a table (T
Since we have a table structure that forms the entire queue of OB),
It is possible to limit the wasteful memory capacity of the pointer area. For example, assuming that there are 256 tasks IIHk'Th, the number of queue block (QB) cases (the number of tasks that can be executed simultaneously) 't64, and 32 concurrently executing tasks for all prefectures, the management table (T The total capacity of the pointer and queue block of OB) is 2304 bytes (-4 bytes x δX64 + 4 bytes x 256),
Of these, the area that is effectively used is 768 (-4 bytes x 5 x 32 + winter bytes x 32). That is,
Previously, the queue W salt required 4096 bytes (-4 pies x 4 x 256), whereas 230'
Bytes can be reduced, and the utilization of those areas can be completely improved.

Next, GTFQ'E', FRICqT, I shown in FIG.
Since all commands such as NQLτ, INQLS, RMVQT, and RMVQS are used, the user can read all the starting addresses of the task management table (TOB) without being aware of the structure of queue blocks or the connections between queue blocks. Task queue control can be performed simply by being aware of it, and the correspondence between the task management table (TCB) and queue block (QB) is realized by microprograms, so the associated overhead can be ignored. It can be reduced as much as possible.

As explained above, according to the present invention, the pointers necessary for the queue are separated from the general table and all independent control tables are formed, and the number of cases of the control table is prepared to the minimum necessary. Since the table structure is such that the queue pointer is associated with a general table and the entire queue is created, the capacity of the control table due to the queue pointer can be increased and the amount of wasted area can be completely reduced. Furthermore, the user can operate the queue using the same interface as before by simply issuing the queue operation command according to the present invention without being aware of the table structure as described above.
However, the overhead associated with the association with the general table can be minimized to a negligible level.

[Brief explanation of the drawing]

Figure 1 is a structural diagram of a control table related to conventional queues, Figure 2 is an explanatory diagram showing the conventional queue management state, and Figure 3 is an explanatory diagram showing the conventional queue management state.
Fig. 4 is a schematic diagram of a queue control system showing an embodiment of the present invention, Fig. 4 is a structural diagram of a control table showing an embodiment of the invention, and Fig. 5 is a queue formation showing an embodiment of the invention. FIG. 6 is an explanatory diagram of the method, and FIG. 6 is an explanatory diagram of the queue operation command shown in the embodiment of the present invention. FIG. 7, FIG. 9, FIG. 11, and FIG. Flowchart of processing procedure) %ta Figure 8, Figure 10, Figure 12,
Figure 13, Figure 1, and Figure 16 are all layout diagrams of data manipulation accompanying the control command shown in Figure 6. 400.420,430,550,560,570. ．．
580°590.830.1030.1220.123
0.1320°1330.1530,1540.155
0.1630.1640°1650: Task management table (TCB), 14ol+O: Start address pointer, 160.155°4fi0.455: Queue header for execution queue, 160.170,460,470
? Queue header for shared resource occupancy queue, 48
o: Free management queue header, 490,495.509.
510.520.530゜540.810.820.1
010,1020.1200゜1210.1300.1
310.1500.1510.1520°FfOO+
1610.1620: +:x, -pock, 370
: Processing unit, 300: Main memory, 33o: Memory address ◆ register, 3358 memory data register,
340: If calculation a path, 35o: Control circuit, 360: Control memory, 700 h900, 1100°11δ0, 14
00,1450 j Mytal program for queue operation. Patent Applicant: Hitachi, Ltd. Figure 1 Figure 2 Figure 4 (a) Figure 5 [ Figure 6 Figure 8 Figure 9 Figure 10 Figure 12 622624- Figure 13 632 Mr. A r Figure 14 (A) ■) Figure 15 540

Claims (1)

[Claims] (1) In a computer system consisting of a main memory, a central processing unit, and peripheral devices, the pointers required for queues for tasks or shared resources are separated from the @1 control table containing information for managing the state of tasks. Then, construct a second control table consisting only of the pointers, set the top address of the first control table on the second control, and execute the queue Kg, recorded data, and processing. When the process is completed, the settings on the second control table are canceled and the queue is separated from the queue. (2) The queue control method according to claim 1, wherein registration, updating, or deletion of the queue is performed using only a command that specifies the first control table.