JPH11282745A - Queue management system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To instantly respond to the request/return of a queue address without accessing to a memory and further to simultaneously respond to the request and return of the queue address by providing a buffer. SOLUTION: A memory is read with a current pointer 5 as a read address. An address value that points the next memory area among read addresses 12 that are read is fetched to the next pointer 6, after that, the pointer 6 is transferred as a new current painter 5 and at the same time, an old current pointer is transferred to a buffer 1'. Similarly, an address is transferred to a buffer 2, too, and the two buffers 1 and 2 maintain a state in which two pieces of addresses are stored. When a request queue arrives in this state, a request queue address 7 is transferred from the buffer 1 in turn, and when two pieces are reduced in the buffer, memory read is performed in the same manner as some time ago and the buffer is replenished by transferring the content of the pointer 5.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a memory area management system for an information processing apparatus, and more particularly, to a memory access queue management system.

[0002]

2. Description of the Related Art A queue management system is used as a method for acquiring a memory area (memory area) from a memory in response to a request for the memory area, and returning the memory area to the memory after the processing is completed to release the memory area. . FIG. 3 is a diagram for explaining an example of a conventional queue management system.
Referring to FIG. 3, the current pointer 5 holds the current pointer on the memory.

When returning the returned queue to the memory, the next pointer 6 stores the transferred return queue address 8, the current pointer 5 is used as the memory write data 10, and the next pointer 6 is used as the memory write address 11. The data is written to the memory, connected to the queue in the memory, and then the value of the next pointer 6 is transferred to the current pointer 5.

When a queue in the memory is taken out, data is read from the memory using the current pointer 5 as a read address 9 and the pointer address of the next memory data area included in the read memory read data 12 is stored in the next pointer 6. Then, the current pointer 5 is passed as the request queue address 7, and the value of the next pointer 6 is transferred to the current pointer 5 as a new value.

[0005]

However, the conventional queue management system has the following problems.

The first problem is that it is impossible to return a queue and accept a request at the same time. The reason is that there is no buffer.

[0007] The second problem is that it is impossible to accept a return or request that has arrived continuously, and it is necessary to wait for completion of reading and writing of the memory.

The reason is the same as the above-mentioned first problem.

SUMMARY OF THE INVENTION Therefore, the present invention has been made in view of the above-mentioned problems, and has as its object to provide an immediate response to a request / return of a queue address without access to a memory; An object of the present invention is to provide a queue management system capable of simultaneously responding to a request and return of an address.

[0010]

In order to achieve the above object, a current pointer for holding a current address pointer on a memory, a plurality of buffers for fetching a return queue address and passing a request queue address, The memory address of the next queue included in the memory read data at the time of reading the memory, and a next pointer to which the address of the return queue is transferred from the buffer when returning the returned queue to the memory. At the time of return, the current pointer is used as memory write data, and the next pointer is used as a memory write address, and is written to the memory, thereby returning the current pointer by linking to the queue in the memory and then transferring the value of the next pointer to the current pointer. When a queue is requested, the current pointer is read. As an address, reads the memory, fetches the address of the next queue included in the read memory read data to the next pointer, then transfers the next pointer as the new current pointer.

[0011]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention relates to a system for managing a memory area on a memory in a queue structure by using an address or the like. Response immediately without any request, and in addition to requesting and returning queue addresses,
It is possible to respond at the same time.

In a preferred embodiment, referring to FIG. 1, the queue management system of the present invention takes in a current pointer (5) holding a current address pointer on a memory and a return queue address (8). A plurality of buffers (1, 2, 3, 4) for passing a request queue address (7), and an address of a memory area of a next queue included in memory read data at the time of reading a memory when a queue request is made; And a next pointer to which a return queue address is transferred from the buffer (3) when returning the returned queue to the memory.
When the queue is returned to the memory, the current pointer (5) is used as the memory write data, and the next pointer (6) is used as the memory write address. , The value of the next pointer (6) is transferred to the current pointer (5), and at the time of a queue request for the memory, the memory is read using the current pointer (5) as a read address, and the next memory read data (12) included in the read memory read data (12) is read. The address of the queue is taken into the next pointer (6), and then the value of the next pointer (6) is transferred to the current pointer (5).

The next pointer (6) is a CP (not shown).
When returning the queue returned from U to the memory, the address of the return queue is transferred from the buffer (3), the current pointer (5) is used as the memory write data (10), and the next pointer (6) is written into the memory. By writing to the memory as the address (11), it is linked to the queue in the memory and returned. Then, the next pointer (6) is transferred as a new current pointer (5).

On the other hand, when a queue is taken out from the memory, the memory is read using the current pointer (5) as a read address (9), and the address of the next queue included in the read memory read data (12) is taken as the next pointer ( Then, the next pointer (6) is transferred as a new current pointer (5).

The buffers (1) to (4) are four buffers for taking in the return queue address (8) and passing the request queue address (7). Transfers the queue to the next pointer (6) to return the queue to memory,
When the number is less than the number, the queue is taken out of the memory and transferred from the current pointer (5) to the buffer (1) or the buffer (2). From the buffer (4) to the buffer (1), the output of the buffer in the preceding stage is passed to the selector circuit provided at the input of the buffer in the subsequent stage, as viewed from the side of fetching the return queue address.

As described above, according to the embodiment of the present invention, since a plurality of buffers are provided and two queue addresses are held, even if there is a continuous return or request of the queue address, Can be used immediately, during which time memory read / write can be performed and the buffer can be refilled. Also, since there are a plurality of buffers, the return of the queue address and the request can be received simultaneously.

[0017]

Embodiments of the present invention will be described with reference to the drawings. FIG. 2 is a diagram illustrating the structure of a queue according to an embodiment of the present invention. Referring to FIG. 2, the current pointer points to the head address of memory area # 1, the next pointer at the head of memory area # 1 points to the head of memory area # 2, and
The next pointer at the head of No. 2 points to the head of memory area # 3. A method of connecting (linking) the memory areas (queues) one after another in this way and managing the memory areas with the head address of the memory is called a queue management method. In addition,
The next pointer of the last entry of the link is usually set to a null value.

FIG. 1 is a diagram showing a configuration of a queue management system according to one embodiment of the present invention.

Referring to FIG. 1, a current pointer 5 holds a current pointer on a memory.

When returning the returned queue to the memory, the address of the return queue is transferred from the buffer 3, and the next pointer 6 is used as the memory write data 10 and the next pointer 6 is used as the memory write address 11. Write to the memory, connect to the queue in the memory, and then transfer the next pointer 6 as the new current pointer 5.

When the queue in the memory is taken out, the memory is read out using the current pointer 5 as the read address 9, the read memory read data 12 is taken in the next pointer 6, and then the next pointer 6 is replaced with the new current pointer 5 Transfer as

The buffers 1 to 4 are four buffers for receiving the return queue address 8 and passing the request queue address 7. And the buffer is 2
When the number exceeds the number, the queue is transferred to the next pointer 6 to return to the memory. When the number of buffers becomes two or less, the queue is taken out from the memory and transferred from the current pointer 5 to the buffer 1 or the buffer 2. I do. In the configuration of FIG. 1 (4 buffers), the return queue address 8
Buffer 4 that captures an output or return queue address 8 of buffer 4 via a selector.
And the buffer 2 that takes in one of the return queue address 8, the output of the buffer 3, and the output of the current pointer 5 via the selector, and one of the return queue address 8, the output of the buffer 2, and the output of the current pointer 5. And a buffer 1 that takes in the data via a selector. The output of the buffer 1 is output as a request queue address 7,
The output of the buffer 3 is supplied to a next pointer 6.

Next, the operation of the embodiment of the present invention will be described with reference to FIG.

In FIG. 1, the memory is read using the current pointer 5 as a read address 9.

The read memory read data 12
Then, the address value pointing to the next memory area is fetched into the next pointer 6, and then the next pointer 6 is transferred as the new current pointer 5, and at the same time, the old current pointer is transferred to the buffer 1. Similarly, the address is transferred to the buffer 2. The state where two addresses are stored in the two buffers 1 and 2 is maintained.

In this state, when the request queue arrives (at the time of requesting data acquisition in the memory area), the request queue address 7 is sequentially passed from the buffer 1, and when the number of buffers is reduced to less than two, the same operation as above is performed. The memory is read, and the contents of the current pointer 5 are transferred to the buffer to replenish the buffer.

When the return queue arrives (when a request to return the used memory area to the memory is made), at that time, the buffer is put into the empty bottom of the buffer, and three or more buffers are stored. At this time, the data is transferred from the buffer 3 to the next pointer 6, the current pointer 5 is written to the memory as the memory write data 10, the next pointer 6 is written to the memory as the memory write address 11, and then,
The value of the next pointer 6 is transferred as a new value of the current pointer 5.

[0028]

As described above, the present invention has the following effects.

The first effect of the present invention is that a buffer is used and two queue addresses are held. Therefore, even if a queue address is continuously returned or requested, the buffer value can be used immediately. Meanwhile, a memory read / write can be performed during that time to replenish the buffer.

A second effect of the present invention is that since a plurality of buffers are provided, a queue address return and a request can be simultaneously received.

[Brief description of the drawings]

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

FIG. 2 is a diagram showing a configuration of a queue in one embodiment of the present invention.

FIG. 3 is a diagram for explaining a conventional queue management system.

[Explanation of symbols]

 1, 2, 3, 4 Buffer 5 Current pointer 6 Next pointer 7 Request queue address 8 Return queue address 9 Memory read address 10 Memory write data 11 Memory write address

Claims (5)

[Claims] 1. A queue management system for taking out and inserting a memory area stored in a memory as a queue in units of a memory area in response to a request and a return thereof, and managing the queue. A plurality of buffers for temporarily storing and holding queue addresses to be retrieved from the memory (referred to as “request queue addresses”), and simultaneously perform queue requests and returns to the memory. A queue management system characterized by being able to accept. 2. A current pointer for holding a current address pointer on a memory, and an address of a queue to be returned to the memory (referred to as a "return queue address"). Request Queue Address "
When a queue request is issued, the memory address of the next queue included in the memory read data at the time of memory read at the time of a queue request is written, and the returned queue is returned to the memory. A next pointer to which a return queue address is transferred from the buffer; andwhen returning the queue to the memory, the current pointer is used as memory write data, and the next pointer is used as a memory write address, and written into the memory. A connection is returned to a queue in the memory, and then the value of the next pointer is transferred to the current pointer. When a queue request for the memory is made, the memory is read using the current pointer as a read address, and the read memory read is performed. Included in the data The next pointer address to the next pointer, and then transfer the value of the next pointer as the current pointer. 3. When the number of buffers exceeds two, the queue is transferred to the next pointer to return the queue to the memory. When the number of buffers is two or less, the queue is taken out of the memory and From the pointer, the first
3. The queue management system according to claim 1, wherein the data is transferred to a second buffer. 4. A current pointer for holding a current address pointer on a memory, and an address of a queue to be returned to the memory (referred to as a "return queue address"). Request Queue Address "
A first buffer to a fourth buffer provided in order from the sending side of the request queue address to the receiving side of the return queue address; and a memory for reading the memory when the queue request is made. And a next pointer to which a memory address of a next queue included in the read data is written, and a return queue address is transferred from the third buffer when returning the returned queue to the memory. The memory is read using the current pointer as a read address, a read address value pointing to the next memory area in the read memory read data is fetched into the next pointer, and the value of the next pointer (that is, the read address) is read into the next pointer. While transferring to the current pointer, The old value of the pointer is transferred to the first buffer, the current value of the current pointer is transferred to the second buffer, and the state where two addresses are stored in the first and second buffers is maintained. When the request queue arrives, the first
The request queue address is sequentially passed from the buffer to the memory side, and when the number of buffers is reduced below two, the memory is read again to replenish the buffer, and when the return queue arrives, Then, the return queue address is sequentially entered from the empty side of the buffer at that time, and when three or more buffers are stored, the buffer is transferred from the third buffer to the next pointer, and the current pointer is written to the memory. As data, the next pointer is connected to a queue in the memory by writing the next pointer to the memory as a memory write address and returned,
After that, the value of the current pointer is updated by transferring the value of the next pointer to the current pointer,
A queue management system, characterized in that: 5. The memory according to claim 1, wherein said memory is divided into a plurality of memory areas, and a next pointer area is provided at a predetermined position of each of said memory areas to point to an address of a next memory area. 5. The queue management system according to any one of 4.