JP3013993B2 - Vector processing method - Google Patents

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a vector processing method, and more particularly to a vector processing method that can efficiently use a buffer storage device located between a main storage device and a vector register.

[Conventional technology]

Conventionally, in this type of vector processing system, a buffer storage device for storing data transmitted and received between a main storage device and a vector register has a fixed storage capacity (here, 256 elements) as shown in FIG. Is divided into blocks of the maximum capacity that can be accessed at one time), the usage status is managed for each block, and one free block is assigned to one buffer reservation request. If there is no free block,
The process of allocating a buffer waited until an empty block was created.

For example, if each block of the buffer is empty and there are five buffer reservation requests in order of i) 128 elements buffer reservation ii) 128 〃 iii) 256 〃 iv) 128 〃 v) 256 ， i)
Block 1 is allocated when request is made, block 2 is allocated when request ii) is made, and block 3 is allocated when request is made iii).
Are allocated, and when request iv) is made, block 4 is allocated, and the buffer is used as shown in FIG. v)
When the request is made, all four blocks are used, so it is necessary to wait until somewhere becomes empty.

[Problems to be solved by the invention]

In the conventional buffer storage device described above, one block is allocated for one buffer reservation request.
When there are a plurality of requests with a small amount of data to be accessed, there are many free places in the buffer storage device, but since the management is performed in units of blocks, there is no free block, so the buffer cannot be secured. There is a problem that processing is stuck.

SUMMARY OF THE INVENTION The present invention is to solve such a problem of the related art, and provides a vector processing method that can efficiently use a buffer storage device.

[Means for solving the problem]

A vector processing method according to the present invention includes a buffer storage device configured by a plurality of blocks each having a plurality of areas, and storing data from the same capacity as the area to the same block as the block. A block management unit that manages a capacity of the data stored in each of the plurality of blocks; and a block in which newly received data is currently stored using the capacity of the data managed by the block management unit. A determination unit that determines whether or not the plurality of areas included in the block to be stored are used, and usage status information indicating whether at least one of the plurality of areas included in the block to be stored is used, The usage status information indicates that none of the plurality of areas included in the block to be stored is used. In the case, the newly received data is stored in the block to be stored, and at least one of the plurality of areas included in the block in which the usage information is stored is used. When the determination result of the determination unit indicates that the newly received data can be stored in the storage target block, the newly received data is stored in the storage target block, and the determination unit If the result of the determination indicates that the newly received data cannot be stored in the storage target block, another block having sufficient free space for storing the newly received data is determined. And area management means for storing the information.

〔Example〕

 Next, the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram showing a circuit configuration according to an embodiment of the present invention. The request control unit sends out a hunt, write, and read request of a buffer in response to a request. The block management unit 2 to be managed, a determination unit that determines whether the number of elements of the vector data of the block management unit 2 matches the number of elements of the vector data transmitted by the buffer hunt request.
3, an area management unit 4 that divides each block of the buffer and manages the divided areas, a vector operation unit 5 including a plurality of vector registers and one or more operation units, and a main storage device and a vector operation unit 5 It consists of a buffer 6 located in between. As shown in FIG. 3, the buffer 6 is divided into four blocks, each of which is divided into two areas, and one area can receive 128 elements.

The request control unit 1 performs the following processing for the buffer 6 in response to the request sent via the signal line 10.

a) Buffer hunt: A buffer acquisition request is sent to the block management unit 2, the determination unit 3, and the area management unit 4 via the signal line 11. Block management unit
2. The determination unit 3 and the area management unit 4 perform the respective processes. When a buffer is obtained, the area management unit 4 sends a buffer acquisition response to the request control unit 1 via the signal line 40.

b) Buffer write: A write address is sent to the buffer 6 via the signal line 60.

c) Buffer read: A read address is sent to the buffer 6 via the signal line 61.

d) Buffer release: The address of the buffer to be released is transmitted to the area management unit 4 via the signal line 12.

The block management unit 2 has a read pointer, and determines the number of elements of the block indicated by the pointer via the signal line 20 to the determination unit 3.
To send to. Also, the number of elements of the vector data of the buffer hunt request sent from the request control unit 1 via the signal line 11 is stored in the management table of the block of the capture instruction sent from the area management unit 4 via the signal line 41. The fetch / read pointer is updated to the block number sent on the signal line 41. Further, the management area of the block specified by the clear instruction sent from the area management unit 4 via the signal line 42 is cleared.

The determination unit 3 performs an equivalence check between the number of elements of the vector data from the block management unit 2 via the signal line 20 and the number of elements of the vector data of the buffer hunt request from the request control unit 1 via the signal line 11. Result 30
To the area management unit 4 via

The area management unit 4 has an area management table for each block of the buffer 6 and a register indicating an area use flag and a pointer to the pointer. When a buffer hunt request is received from the request control unit 1 via the signal line 11, the area management unit 4
First, looking at the area available flag, if this is “0”,
Process: Search for a block in which both areas of the area management tables of blocks 1 to 4 are vacant, and search the area (i0) (i
Sets the in-use flag "1" in the block numbers 1, 2, 3, and 4), and sends the block number and the fetch instruction to the block management unit 2 via the signal line 41. At this time, if the number of elements of the vector data is 128 or less, the area usable flag is set to "1" and the block number is set to the pointer. If the number of elements is greater than 128, set the area to 2
This process is not performed because one is used.

When the buffer hunt request is received and the area available flag is "1", the following processing is performed: When the result sent from the determination unit 3 via the signal line 30 is "1" (equivalent), The busy flag "1" is set in the area (i1) indicated by the pointer, and the area usable flag is set to "0". When the result from the signal line 30 is “0” (mismatch), “processing” is performed.

In this way, if the buffer acquisition is successful, the request control unit 1 is notified of the acquisition success together with the address of the acquired buffer via the signal line 40.

When a buffer release request is received from the request control unit 1 via the signal line 12, the busy flag of the area indicated by the buffer address is set to "0", and the busy flags of both areas of the block having this area are set. Is "0", an instruction to clear the number of elements of this block is issued to the block management unit 2 via the signal line 42.

The vector operation unit 5 fetches vector data sent from the buffer 6 via the signal line 50 into a vector register specified by a program and performs processing.

As described above, the buffer 6 is divided as shown in FIG. 3, and in response to a write request sent from the request control unit 1 via the signal line 60, the address of the designated buffer is placed at the top of the main storage unit. The data sent from the device via the signal line 70 is written into the buffer by the number of elements of the request. In response to the buffer read request sent from the request control unit 1 via the signal line 61, the buffer read request is read from the designated buffer address by the number of elements of the request, and the vector operation unit 5 is read via the signal line 50. To send to.

Next, the state of each management table when the following buffer hunt requests come in order is shown.

i) 128 element buffer hunt ii) 128 element iii) 256 element iv) 128 element v) 256 element buffer hunt FIG. 4 (a) shows a block management table, (b) shows a block pointer, and (c) shows an area management. The table (d) shows the initial state of the area usable flag and the area pointer. In this state, if there is a buffer hunt request of i), since the area usable flag is "0", two blocks in the area management table are searched for empty blocks, and it is found that block 1 is empty. Set the area (10) in use of block 1 in the area management table, and use only one area because the number of elements is "128". Therefore, set the area usable flag to "1" and set the area pointer to the block number in the area pointer. Set “1”. Also, a block number “1” is set for the block pointer, and the number of elements “128” is set for block 1 in the block management table. This is the state shown in FIG.

When the buffer hunt request of the following ii) comes, first, since the area use flag is "1", the result of the equivalence check between the number of elements in the block management table indicated by the block pointer and the number of elements in the request is "1". As a result, the area (11) of the area management table is in use, and the area usable flag is set to "0" because both areas of block 1 are used. This is the state shown in FIG.

When the buffer hunt request of the following iii) comes, the area available flag is "0", so the area management table searches for empty blocks in the two areas and finds that block 2 is empty. Area (20) in use. Since the number of elements is "256" and two areas are used, the area usable flag is left at "0". Further, the block number “2” is set as the block pointer, and the number of elements “256” is set at the block 2 in the block management table. This is the state shown in FIG.

When the buffer hunt request of the next iv) comes, since the area usable flag is "0", two areas in the area management table are searched for empty blocks, and it is found that block 3 is empty. Area (30)
Is being used, and since the number of elements is "128", only one area is used. Therefore, the area usable flag is set to "1".
Set the block number "3" to the area pointer. Also,
The block number “3” is also set in the block pointer, and the number of elements “128” is set in the block 3 in the block management table. This is the state shown in FIG.

When the buffer hunt request of the next v) comes, the area usable flag is “1”, and as a result of the equivalence check between the number of elements of the block management table indicated by the block pointer and the number of elements of the request, “0” (mismatch) In response to this, the area use flag is set to "0", two areas in the area management table are searched for empty blocks, block 4 is found to be empty, and area (40) in the area management table is used. Since the number of elements is "256", two areas are used, so the area usable flag is kept at "0". Also, a block number “4” is set in the block pointer, and a predetermined number “256” is set in the block 4 of the block management table. FIG. 9 shows this state.

FIG. 10 shows the use state of the buffers secured by these five buffer hunt requests.

〔The invention's effect〕

As described above, the present invention divides each block of the buffer storage device composed of a plurality of blocks into a plurality of areas, makes the number of areas to be used variable according to the number of elements of vector data, and By accommodating vector data with the same number of elements,
The buffer storage can be used efficiently with simple control, and the area within the block is properly used depending on the number of vector elements of the vector data stored in each buffer. There is an effect that the buffer can be used by the vector instruction.

[Brief description of the drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention, FIG. 2 is a diagram showing the structure of a conventional buffer, FIG. 3 is a diagram showing the structure of a buffer according to this embodiment, and FIGS. FIG. 10 is a diagram showing a state transition of a management table used in FIG. 10, FIG. 10 is a diagram showing a buffer use state in this embodiment, and FIG. 11 is a diagram showing a conventional buffer use state. Explanation of symbols: 1 ... request control section, 2 ... block management section, 3 ... determination section, 4 ... area management section, 5 ... vector calculation section, 6 ... buffer.

Claims (1)

(57) [Claims] 1. A buffer storage comprising a plurality of blocks each having a plurality of areas, each of said plurality of areas being capable of storing data of the same capacity, and each of said plurality of blocks being capable of storing data of the same capacity. A device, a block management unit having a block pointer indicating a block currently being stored, and managing a capacity of the data stored in each of the plurality of blocks; a number of newly received data elements and the block; A determination unit that determines whether or not the number of elements of a block indicated by the pointer is the same; and an area management table that indicates whether at least one of the plurality of areas included in the block indicated by the block pointer is used And an area available flag indicating the existence of an available area and the block number of the available area If the area use flag indicates that the area is not usable, the area management table registers that all the areas in the area management table are occupied and uses the registered data. When the number of elements is less than the capacity of the block, the area pointer is further stored in the area pointer to indicate that the area usable flag is usable, and the area usable flag is stored in the area pointer. Indicates that it is usable, and if the result indicated by the determination unit is the same value, the fact that it is in use is registered in the area of the area management table indicated by the area pointer and the usable flag can be used. If the result indicated by the determination unit is not the same value, all areas in the area management table are free. Vector processing method characterized by including the area management unit for registering the fact in use click.