JPH0237445A - Assignment processing system for control table - Google Patents

Abstract

PURPOSE:To quickly retrieve an idle control table by generating an overflow control table, which should be deleted after the end of the use, and assigning it to a processing program at the time when the control table pointed by a fundamantal control table is not an idle control table. CONSTITUTION:When a request processing part 13 of a processing program 10 terminates processings of requests approximately in order, a control table 21 pointed by a fundamental control table 22 which is cyclically moved in the control table 21 assigned to the oldest request. Only the pointed control table 21 is retrieved; and when it is not an idle control table, there is a high probability that another control table 21 is used, and therefore, the overflow control table is immediately generated correspondingly. Thus, a pointer to the control table 21 which is an idle control table very probably is provided, and thereby, it is unnecessary to perform retrieval in order from the start of a queue.

Description

[Detailed Description of the Invention] [Summary] Regarding a control table allocation processing method for allocating a free control table to a processing program, the purpose is to search for free control tables at high speed, and the present invention involves queuing according to a predetermined order. In the control table allocation processing method, the first control table and the last By queuing control tables, the control J table is configured to be cyclically queued, and the basic control table that manages these control tables is configured to queue one of the queued control tables. The control table allocation means that is configured to point to the basic control table and executes the allocation process determines whether or not the control table pointed to by the basic control table is a free control table, and if it is a free control table, It processes the control table to be assigned to the processing program, and increments the pointed control table by one according to the queue, while if it is not a free control table, the overflow control table is deleted after it is finished being used. Configure it to generate and assign it to a processing program.

[Industrial Application Field] The present invention relates to a control n-table allocation processing method for allocating free control tables to processing programs.

In a data processing system, a control table, which serves as an area for storing information necessary for executing a process, is allocated to a processing program. This allocation process is
This is achieved by searching for and allocating an unused free control table (hereinafter referred to as 'free control table') from the prepared control tables, which speeds up the processing. In order to achieve this goal, it is necessary to make it possible to search the free space control table at high speed.

(Prior Art) FIG. 6 shows a configuration diagram of a conventional control table allocation processing method. In the figure, 10 is a processing program that requires a free control table, and 20 is a plurality of control tables 21 prepared in advance (in the figure,
A control table pool that pools ``β, ゛′),
Reference numeral 30 is a control table allocating means, such as a subroutine, which allocates a free control table to the processing program 10. In terms of functional structure, this processing program 10 acquires a free space control table by calling a request receiving unit 11 that receives requests from users and a control table allocating means 30. A control table acquisition unit 12 writes information necessary for executing the attached request, a request processing unit 13 processes the requested request according to the information in the acquired control table 21, and releases and controls the completed request. It includes a control table return unit 14 that returns the control table 21 to the table pool 20, and a post-processing unit 15 that performs post-processing of completed requests.

On the other hand, the control table pool 20 is composed of control tables 21 and a basic control table 22 (represented by α in the figure) that manages these control tables 21. As shown in FIG. 2, the queue is started from the control table 21 located at the head (the control table 21 pointed to by the basic control table 22).

The reason why the control table 21 is created and prepared in advance in this way is to avoid overhead spent on creating/deleting the control table 21. In addition, if the number of received requests exceeds the number of control tables 21 prepared in advance (represented by n'' in the figure), - as a temporary control table,
“’Overflow control table°’” which will be deleted at the end of use
configured to create.

In the prior art, the control table allocating means 30 searches for a free control table according to the following processing procedure and executes the processing program 1.
I processed it so that it was divided into 0.

That is, by using the control table 21 located at the head of the queue as a starting point and examining the control tables 21 in order according to the queue, an empty control table that is not in use is found. If a free space control table is found in this process, the free space control table is assigned to the processing program 10, and a flag is set on the free space control table to indicate that it is now in use. If no free control table is found even after checking up to the control table 21 located at the end of the queue, an overflow control table is created and the overflow control table is assigned to the processing program 10.

In this way, in the prior art, the prepared control tables 21 are searched in order according to the queue to obtain the empty control table.

[Problem to be solved by the invention]

However, in the conventional technology, since the queue is searched sequentially from the head, there is a problem that the time required to allocate the free control table is not constant. For example, in the example shown in FIG. 7, the free space control table 21 can be found in one search process in response to the request ■; however, in response to the request ■,
Search processing is performed twice, search processing is performed three times for the request of ■, search processing is performed once for the request of ■, and so on.
It was disjointed. In addition, in the conventional technology, as shown in FIG. 8, it is impossible to detect that there is no free control table unless the control table 21 connected to the queue is searched to the end, so it takes extra time to allocate an overflow control table. There was also the problem that it took a lot of time. This problem becomes more serious as the number of control tables 21 prepared in advance increases.

The present invention has been made in view of such circumstances, and
The object of the present invention is to provide a control table allocation processing method that allows a free control table to be searched at high speed from among queued control tables 21.

[Means to solve the problem]

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

In the figure, as in FIG. 6, IO is a processing program, 20 is a control table pool, and 30 is a control table allocation means. The processing program 10 includes a request reception section 11, a control table acquisition section 12, a request processing section 13, a control table return section 14, and a post-processing section 15, which perform the same functions as those of the prior art. The control tables 21 of the control table Boolean 20 of the present invention are queued according to a predetermined order as in the prior art, and the first and last queued control tables 21 are further queued. Therefore, it is configured to be queued cyclically. The basic control table 22 of the present invention is configured to point to one of the cyclically queued control tables 21.

The control table allocation means 30 of the present invention includes a use flag determination section 31
, a control table allocation section 32 , a pointer walkway section 33 , a use flag setting section 34 , and an overflow control table creation section 35 . This use flag determination unit 31 determines whether the control table 21 pointed to by the basic control table 22 is a free control table by checking the state of the use flag assigned to the control table 21 pointed to by the basic control table 22. determine whether
The control table allocation unit 32 processes to allocate a free control table to the control table acquisition unit 12 of the processing program 10, and the pointer increment unit 33 allocates one control table 21 pointed to by the basic control table 22 according to the queue. The use flag setting unit 34 sets a use flag indicating that the control table 21 allocated by the control table allocation unit 32 is in use, and the overflow control table creation unit 35 determines the use flag. When the unit 31 determines that the table is not a free control table, it generates an overflow control table and passes it to the control table allocation unit 32.

[Effect]

In the present invention, when the use flag determining unit 31 determines that the control table 21 pointed to by the basic control table 22 is a free control table, the control table allocating unit 32 processes this free control table. At the same time, the pointer incrementing unit 33 increments the control table 21 pointed to by the basic control table 22 by one in accordance with the queue. On the other hand, when the usage flag determining unit 31 determines that the control table 21 pointed to by the basic control table 22 is not a free control table, the control table allocating unit 32 uses the overflow control table created by the overflow control table creation unit 35 to The control table is allocated to the control table acquisition unit 12 of the processing program 10.

When the request processing unit 13 of the processing program 10 finishes processing the requested requests in the general order of requests,
The control table 21 pointed to by the basic control table 22 that is to be moved cyclically is the control table 21 assigned to the oldest request. From now on, in the present invention, only the pointed control table 21 is searched, and if this control table 21 is not a free control table, there is a high possibility that other control tables 21 are also in use, so an overflow control table is created immediately. We will respond accordingly.

As described above, according to the present invention, since it has a pointer to the control table 21 that is extremely likely to be a free control table,
There is no need to search sequentially from the beginning of the queue. Then, simply by checking the control table 21 that is pointed to, it is possible to infer whether or not other control tables 21 are in use. Understand the necessity of creating tables. The time allocated to the free space control table is also constant.

〔Example〕

Hereinafter, the present invention will be explained in detail according to examples.

FIG. 2 shows a configuration diagram of an embodiment of a processing program implementing the control table allocation processing method according to the present invention.

In this embodiment, the same components as those explained in FIG. 1 are indicated by the same symbols in the six FIGS. which assume a processing program for controlling input/output of an external storage device.

1 is a user, and request receiving unit 1 of the processing program 10
1, and 2 is an input/output issuing unit, which issues input/output requests from the request processing unit 13 of the processing program 10.

3 is an input/output channel provided between the CPU and an external storage device, and 4 is an external storage device.

An appropriate number of control tables 21 (represented by "'βl") assigned to the processing program 10 to manage requests from the user 1 are prepared in advance. This control table 21 is queued in a predetermined order as in the prior art, and furthermore, the control table 21 located at the rearmost position
(in this example, “β4”) is the control table 2 located at the beginning.
1 (in this example, "'β1"), it is configured to be cyclically queued. Further, in each control table 21, information (for example, a flag) is set to indicate whether or not the control table 21 is in use, as in the prior art.

The basic control table 22 (denoted as “β′) of the control table pool 20 is composed of this control table 21 and the overflow control table 23 (denoted as “β′”).
, denoted by Pa). Here, the overflow control table 23 is a control table that is temporarily created and used when the number of requests from the user l exceeds the number of prepared control tables 21, and after the use is finished. It will be deleted immediately. Specifically, the basic control table 22 contains a pointer to the control table 21 located at the rear (in this example, β4''), and a pointer to the control table 21 located at the beginning (in this example,
a pointer to β1 “°), a pointer to the overflow control table 23 located at the rear (in this example, β/, I+),
Overflow control table 23 located at the beginning (in this example, β′1°
By providing a pointer to (), the queues of the control table 21 and overflow control table 23 are managed. In the present invention, the basic control table 22 is further configured to include a pointer to the control table 21 to be used next. In this example, the control table 21 to be used next is ``β2'',
This pointer is shown below. Note that, at the time of initialization, this pointer points to the control table 21 located at the head of the queue.

Next, the processing contents of the present invention will be explained. When the user 1 requests an input/output request to the processing program 10, the request reception section 11 accepts the requested request and requests the control table acquisition section 12 to allocate a control table 21 that is not in use. Upon receiving this request, the control table acquisition unit 12 executes the procedure described below by calling, for example, Nable-chin, searches for a control table 21 that is not in use from the control table pool 20, and requests the request. It will be processed so as to be assigned to the processing unit 13.

In order to obtain a control table 21 that is not in use, the control table acquisition unit 1
2 first determines whether the control table 21 pointed to by the basic control table 22 is in use. This judgment is
This is executed depending on whether or not the control table 21 is set with information indicating that it is in use. Based on this judgment, basic control table 2
When it is determined that the control table 21 pointed to by No. 2 is not in use, the control table 21 is allocated to the request processing unit 13. The basic control table 22 then processes to point to the next control table 21 in the queue. To explain the case where two control tables 21 are prepared, as shown in FIG. 3, this process changes the control table 21 of β1 from (a) to (b) at the time of initialization. ■ of the first request is assigned and a pointer is set to the control table 21 of β2, and then in (c), ■ of the next request is assigned to the control table 21 of β2, and the control table 21 of β A pointer will be pasted to. Note that the stamps in Figure 3 indicate control tables 21 that are not in use, and the O marks (the numbers in the stamps represent request numbers) indicate the control tables 21 that are in use and the overflow control tables that are in use. 23 is shown. In addition, (a) or (i) or (l) in the figure represents the chronological order.

On the other hand, when determining that the control table 21 pointed to by the basic control table 22 is in use, the control table acquisition unit 12 immediately uses the overflow control table 21 without checking the usage status of other control tables 21. Create this overflow control table 2
3 to the request processing unit 13. At this time, the reason why other control tables 21 are not checked is because the basic control table 22 operates to sequentially point to the control tables 21 queued in the cycle link by the above-mentioned process. This is because the control table 21 that has been assigned is considered to be the control table 21 that was assigned to the oldest request, based on probability. With this process,
As shown in (d) and (e) in FIG. 3, overflow control tables 23 are created for β'1 and β'2, respectively, and
requests will be allocated. At this time, the basic control table 22 continues to point to the previous control table 21 of β without change.

The request processing unit 13 to which the unused control table 21 or overflow control table 23 is assigned writes information necessary for executing the request to the assigned control table, and starts the request processing unit I3.

The request processing unit 13 activated in this way requests input/output operation from the input/output issuing unit 2 according to the information in the assigned control table, and when the requested turnout operation is completed, the input/output issuing unit When the notification of completion is received from 2, the control table return unit 1
4 to request the return of the control table 21 or overflow control table 23 that has been used. Upon receiving this request, the control table return unit 14 releases the previously used control table 21 or overflow control table 23 from the request and returns it to the control table pool 20 according to the procedure described below. I will do it.

In order to return the control table that has finished being used, the control table return unit 14 releases the control table 21 from the request when the control table that has finished being used is the control table 21 that has been prepared in advance.
Cancel the setting of information indicating that it is in use. On the other hand, when the control table that has been used is the overflow control table 23, it is released from the request, and the overflow control table 23 is removed from the queue of the overflow control table 23 and touched. With this process, the third
As shown in (f) in the figure, the control table 21 of β1 is released from the request, as shown in (h), the control table 21 of β2 is released from the request, and as shown in (su), the control table 21 of β2 is released from the request. The overflow control table 23 of No. 1 is deleted, and the overflow control table 23 of β'2 is deleted as shown by (nu). In addition, the following <(g) after (g) is the control table 2 of β, which is released from the request.
This shows that the request (■) will be allocated to the control table 21 for 1, and the control table 21 for β2 will be finally released at (r). When the processing of the requested request is completed, the post-processing unit 15 terminates the processing by notifying the user 1 that the requested processing has been completed.

In the explanation of FIG. 3, control table 2 is prepared for convenience of explanation.
The processing contents have been explained for the case where there are two 1s. In order to further understand the processing contents of the present invention, FIGS. 4 and 5 show an example in which four control tables 21 are prepared.
An example of the processing of the present invention will be shown.

As described above, the present invention processes only the control table 21 that is extremely likely to be an empty control table and determines whether to create the overflow control table 23. However, the present invention is not limited thereto. For example, the number of control tables is merely an example.

〔Effect of the invention〕

As described above, according to the present invention, a control table that is not used with a high probability value can be found with a single search process, and it is also possible to find out a control table that is not used with a high probability value. Be able to recognize. From now on, it will be possible to allocate unused control tables to processing programs extremely quickly.

FIG. 6 is a configuration diagram of the prior art, and FIGS. 7 and 8 are explanatory diagrams explaining problems of the prior art.

In the figure, 10 is a processing program, 11 is a request reception unit, and 12
1 is a control table acquisition unit, 13 is a request processing unit, 14 is a control table return unit, 15 is a post-processing unit, 20 is a control table pool, 21 is a control table, 22 is a basic control table, 23 is an overflow control table, and 30 is a Control table allocating means, 31 is a use flag determining section, 32 is a control table allocating section, 33 is a pointer walkway section, 34 is a use flag setting section, and 35 is an overflow control table creating section.

Claims (1)

[Claims] A plurality of control tables (
21), and at the time of a request from the processing program (10), searches for an unused free control table according to this queue, thereby assigning a free control table to the processing program (10). In the allocation processing method, a prepared control table (21) is cyclically queued by queuing the first queued control table (21) and the last queued control table (21). At the same time, the basic control table (22) that manages these control tables (21) manages one control table (2) of the cyclically queued control tables (21).
1), and the control table (21
), the control table allocation means (30) executes the allocation process for the control table (21) to which the basic control table (22) points.
) is a free control table, and when it is determined that it is a free control table, the control table (21) is processed to be assigned to the processing program (10), and the basic control table (22) is The control table (21) pointed to by the processing program increments the control table (21) by one according to the queue, and when it is determined that the control table is not free, generates an overflow control table that will be deleted after use. (
10) A control table allocation processing method characterized by performing processing to allocate to.