JPS62182950A - Buffer administration system - Google Patents

Abstract

PURPOSE:To attain the execution of a buffer allocation process having plural degrees of priority corresponding to utilizing purposes by providing a buffer administration table, and a buffer vacancy waiting semaphore classified by priority. CONSTITUTION:In a buffer allocation process, when requested N-number of buffers are present already, they are transferred instantly to a requesting original, and the number of vacant buffers in a buffer administration table 3 is counted down by N-number. When the requested N-number of vacant buffers are in use, and it is impossible to allocate them, the minimum number of vacant waiting buffers classified by designated priority (high or low), and the number of buffer vacancy waiting programs (count is increased by one) are stored at the buffer administration table 3, and an operation P is executed for vacancy waiting semaphores 5 and 6 classified by priority.

Description

DETAILED DESCRIPTION OF THE INVENTION (Industrial Application Field) The present invention relates to buffer management in data processing capacity, and particularly to a buffer management method that performs preferential buffer allocation according to the degree of request for buffer acquisition.

(Prior Art) Conventionally, in a buffer management method in this type of data processing system, a buffer management table is provided, and buffer request information is registered in the table and referenced to manage buffer availability and priority allocation. was going on.

(Problems to be Solved by the Invention) In the conventional method described above, the amount of buffer allocation management information increases, the buffer management table becomes large, and the process of registering/referencing buffer request information/information in the buffer management table is difficult. However, the disadvantage is that the buffer management (allocation, release, and free waiting control) program becomes complicated.

Furthermore, if an attempt is made to add allocation management with a new priority, major modifications are required to the buffer pipe table and buffer all-in-one program, and new priorities cannot be easily set.

An object of the present invention is to eliminate the above-mentioned drawbacks by having a buffer management table for managing buffers and semaphores for waiting for free buffers according to priority.
t- It is an object of the present invention to provide a buffer management method configured to be easily performed.

(Means for extinguishing the problem) The buffer management method according to the present invention includes a plurality of buffers,
The system is equipped with a buffer management program execution means, a message processing program execution means, and a buffer free waiting management means, and is configured to arbitrarily allocate buffers with a plurality of priorities tV depending on the purpose of using the buffer. It is.

The plurality of buffers are used as temporary storage areas for messages.

The buffer management program execution means is for executing a buffer management program that specifies allocation and release of a plurality of buffers, as well as empty waiting processing.

The message processing program execution means is for executing a message processing program that defines the calling of the buffer management program and the transfer of messages via the buffer.

The buffer free wait management means includes a buffer management table and buffer free wait semaphores for each buffer allocation priority.

(Actual flow side) Next, the present invention will be explained in detail with reference to the drawings.

FIG. 1 is a block diagram showing an embodiment of a data processing device that can perform friend buffer allocation processing #t- with two levels of priority, high and low. The data processing device shown in FIG. 1 has two priority levels (high and low) via a buffer: a group of message processing programs 11 and 12 for executing data transfer, and message processing programs 11 and 12.
buffer management programs 21 and 22 for allocating and releasing buffers and executing empty waiting processing according to request instructions from the buffer management programs 21 and 2;
2, a buffer management table 3 for storing buffer management information, a plurality of buffers 4 that are repeatedly used by allocation or release, and message processing programs 11 and 12 that send out a buffer acquisition request when there is a shortage of free buffers. It consists of a pair of buffer free wait semaphore 5.6 corresponding to two priorities, high and low, for temporarily waiting.

Figure 2 shows the buffer allocation for buffer all-office program 2.
It is a processing flowchart showing release and waiting for free space.

FIG. 3 shows the format and storage information of the buffer management table 3, and is an explanatory diagram showing detailed processing contents and control information.

The entire operating principle of the buffer allocation management system with two levels of priority, high and low, will be explained below in the order of the buffer management program processing flow shown in FIG.

The buffer management program 2 has a function to allocate N buffers according to the number of buffer requests (N) specified by the message processing program 1 and request priority (two levels of high and low), and a function to allocate N buffers in accordance with the number of buffer requests (N) specified by the message processing program l, and a function to allocate N buffers in accordance with the request priority (high and low levels). The function of waiting for N buffers and the function of returning N buffers are realized.

In the buffer (N) allocation process, if N free buffers are requested and N empty buffers already exist, the buffer is immediately delivered to the request source, and the buffer management table 3 is counted down by the number of buffers iN. Requested 7? - If N free buffers are in use and cannot be allocated, the minimum number of buffers waiting for free for each specified priority (high and low) and the number of programs waiting for free buffers (count 1). (incremented by t) and stored in the buffer management table 3, and P for the thrust wait semaphore 5.
Operationally executed.

Minimum number of buffers above! fi, stores the least acquisition request buffer e1 among the programs waiting for a free buffer, and judges whether there is a program that can be re-operated each time a buffer is returned. This is information for passing the buffer to the program 11 or 12.

The buffer request program 11 or 12 temporarily waits using the P operation until the requested number of buffers are returned. This waiting state is released by the V operation from the buffer release process, and the process again proceeds to the process of allocating the requested number of buffers (N). If there is no free buffer again, the above-described process is repeated in the same way, and the buffer becomes available again.

On the other hand, in the process of returning buffers (N), a link is made to the buffer t''2 which has been requested to be returned, and the count is increased by the number of free buffers tl-N in the buffer management table 3.

Next, referring to buffer thrust waiting information @i for each priority in the buffer management table 3, the following processes are returned for the number of priority levels in descending order of priority.

If there is no program ot or 12 waiting for a free buffer, the process ends as is, but if there is a program 1 waiting for a free buffer, the number of free buffers is compared with the minimum number of buffers waiting for a free buffer, Is the number of free buffers the minimum number of Tsuki Attendant buffers? 'If there is not 14ft, the process ends. If the number of pushing buffers has reached the minimum number of empty waiting buffers, it is determined that there is a routine that can be executed again in the buffer attendant program 11 or 12, and the minimum number of empty waiting buffers in the buffer management table 3, and The number of programs waiting to be stabbed is initialized to the total number of buffers and 0, respectively. Thereafter, the operation is performed on the desired sofa waiting semaphore for each priority as many times as the number of empty waiting programs.

As described above, similar processing is executed only twice in response to the two priorities, high and low. With this V operation, the programs 11 or 12 waiting for buffer free space are restarted in descending order of priority, and the process proceeds to buffer allocation processing again. Here, the higher priority message processing program runs first, and the free buffer is passed to one of the higher priority processing programs.

In this way, a program with a high priority is given a buffer allocation opportunity preferentially compared to a program with a low priority, so it is possible to manage buffer allocation with multiple priorities depending on the purpose of use.

(Effects of the Invention) As explained above, the present invention has a buffer management table for managing buffers and buffer free waiting semaphores for each priority, thereby making it possible for the present invention to create a network that has multiple priorities depending on the purpose of use. The buffer allocation process can now be performed with a small buffer management table, less buffer management information, and an open buffer management program, and new priorities tJ7+, -#+
+1++++? dollW$1@1ffii+/? t'
White→1iJL1.1risklql/F”◆t1 It is effective because it can be done easily.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment of a data processing device that implements a buffer management method according to the present invention. FIG. 2 is a flowchart showing a processing example of the buffer management program shown in FIG. FIG. 3 is an explanatory diagram showing an example of the structure of the buffer management table shown in FIG. 1, the buffer, and the buffer free waiting semaphore for each priority. 11.12, 21.22 - Program 3 Table 4 Sofa 5.6 Semaphore

Claims (1)

[Claims] a plurality of buffers for use as temporary storage areas for messages; allocation and release of the plurality of buffers;
and a buffer management program execution means for executing a buffer management program that specifies free waiting processing, and a message processing program that specifies calling of the buffer management program and transfer of the message via the buffer. It comprises a message processing program execution means, and a buffer free wait management means including a buffer management table and a buffer free wait semaphore for each buffer allocation priority, and allocates a buffer having a plurality of priorities according to the purpose of use of the buffer. A buffer management method characterized in that it is configured so that it can be executed arbitrarily.