JP2003345611A - System, method, and program for queue control - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a system and a method that register data in and take data out of a queue consisting of a plurality of segments at a high speed and easily expand and shorten the queue. <P>SOLUTION: A registration pointer and an extraction pointer for data are held in a queue control information part and an entry to be processed is predetermined; when the queue is operated, the queue is accessed by using the pointers to eliminate the need to perform retrieval from the queue and re-chain entries, thereby registering and extracting data at a high speed. Further, an annular link among segments is updated by generating a new segment to easily expand the queue and the annular link is updated by erasing unused segments to shorten the queue. <P>COPYRIGHT: (C)2004,JPO

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a queue control system, a queue control method, and a queue control program for a computer system, and more particularly to a queue control system, a queue control method, and a queue which are suitable for use in inter-process communication. It relates to a control program.

[0002]

2. Description of the Related Art Conventionally, data generated asynchronously is
For example, as a queue control system that sequentially registers and retrieves data in a FIFO (first-in first-out) system, a one-way chain having a head entry of a queue and a forward chain pointer in each entry, a system and a method using an index key are known. ing. The following publications on queue management are referenced: (A) JP-A-4-130929 (b) JP-A-4-259040 (c) JP-A-11-184716 (d) JP-A-6-68040 The above publications (a) to (d) An overview of the system described in is provided below.

Japanese Patent Application Laid-Open No. 4-130929 discloses that events having the same key value are grouped and the same key pointer that can be searched for the group is provided, so that the search process is skipped by using the same key pointer. A skip search unit and a same key pointer management unit that newly forms a group when an event having the same key value is added and adds an event to the group when a group is already formed are provided. A queue management scheme is disclosed. The same key pointer is a pointer that groups data having the same key value and chains the data so that a search process can be performed.

In the queue management system having such a configuration, even when a large number of data having the same key value are registered, the search for data having different key values is skipped by using the same key pointer by the skip search means. And the search process can be performed quickly. When registering new data, the same key pointer management means forms a new group or adds data to an existing group, so that the key values of all data forming the group are kept equal. be able to.

Japanese Patent Application Laid-Open No. 4-259040 discloses a method for determining whether or not a new queue block needs to be acquired by using management data of a circular queue management means for managing the queuing state of a circular queue. A queue comprising: a judging means; an acquiring means for acquiring a new queue block when the judging means judges that the acquisition is in a required state; and a setting means for setting the acquiring means to queue the new queue block in a circular queue. A management unit is provided to realize automatic addition of a queue block of a circular queue.

In the queue management system having such a configuration, queue management can be executed only by changing the chain of queues, so that the number of processing steps for queue management is smaller than that of a queue without a ring configuration. Thus, the speed of queue management can be increased. Also,
If all of the cue blocks are in use,
When new data is registered, a new queue block is obtained by the obtaining unit, and the queue block obtained by the setting unit is queued in the circular queue, so that the queue block of the circular queue can be automatically added.

Japanese Patent Application Laid-Open No. 11-184716 has a multitask for executing queuing processing and queuing-out processing of event queue elements separately, and always points to the head of an event queue composed of event queue elements. Two pairs of a start pointer and a final pointer that always points to the end are provided only for queuing and cue-out. A forward chain pointer and a backward direction for connecting successively occurring event queue elements within an event queue element are provided. A queue management system having a configuration including a chain pointer is disclosed. That is, a task for queuing processing, a task for queue-out processing, a confirmation type inter-task notification means, a queue buffer, a head pointer of a queue-only event queue, a final pointer of a queue-only event queue, It comprises a head pointer of a dedicated event queue, a final pointer of a queue-out dedicated event queue, a queuing-dedicated event queue, a queue-out dedicated event queue, and individual event queue elements constituting the event queue. Each event queue element has a forward chain pointer and a backward chain pointer.

In the queue management system having such a configuration, when data is registered in the queue, a queuing processing task is operated to register the data at the end of the queuing-dedicated head pointer, and to execute the event queue elements before and after. The forward chain pointer and the backward chain pointer are re-established. To retrieve data from the queue, the queue-out processing task operates, retrieves data from the end of the final pointer dedicated to queue-out, and re-stretches the forward and backward chain pointers in the preceding and following event queue elements. In this way, during queuing, data is registered at the point of the first pointer dedicated to queuing, and at cue-out, data is extracted from the point of the final pointer dedicated to cue-out. Processing becomes possible.

When a data registration request is issued during the operation of the queue-out processing task, the queuing processing task creates another event queue and performs processing.
The event queue is switched with the confirmation type inter-task notification means as the timing. For this reason, the queuing process and the queue-out process do not occur at the same time for one event queue, and there is no need for memory exclusion control even in multitasking, and efficient queue processing becomes possible.

Japanese Patent Laid-Open Publication No. 6-68040 describes a queue control system using a communication queue of a ring buffer system. Similarly, Japanese Patent Application Laid-Open No. 1-129345 (Title of Invention: "Multiprocessor System"),
JP-A-60-116064 (title of the invention: "communication system between distributed processing processors") and JP-A-58-16064
Japanese Patent Application Laid-Open No. 501740 (the title of the invention: "Interface mechanism of a paired processor such as a host and a peripheral control processor in a data processing system") and the like employ a ring buffer type queue for inter-processor communication. A technique for performing communication control is described.

Japanese Patent Application Laid-Open No. Hei 6-68040 discloses that when transmitting data between processors, a resource number, which is transmission data, is written to a location pointed to by a write pointer in a communication queue. A queue control method for inter-processor communication configured to extract a certain resource number is disclosed. The communication queue includes a reception read pointer, a transmission write pointer, and a communication resource.

In the queue control system having such a configuration, at the time of data registration, data is written to the point of the write pointer and the write pointer is updated. When data is taken out, data is taken out from the point point of the read pointer and the read pointer is updated. Therefore, the processing time of the communication queue can be shortened and the control of the communication queue can be simplified as compared with the chain method.

However, the conventional systems described in the above publications have the following problems.

As a first problem, in the queue management system of the chain system, the forward chain pointer or the backward chain pointer of the queue entry before and after must be reset when registering and retrieving data. That is to be late.

The reason is that queue management is performed by linking each queue entry with a chain pointer.

The second problem is that the queue management method of the ring buffer method cannot expand the queue at an arbitrary time.

The reason is that in the ring buffer system, the end of the buffer and the head are managed in a connected manner, and the buffer is used continuously in an endless manner such as returning to the head when the end is reached. This is because it is not possible to insert another area into the. The queue can be extended by extending the end of the buffer, but it is not possible to extend the queue at any time.

The third problem is that when a queue is used for inter-process communication, if there is no empty entry at the time of registering data, or if there is no data registered at the time of data retrieval, the queuing control for these is performed. This means that the user has to do it himself, which places a heavy burden on the user.

The reason is that in the conventional queue management system,
This is because there is no function to wait for data registration and retrieval.

[0020]

SUMMARY OF THE INVENTION Accordingly, the present invention has been made in view of the above problems, and an object of the present invention is to register data in a queue and retrieve data from the queue at high speed. It is an object of the present invention to provide a queue control system.

Another object of the present invention is to efficiently expand a queue when the number of data to be registered temporarily increases, and to degenerate the queue when the number of data is reduced, so that resources can be efficiently used. It is an object of the present invention to provide a queue control system that can use the above.

Still another object of the present invention is to provide a queue control system which can wait for data and empty entries and can easily realize inter-process communication.

[0023]

At least one of the above objects is attained.
A queue control system according to one aspect of the present invention, which achieves one of the above aspects, comprises a segment used as a queue, a queue control information section storing queue control information in the segment, and an entry in which data is registered. A plurality of segments having a data portion are generated, an annular link is set for each segment, and one of the plurality of annularly linked segments (“first
Segment)), the queue control information section of the first segment includes a registration pointer and a retrieval pointer indicating an entry of a data registration destination and a retrieval entry. Data registration means for registering data in at least the entry pointed to by the registration pointer of the queue control information section of the first segment, and data for extracting data from the entry pointed to by the extraction pointer of the queue control information section of the first segment There is provided a take-out unit and a queue exclusion unit for performing exclusive control of the queue.

More specifically, a queue control information section for storing queue control information in a queue segment and a data section for registering data are provided, a plurality of queue segments are generated, and a circular link is provided for each segment. Queue initialization means for setting and setting an initial value in the queue control information section;
Queue generating means, data registering means for registering data in the entry pointed to by the registration pointer of the queue control information section, data retrieving means for retrieving data from the entry pointed to by the retrieval pointer of the queue control information section, and registration of the queue control information section Data reverse fetching means for fetching data from the entry immediately before the entry pointed by the pointer, queue exclusion means for exclusion of the queue so that it cannot be used simultaneously by a plurality of processes, and stopping the queue to perform subsequent data registration and data fetching Queue stopping means for suppressing, queue erasing means for erasing queue segments, and queue re-initialization for re-initializing the queue control information section of the queue stopped by the queue stopping means so that the queue can be used again. Means, upon request from the user program. Performs generation and erasure cue, it operates to perform the data retrieval from the data register and queue to the queue at a high speed.

The queue control system according to the present invention further comprises a queue expansion unit for generating a new segment to be used as a queue and re-establishing a link between segments when there is no empty entry at the time of data registration. Queue degeneration means for deleting unused segments and re-establishing links between segments. When the number of registered data temporarily increases, the queue is automatically expanded and the number of data It operates to degenerate the queue when decreases.

If there is no empty entry at the time of data registration, the queue control system of the present invention waits for data to be fetched by another process to create an empty entry, and further registers the data registered at the time of data fetching. If there is no entry, there is a waiting means to wait for data to be registered by another process. If there is no entry that can be registered at the time of data registration, or if there is no data registered at the time of data retrieval, data registration and entry It works to wait for space.

According to another aspect of the present invention, there is provided a queue control method comprising: (a) a segment used as a queue, a queue control information section for storing queue control information in the segment, and an entry in which data is registered. A plurality of segments each having a data portion comprising a plurality of segments, a ring link is set for each of the segments, and one of the plurality of segments linked in a ring ("first
Setting an initial value in the queue control information section of the first segment. The queue control information section of the first segment includes at least a registration pointer and a retrieval pointer indicating an entry of a data registration destination and a retrieval entry. (B) registering data in an entry indicated by a registration pointer of the queue control information section of the first segment; and (c) retrieving data from an entry indicated by an extraction pointer of the queue control information section of the first segment. And (d) exclusive control of the queue.

A program according to another aspect of the present invention is a program for causing a computer to manage a queue, a segment used as a queue, and a queue control information section for storing queue control information in the segment. And a plurality of segments each having a data portion composed of an entry in which data is registered. An annular link is set for each of the segments, and one of the annularly linked segments (" 1). The queue control information section of the first segment includes a registration pointer and a retrieval pointer indicating the entry of the data registration destination and the retrieval entry. At least the data held by the registration pointer of the queue control information section of the first segment. A program for causing the computer to execute a process of registering data in the bird, a process of retrieving data from an entry pointed to by a retrieval pointer of the queue control information section of the first segment, and a process of exclusively controlling a queue. .

[0029]

Next, embodiments of the present invention will be described in detail with reference to the drawings. FIG. 1 is a diagram showing a configuration of an embodiment of the present invention. Referring to FIG.
The system according to the first embodiment of the present invention includes a computer system 100 that operates under program control, a queue control system 110, a queue segment 130, and a user program 140.

The queue control system 110 includes a queue generation unit 111, a queue stop unit 112, a queue deletion unit 113, a queue reinitialization unit 114, a data registration unit 115, a data extraction unit 116, and a data reverse extraction. Means 117 and a queue exclusion means 118.

The queue segment 130 includes a queue control information section 131 and a queue data section 132.

Each of these means operates as follows.

The queue generating means 111 generates a plurality of queue segments and sets a circular link to each segment.

The queue generating means 111 provides a queue control information section in the generated queue segment and sets an initial value.

The queue stop unit 112 stops the queue, and prohibits subsequent registration and retrieval of data.

The queue erasing means 113 erases each queue segment of the queue stopped by the queue stopping means 112.

The queue reinitializing means 114 reinitializes the queue control information section 131 of the queue which has been stopped by the queue stopping means 112. Thereafter, the queue re-initialization unit 114 sets the queue to a busy state, and enables the queue to be used again.

In response to a request from the user program 140, the data registration means 115 stores the user program 14 in the entry indicated by the registration pointer of the queue control information section 131.
Register the data passed from 0.

The data fetching means 116 receives the request from the user program 140 and
The data is retrieved from the entry indicated by the retrieval pointer of No. 1 and returned to the user program 140.

The data reverse fetching means 117 receives the request from the user program 140, and
The data is retrieved from the entry immediately before the entry indicated by the registration pointer 31 and returned to the user program 140.

The queue exclusion unit 118 is used by each of the units 111 to 117 of the queue control system 110 and performs exclusion control so that the queue segment is not referred to or updated by another process.

In the queue control system 110, the queue generating means 111, the queue stopping means 112, the queue erasing means 113, the queue reinitializing means 114, the data registering means 115, the data fetching means 116, the data reverse fetching means 117, and the queue exclusion means 118 , Each function and processing is realized by a program executed on a computer.

Next, the overall operation of this embodiment will be described in detail with reference to FIGS. 1, 2, 3, and 4 to 11. FIG. 2 shows the first embodiment of the present invention.
It is a figure which shows the queue segment in embodiment of 1st typically. FIG. 3 is a diagram illustrating an example of the queue control information unit. FIG. 4 is a flowchart for explaining an example of the operation of the queue generating unit 11 according to the first embodiment of the present invention.

First, the user program 140 generates the queue segment 130 using the queue generating means 111 in order to use the queue.

The user program 140 transmits information such as the number of segments and the data length to the queue generating means 111.

The queue generating means 111 first obtains the initial number of segments transmitted from the user program 140 (step S11 in FIG. 4).

Next, the queue generating means 111 generates segments for the number of initial segments (step S12).
An annular link is set between the generated segments (step S13).

As shown in FIG. 2, the queue segments have a ring-shaped structure for each segment.

Subsequently, the queue generating means 111 sets an initial value in the queue control information section 131 of the first segment (step S14), acquires a semaphore such as an exclusive semaphore or a notification semaphore, and acquires the queue control information. Part 131
(Step S15).

Finally, the queue generating means 111 sets a status flag (not shown) to the "in use" status (step S16), and returns the address of the first segment to the user program 140 (step S17). . In addition,
The status flag is set in an arbitrary storage device such as a rewritable memory and a register in the computer constituting the queue control system in FIG. 1, and the status of the queue (for example, the status of use or stop) is set.

Thereafter, when the user program 140 operates the queue, the address of the returned first segment is transmitted to the queue control system 110. That is, the first
Use the segment address as a key.

As shown in FIG. 3, information is stored in the queue control information section 131 only in the first segment, and after the second segment, only the address of the next segment is held. That is, as shown in FIG.
Segment 1 includes a registration pointer, a retrieval pointer, a data length, the number of data, a next segment, a number of used segments,
Initial segment count, maximum segment count, exclusive semaphore,
Each column of the notification semaphore and the number of waits is provided. The segment of the segment next to the segment 1 is the segment 2, the column of the segment next to the segment 2 is the segment 3, the segment 3
In the next segment column, segment 1 is initialized. In the queue control information section of the segments 2 and 3, only the column of the next segment is set.

FIG. 5 is a flow chart for explaining an example of the operation of the queue stopping means 112 according to the first embodiment of the present invention. When the user program 140 terminates the use of the queue, the queue is stopped by using the queue stopping means 112, and then the queue deleting means 11 is used.
3 to erase the queue segment 130. Further, after the queue is stopped, the queue can be used again by using the queue reinitialization unit 114.

The queue stopping unit 112 first excludes the queue using the queue exclusion unit 118 so that other processes do not use the queue at the same time (step S in FIG. 5).
21).

Next, the queue stopping means 112 checks the status flag indicating the status of the queue, and the status is "in use".
Is satisfied (YES in step S22), the status flag is set to a "stop" status.

Finally, the queue stopping unit 112 releases the exclusion of the queue by using the queue exclusion unit 118 (step S24).

If the status flag is not "in use" (NO in step S22), the stop is not possible, and the stop fails (step S25).

FIG. 6 is a flow chart for explaining an example of the operation of the queue erasing means 113 according to the first embodiment of the present invention. The queue erasing unit 113 first excludes the queue using the queue exclusion unit 118 (step S31 in FIG. 6).

Next, the queue erasing means 113 checks the status flag, and if the status is "stop" (YES in step S32), erases all the queue segments used (step S33). .

Next, the queue erasing means 113 releases the exclusion of the queue by using the queue exclusion means 118 (step S34), releases the semaphore (step S35), and ends.

If the status flag is not "stop" (NO in step S32), the erasure fails because the erasure cannot be performed (step S36).
8 to release the exclusion of the queue (step S3
7), end.

FIG. 7 is a flowchart for explaining an example of the operation of the queue reinitializing means 114 according to the first embodiment of the present invention. The queue reinitialization unit 114 first excludes the queue using the queue exclusion unit 118 (step S41 in FIG. 7).

Next, the queue re-initialization means 114 checks the status flag, and if the status is "stop" (YES in step S42), the queue re-initialization means 114 stores the initial status in the queue control information section 131 of the first segment. Set the value (Step S
43). In the queue control information section 131 of the first segment, the area that the queue reinitialization unit 114 sets to the initial value is only the area whose value is updated by using the queue.

Subsequently, the queue re-initializing means 114 sets the status flag to the "in use" status (step S4).
4).

Finally, the queue re-initialization means 114 releases the exclusion of the queue by the queue exclusion means 118 (step S45) and ends.

If the status flag is not "stop" in the status flag check (NO in step S42), the reinitialization by the queue reinitialization means 114 cannot be performed, and the reinitialization fails. (Step S46).

When the user program 140 registers data in the queue, the data registration means 115 is used.
When the user program 140 retrieves data from the queue, the data retrieval unit 116 or the data reverse retrieval unit 117 is used. Here, the user program 140 is LILO (Last InLa).
When data is taken out by the (st Out) method, the data taking out means 116 is used, and the LIFO (Last
In the case of taking out data by the (In First Out) method, the data reverse taking out means 117 is used.

FIG. 8 is a flow chart for explaining an example of the operation of the data registration means 115 according to the first embodiment of the present invention. The data registration unit 115 first excludes the queue using the queue exclusion unit 118 (step S51 in FIG. 8).

Next, the data registration means 115 checks the status flag, and if the status is "in use" (YES in step S52), checks the entry. If the entry pointed to by the registration pointer of the queue control information section 131 (referred to as “registration entry”) is not the last entry in the segment (NO in step S53), the next entry of the registration entry is set in the next registration pointer (step S54). ). The next entry after the registration entry is
It is easily obtained by adding the value of the data length of the queue control information section 131 to the offset within the segment of the registration pointer.

When the registered entry is the last entry in the segment (YES in step S53), data registration means 115 sets the next entry pointer to the first entry of the next segment (step S55). The next registration pointer is a work area used only by the data registration unit 115.

Next, if the entry pointed to by the next registration pointer is not the same as the entry pointed to by the extraction pointer of the queue control information section 131 (NO in step S56),
The data registration unit 115 determines that data registration is possible, and transfers the data transmitted from the user program 140 to the registration entry (step S57).

Subsequently, the data registration means 115 updates the registration pointer of the queue control information section 131 so as to point to the entry pointed to by the next registration pointer (step S58), and adds 1 to the number of data of the queue control information section 131. (Step S59).

Finally, the data registration unit 115 releases the exclusion of the queue using the queue exclusion unit 118 (step S60), and ends.

If the entry pointed to by the next registration pointer is the same as the entry pointed to by the extraction pointer of the queue control information section 131 (YES in step S56), the registration pointer catches up with the extraction pointer. There are no entries available. In this case, since there is no empty entry, data registration fails (step S61).

When checking the status flag, if the status flag is not "in use" (step S52)
NO), registration fails because data cannot be registered (step S62).

FIG. 9 is a flow chart for explaining an example of the operation of the data extracting means 116 according to the first embodiment of the present invention. First, the data extracting unit 116 excludes the queue using the queue exclusive unit 118 (step S71 in FIG. 9).

Next, the data extracting means 116 checks the status flag, and if the status is "in use" (YES in step S72), checks the number of data registered next. When the number of data in the queue control information section 131 is larger than 0 (YE in step S73)
S), that is, the data exists, and the data is transferred from the entry (“fetch entry”) pointed to by the take pointer of the queue control information section 131 to the data return area transmitted from the user program 140 (step S74). ).

Next, the data extracting means 116 subtracts 1 from the number of data in the queue control information section 131 (step S75).

Subsequently, when the fetched entry is not the last entry in the segment (N in step S76)
O), the data fetching unit 116 updates the data fetch pointer of the queue control information unit 131 so as to point to the entry next to the fetch entry (step S7).
7).

If the extracted entry is the last entry in the segment (YES in step S76),
The data fetching unit 116 updates the data fetch pointer to point to the first entry of the next segment (step S78).

Finally, the data fetching means 116 releases the exclusion of the queue using the queue exclusion means 118 (step S79), and ends.

If the number of data is 0 (NO in step S73), since there is no registered data,
Data retrieval fails (step S80).

When checking the status flag, if the status flag is not in the "in use" state (step S72).
(NO in step S81), the data cannot be retrieved, and the retrieval fails (step S81).

FIG. 10 is a flowchart for explaining an example of the operation of the data reverse extracting means 117 according to the first embodiment of the present invention. Data reverse retrieval means 117
First excludes the queue using the queue exclusion means 118 (step S91 in FIG. 10).

Next, the data retrieving means 117 checks the status flag, and if the status is "in use" (YES in step S92), checks the number of data registered next.

If the number of data in the queue control information section 131 is larger than 0 (YES in step S93), it means that registered data exists in the queue segment.

If the entry (registration entry) pointed to by the registration pointer of the queue control information section 131 is not the first entry in the segment (NO in step S94), the reverse data fetching means 117 deletes the entry immediately before the registration entry. Update the registration pointer to point (step S
95).

The entry immediately before the registration entry can be easily obtained by subtracting the data length value of the queue control information section 131 from the offset within the segment of the registration pointer.

If the registered entry is the first entry in the segment (YES in step S94),
The data reverse fetching unit 117 obtains the segment immediately before the segment indicated by the registration pointer (step S9).
6) Update the registration pointer to point to the last entry of the segment (step S97).

Here, the queue control information section 1 of the segment
31 does not have a link to the previous segment, but since the segments constituting the queue are linked in a ring, the data reverse fetch unit 117 traces the link to the next segment to The segment can be reached.

Subsequently, the data reverse extracting means 117
Data is transferred from the entry pointed to by the updated registration pointer to the data return area transmitted from the user program 140 (step S98).

Next, the data reverse extracting means 117 subtracts "1" from the number of data in the queue control information section 131 (step S99).

Finally, the data reverse extracting means 117
The exclusion of the queue is released using the queue exclusion unit 118 (step S100), and the process ends.

If the number of data is "0" (NO in step S93), there is no registered data, so that data extraction fails (step S101).

When checking the status flag, if the status flag is not "in use" (step S92)
NO), the registration fails because the data cannot be registered (step S102).

Next, the operation and effect of this embodiment will be described.

In this embodiment, at the time of data registration, the data is transferred to the entry pointed to by the registration pointer, and the registration pointer is updated so as to point to the next entry. Retrieval and retrieval pointers are updated to point to the next entry, so there is no need to search for queues or change forward chains during data registration and data retrieval, and register data at high speed. And take out can be done.

Further, in this embodiment, since there are two means for fetching data, a means for fetching data in the forward direction and a means for fetching data in the reverse direction, it is possible to mix the FIFO method and the LIFO method. It has become. As a result, usually, when canceling data once registered using the FIFO method, the LIFO method can be used.

Further, in the present embodiment, a queue is generated in response to a request from the user program, and subsequent queue operations are performed using the address of the first segment as a key. Multiple queues can be used from a user program.

Further, in this embodiment, since the queue which has been used can be deleted and reused, the memory resources can be used efficiently.

[0101]

Next, the operation of this embodiment will be described with reference to specific examples.

When the user program 140 starts using the queue, the queue generating means 111 is instructed to send a data length of 48 bytes, an initial segment number of 3, and a maximum segment number of 1.
Requests queue generation as 0.

The queue generating means 111 obtains the initial segment number "3" (step S11 in FIG. 4) and generates three segments (step S12).

Subsequently, a ring-shaped link is set between the generated segments (step S13).

The segments are connected in a ring by a "next segment" region as shown in FIG. Subsequently, the queue control information section 13 of the first segment (segment 1 in FIG. 2)
An initial value is set to 1 (step S14).

The queue control information section 131 has the contents shown in FIG. 3, and the initial values of the registration pointer and the extraction pointer are set so as to point to the first entry of the segment 1.

The data length is set to “48 bytes” transmitted from the user program 140, and the number of data is set to “48 bytes”.
Set "0".

The next segment area is not set here because the ring link has been set previously.

The initial segment number and the maximum segment number are set as they are “3” and “10” transmitted from the user program, and the used segment number is the current used segment number, that is, the initial segment number. Set the number “3”.

The exclusive semaphore and the notification semaphore are null (n
(ull) value is set, and the number of waiting processes is set to “0”.

Next, the queue generation means 111 acquires the exclusive semaphore and the notification semaphore, and
31 (step S15).

Subsequently, the queue generating means 111 sets the status flag to "in use", and sets the address A of the segment 1 to "in use".
Is returned to the user program 140.

Thus, the creation of the queue is completed, and thereafter, the user program 140 can operate the queue using the returned address A of the first segment.

Next, the operation for registering data will be described.

As shown in FIGS. 2 and 3, the registration pointer points to “entry 4 of segment 1”, the extraction pointer points to “entry 6 of segment 2”, and the number of registered data is “9”. In this case, when registration of new data is requested, the data registration unit 115 first excludes the queue (step S51 in FIG. 8), and when the status flag is checked, the status is "in use" (step S52). YES).

Here, as shown in FIG.
Has entries 1 to 6, and the registered entry is
Since this is entry 4, it is not the last entry in segment 1 (NO in step S53). Therefore, “entry 5 of segment 1” is set as the next registration pointer of the work area (step S54).

Since the extraction pointer is “entry 5 of segment 2”, it is different from the next registration pointer (NO in step S56).

Then, the data registration means 115 transfers the registration data to “entry 4 of segment 1” (step S57), sets “entry 5 of segment 1” to the registration pointer (step S58), To the number
"1" is added to "10" (step S59).

Lastly, the data registration means 115 releases the exclusion of the queue (step S60). This completes the registration of new data.

Next, the operation for extracting data will be described.

As shown in FIGS. 2 and 3, the registration pointer points to “entry 4 of segment 1”, the extraction pointer points to “entry 6 of segment 2”, and the number of registered data is “9”. , And when a request to retrieve data by the FIFO method is made, the data retrieval unit 116 first excludes the queue (step S in FIG. 9).
71), when the status flag is checked, the status is "in use" (YES in step S72). Since the number of data is "9" (YES in step S73), the data is transferred from the entry 6 of the segment 2 to the data return area (step S74), and "1" is subtracted from the number of data to "8". (Step S75).

Here, as shown in FIG.
Has entry 1 to entry 6, and since the entry to be taken is entry 6, it is the last entry in segment 2 (YES in step S76). Therefore, “entry 1 of segment 3” is set as the extraction pointer of the queue control information section (step S78).

Finally, the data retrieving means 116 releases the exclusion of the queue (step S79). Now, F
Data could be taken out by the IFO method.

Similarly, as shown in FIGS. 2 and 3, the registration pointer points to “entry 4 of segment 1”, the takeout pointer points to “entry 6 of segment 2”, and the number of registered data points If “9”, L
When requesting data retrieval by the IFO method, the data reverse retrieval unit 117 first excludes the queue (FIG. 10).
When the status flag is checked, the status is "in use" (YES in step S92). The number of data is “9” (YE in step S93).
S). Here, as shown in FIG. 2, since segment 1 has entries 1 to 6, and the registered entry is entry 4, there is no leading entry in segment 1 (NO in step S94).

Therefore, the data reverse fetching means 117
"Segment 1" which is the entry before the registration entry
Entry 3 ”(the last registered entry) is set as a registration pointer (step S95), and“ Segment 1 ”is set.
Is transferred from the entry 3 "to the data return area (step S98), and" 1 "is subtracted from the number of data to"
8 "(step S99).

Finally, the data reverse extracting means 117
The exclusion of the queue is released (step S100). Thus, data could be extracted by the LIFO method.

Next, a second embodiment of the present invention will be described in detail with reference to the drawings. FIG. 11 is a diagram showing a configuration of the second exemplary embodiment of the present invention. In this embodiment, a queue expansion unit 219 and a queue reduction unit 220 are added to the configuration of the embodiment shown in FIG.

Referring to FIG. 11, the second embodiment of the present invention includes a computer system 200 that operates under program control, a queue control system 210, a queue segment 230, and a user program 240. It is configured.

The queue control system 210 includes a queue generation unit 211, a queue stop unit 212, a queue deletion unit 213, a queue reinitialization unit 214, a data registration unit 215, a data extraction unit 216, and a data reverse extraction unit. Means 217, queue exclusion means 218, queue expansion means 219, and queue degeneration means 220.

[0130] The queue segment 230 includes a queue control information section 231 and a queue data section 232.

Each of these means operates roughly as follows. Here, an operation different from the first embodiment will be described.

The queue reinitializing means 214 reinitializes the queue control information section of the queue which has been stopped by the queue stopping means 212, and deletes the queue segments so that the number of queue segments becomes the initial number of segments. Reconfigure the ring link. Then, the queue re-initialization means 214
Puts the queue in use and makes the queue available again.

In response to a request from the user program 240, the data registration means 215 stores the user program 240 in the entry indicated by the registration pointer of the queue control information section 231.
Register the passed data. If there is a shortage of segments at the time of data registration, the data registration unit 215 generates a new segment using the queue expansion unit 219 to expand the queue.

The data retrieving means 216 receives the request from the user program 240 and
Data is retrieved from the entry indicated by the retrieval pointer of No. 1 and returned to the user program. Further, the data fetching unit 216 uses the queue degenerating unit 220 to delete the segment in which no data is registered.

The data reverse fetching means 217 receives the request from the user program 240, and
The data is extracted from the entry immediately before the entry indicated by the registration pointer 31 and returned to the user program 240. In addition, the data reverse fetching unit 217 uses the queue degenerating unit 220 to delete the segment in which the data is not registered.

The queue expansion means 219 generates one new segment, sets the generated segment as the “next segment” of the previous segment, and sets the generated “next segment” as the previous segment. By setting the segment that has been set, a queue segment is added and the queue is extended.

The queue shrinking means 220 sets the segment to 1
The number of queue segments is reduced by setting the segment that was set as the “next segment” of the erased segment to the “next segment” of the previous segment,
Degenerate the queue.

In the queue control system 210, the queue generating means 211, the queue stopping means 212, the queue erasing means 213, the queue reinitializing means 214, the data registering means 215, the data extracting means 216, the data reverse extracting means 217, and the queue exclusion means 218. , Queue expansion means 2
19. The functions and processes of the queue reduction means 220 are realized by a program executed on a computer.

Next, the overall operation of the present embodiment will be described in detail with reference to FIG. 11 and the flowcharts of FIGS. Here, means different from the first embodiment in operation will be described.

FIG. 14 is a flow chart for explaining an example of the operation of the queue reinitialization means 214 according to the second embodiment of the present invention. In the queue reinitialization means 214,
When the queue is reinitialized, the number of used segments in the queue control information unit 231 is compared with the number of initial segments, and if the number of used segments is larger than the number of initial segments (YES in step S113 in FIG. 14), the queue is expanded. That is, the process of returning to the initial state is executed.

First, the queue re-initializing means 214 deletes the number of segments that have been expanded, that is, (the number of used segments−the number of initial segments) from the second segment onward (step S114).

Next, the queue re-initializing means 214 resets the circular link between the remaining segments (step S).
115). Thus, the state of the queue segment becomes the initial state.

When the number of used segments ≦ the number of initial segments is satisfied (NO in step S113), the queue is not expanded, and the process of returning to the initial state (steps S114 and S115) is unnecessary.

FIG. 15 is a flow chart for explaining an example of the operation of the data registration means 215 according to the second embodiment of the present invention.

In the case where the user program 240 registers data in the queue, the data registration means 215
When the entry pointed to by the registration pointer of the queue control information section 231 (referred to as “registration entry”) is the last entry in the segment (YE in step S123 in FIG. 15).
S), the segment next to the segment pointed to by the registration pointer (hereinafter, the registered segment) is the segment pointed to by the extraction pointer (YES in step S125),
If the number of used segments does not exceed the maximum number of segments even if the number of used segments increases, that is, if “number of used segments + 1 ≦ maximum number of segments” (YES in step S126),
The queue is expanded by designating the registration segment in the queue expansion unit 219 (step S127).

The queue expanding means 219 generates one new segment (step S181 in FIG. 18) and resets the circular link so that the designated segment, here the next segment of the registered segment, becomes the generated segment. Then, 1 is added to the number of used segments (step S183).

Thus, in the data registration means 215,
A new queue segment has been added as the next segment after the registered segment.

Subsequently, the next segment, that is, the first entry of the added segment is set in the "next registration pointer" (step S128), and the subsequent processing is performed.

If there is no segment pointed to by the extraction pointer to the segment next to the registered segment (NO in step S125), it means that there is at least one segment in which no data has been registered. No new segment is generated because there is no need for expansion.

When "the number of used segments + 1> the maximum number of segments" is satisfied (NO in step S126), the number of segments exceeds the maximum number of segments specified at the time of generation, so that a new segment is not generated.

FIG. 16 is a flow chart for explaining an example of the operation of the data extracting means 216 according to the second embodiment of the present invention.

When the user program 240 sends the FI
When fetching data by the FO method, the data fetching unit 216 determines that the entry pointed to by the fetch pointer of the queue control information unit 231 is the last entry in the segment (YES in step S146 in FIG. 16).
The data fetch pointer is updated to point to the first entry of the next segment (step S148).

Here, the case where the segment pointed to by the registration pointer is not the segment from which the data was extracted (hereinafter, referred to as “extracted segment”) (step S14)
9), the fetched segment is not the first segment (NO in step S150), and even if the queue has been expanded in the past and the segment has been deleted, the number of segments does not fall below the initial number of segments, that is, “the number of used segments−1”. If ≧ initial number of segments ”(YES in step S151), the queue is degenerated by designating a fetch segment to the queue degeneration means 220 (step S152).

The queue shrinking means 220 deletes the designated segment, here, the fetched segment (FIG. 19).
Step S191), the circular link is reset so that the previous segment of the designated segment points to the next segment (Step S192), and 1 is subtracted from the number of used segments (Step S193).

If the segment pointed to by the registration pointer is a fetch segment (YE in step S149)
S) does not delete the segment because other data exists in the fetch segment. When the extraction segment is the first segment (Y in step S150)
ES), the first segment is a segment used as a key in the user program 240 and is a segment in which control information is stored.

When “the number of used segments−1 <the number of initial segments” is satisfied (NO in step S151),
Do not delete segments because the number of segments is less than the initial number of segments.

FIG. 17 is a flowchart for explaining an example of the operation of the data reverse extracting means 217 according to the second embodiment of the present invention.

When the user program 240 sends the LI from the queue
When fetching data by the FO method, the data reverse fetch unit 217 determines that the entry pointed to by the registration pointer of the queue control information unit 231 is the first entry in the segment (YES in step S164 in FIG. 17).
The registration pointer is updated to point to the last entry of the previous segment (steps S166 and S16 in FIG. 17).
7).

In this case, the segment pointed to by the registration pointer before the update (hereinafter, the original segment) is not the segment pointed to by the extraction pointer (step S
168), the original segment is not the first segment (NO in step S169), and queue expansion has occurred in the past, and “the number of used segments−1 ≧ the number of initial segments” is satisfied (YES in step S170). In step S171, the original segment is specified to the queue reduction unit 220 to reduce the queue. The original segment is deleted by the queue degeneration means 220.

If the segment pointed to by the registration pointer before updating (referred to as “original segment”) is the segment pointed to by the extraction pointer (Y in step S168)
ES), because other data exists in the original segment, the segment is not deleted.

If the original segment is the first segment (YES in step S169), the first segment is not deleted.

When “the number of used segments−1 <the number of initial segments” is satisfied (NO in step S170),
Do not delete segments because the number of segments is less than the initial number of segments.

Next, the operation and effect of this embodiment will be described.

In the embodiment of the present invention, when data is registered, a segment is added when entries are likely to be insufficient, and when data is taken out, a segment is deleted when a segment having no data is detected. Therefore, when the number of data temporarily increases, the queue can be automatically expanded, and when the number of data decreases, the queue can be reduced, and the memory resources can be used efficiently.

Further, in the present embodiment, when registering data, when the registration pointer and the retrieval pointer point to the same segment, that is, when the registration pointer catches up with the retrieval pointer and there is a possibility that the number of entries becomes insufficient, the segment Is added, so
The queue can be expanded in advance before running out of entries.

Next, the operation of this embodiment will be described using a specific example.

As shown in FIG. 2 and FIG. 3, the registration pointer points to “entry 4 of segment 1”, the takeout pointer points to “entry 6 of segment 2”, and the number of registered data is “ 9 ”, the number of used segments is 3, the number of initial segments is 3, and the maximum number of segments is 10. Here, when two pieces of data are registered from the user program, the registration pointer points to “entry 6 of segment 1”, and the number of data becomes 11. In this state, if further data registration is requested, the registration entry is entry 6, which is the last entry of segment 1 (YES in step S123 in FIG. 15), the segment pointed to by the extraction pointer is "segment 2", This is the next segment of “segment 1” (YE in step S125)
S).

Further, since the number of used segments + 1 = 4 ≦ 10 (YES in step S126), the data registering unit 215 adds the segment 4 as the next segment of the segment 1 by the queue expanding unit 219 (step S127). ).

As described above, the queue is expanded to the state shown in FIG. 12 and FIG.

Next, as shown in FIGS. 12 and 13, when the queue has a registration pointer of "entry 1 of segment 4".
And the extraction pointer is “entry 6 of segment 2”
It is assumed that the number of registered data is “13”, the number of used segments is 4, the initial number of segments is 3, and the maximum number of segments is 10.

In this state, when requesting data fetching by the FIFO method, the data fetching means 216
Since the fetched entry is entry 6 and is the last entry of segment 2 (step S146 in FIG. 16),
“Entry 1 of segment 3” is set to the extraction pointer (step S148).

Here, the segment pointed to by the registration pointer is “segment 4”, not “segment 2” (NO in step S149), and “segment 2” is the first segment.
It is not a segment (NO in step S150).

Further, since the number of used segments −1 = 3 ≧ 3 (YES in step S151), the data extracting unit 216 deletes the segment 2 by the queue degenerating unit 220 (step S152).

As described above, the queue is degenerated and becomes the segment 4 instead of the segment 2 in FIGS.
State 3 is reached.

Similarly, as shown in FIGS. 12 and 13, the queue is registered with the registration pointer pointing to “entry 1 of segment 4” and the takeout pointer pointing to “entry 6 of segment 2”. The number of data is "1"
Assume that the number of segments is "3", the number of segments used is "4", the number of initial segments is "3", and the maximum number of segments is "10".

In this state, when requesting data extraction by the LIFO method, the data reverse extraction means 217
Indicates that the entry pointed to by the registration pointer is the head entry of segment 4 (YE in step S164 in FIG. 17).
S), the entry 6 of the segment 1 is set as the registration pointer (steps S166 and S167).

Here, the extraction pointer points to segment 2 instead of segment 4 (step S1).
68, NO), the segment 4 is not the first segment (NO in step S169), and the number of used segments −1 = 3 ≧ 3 (YES in step S170). By 220, the segment 4 is erased (step S171). In this way, the segment 4 of the queue is degenerated, and FIG. 2 and FIG.
State.

Next, a third embodiment of the present invention will be described in detail with reference to the drawings.

Referring to FIG. 20, in the third embodiment of the present invention, a computer system 300 operated by program control, a queue control system 310, a queue segment 330, a user program 340, a user program 341.

The queue control system 310 includes a queue generation unit 311, a queue stop unit 312, a queue deletion unit 313, a queue re-initialization unit 314, a data registration unit 315, a data extraction unit 316, and a data reverse extraction unit. Means 317, queue exclusion means 318, queue expansion means 319, queue degeneration means 320, and queuing means 321.

[0181] The queue segment 330 includes a queue control information section 331 and a queue data section 332.

Each of these means operates roughly as follows. Here, means different from those of the first and second embodiments in operation will be described.

The queue stopping unit 312 starts a process waiting for data or entry by using the waiting unit 321 to put the queue in a stopped state and prohibits the subsequent registration and retrieval of data.

The data registration means 315 registers the data passed from the user program in the entry indicated by the registration pointer of the queue control information section 331 in response to a request from the user program (340/341).

At this time, if there is a process waiting for data registration, the waiting process is started by using the waiting means 321. In other words, if the number of waiting for data registration is 1 or more,
Notify the notification semaphore and cancel the wait. If there is no empty entry at the time of data registration, the waiting means 321 waits for an empty entry.

The data fetching means 316 fetches data from the entry indicated by the fetch pointer of the queue control information section 231 and returns it to the user program in response to a request from the user program. At this time, if there is a process waiting for an empty entry, the waiting process is started using the wait canceling unit 323. In other words, when the number of queuing of empty entries is one or more, a notification is sent to the notification semaphore and the queuing is released. If there is no data registered at the time of data retrieval, the data is registered using the queuing means 321.

In response to a request from the user program, the data reverse extracting means 217 extracts data from the entry immediately before the entry indicated by the registration pointer of the queue control information section 331 and returns the data to the user program. At this time, if there is a process waiting for an empty entry, the waiting process is started by using the waiting means 321. That is, when the number of queuing is one or more, a notification is sent to the notification semaphore and the queuing is released. If there is no data registered at the time of data retrieval, the data is registered using the queuing means 321.

The queuing means 321 adds 1 to the number of queuing, releases the exclusion of the queue using the queue exclusion means 318, and waits for a queuing release notification using the notification semaphore. When the notification is received, the queuing unit 321 locks the queue using the queue exclusion unit 318, and subtracts 1 from the number of queuing.

In the queue control system 310, the queue generating means 311, the queue stopping means 312, the queue erasing means 313, the queue reinitializing means 314, the data registering means 315, the data extracting means 316, the data reverse extracting means 317, and the queue exclusion means 318. , Queue expansion means 3
19. Queue reduction means 320, queuing means 321
, Each function and processing is realized by a program executed on a computer.

Next, the overall operation of the present embodiment will be described in detail with reference to FIG. 20 and the flowcharts of FIGS. Hereinafter, points of this embodiment different from the operations of the first and second embodiments will be described.

FIG. 23 is a flow chart for explaining an example of the operation of the queue stopping means 312 according to the third embodiment of the present invention. When the use of the queue is stopped by the queue stop unit 312, the queue stop unit 312 determines the number of queues in the queue control information unit 331 of the first segment after checking the status flag.

Queue control information section 331 of first segment
If the number of waits is larger than 0 (YES in step S213 in FIG. 23), it means that there is a process waiting for the notification, and the notification is made to the notification semaphores for the number (step S214). Then, the status flag is set to "stop" (step S215).

Thus, all the waiting processes are started, and the respective processes are continued. However, in the subsequent state check, since they are not “in use”, all the processes fail.
No queue is used. Note that the number of waits is 0
In the case of (NO in step S213), there is no waiting process, so there is no need to notify.

FIG. 24 is a flow chart for explaining an example of the operation of the data registration means 315 according to the third embodiment of the present invention.

When the user program 340 registers data in the queue, the data registration means 315
If the entry pointed to by the set next registration pointer is the same as the entry pointed to by the extraction pointer of the queue control information section 331 (YES in step S229 of FIG. 24),
This means that the registration pointer catches up with the retrieval pointer, and there is no entry that can be registered next.

In this case, the data registration unit 315 uses the waiting unit 321 to wait for another process to retrieve data and create an empty entry (step S236).

FIG. 27 is a flowchart for explaining an example of the operation of the queuing means according to the third embodiment of the present invention. The queuing unit 321 adds 1 to the number of queuing in the queue control information unit 331 of the first segment (Step S281 in FIG. 27), releases the exclusion of the queue using the queue exclusion unit (Step S282), and Waiting is performed using the notification semaphore of the control information unit 331 (step 283).

Waiting is canceled by a notification from the data registration unit 315, the data extraction unit 316, the data reverse extraction unit 317, or the data stop unit 312.

Thereafter, the queuing unit 321 excludes the queue by the queue exclusion unit (step S284).
One is subtracted from the waiting number (step S285), and the process ends.

When the waiting is canceled by the data registration means 315, that is, when an empty entry is created, the data registration means 315 re-executes the processing from the check of the status flag (step S222 in FIG. 24).

If the data has been registered (executed until step S232) and the number of waits is greater than 0 (YES in step S233), it is determined that there is a process waiting for data registration. means.

Then, the data registration means 315 notifies the notification semaphore (step S234), and starts the waiting process. If the number of waits is 0 (NO in step S233), there is no waiting process, so there is no need to notify.

FIG. 26 is a flowchart for explaining an example of the operation of the data extracting means 316 according to the third embodiment of the present invention.

The user program 340 sends the FI
In the case where the data is retrieved by the FO method, the data retrieval unit 316 determines that there is no registered data when the number of data in the queue control information unit 331 of the first segment is 0 (NO in step S243 in FIG. 25). Therefore, using the queuing means 321 to wait for data registration by another process (step S25)
6).

When the waiting is released, that is, when the data is registered, the data retrieving means 316 re-executes the processing from the state flag check (step S242). Further, when the data is taken out and the updating of the pointer is completed (executed until step S247), the waiting number of the queue control information section 331 of the first segment becomes 0.
If it is larger (YES in step S253), it means that there is a process waiting for an empty entry.

Therefore, the data extracting unit 316 notifies the notification semaphore of the queue control information unit 331 of the first segment (step S254), and starts the waiting process. On the other hand, if the number of queues in the queue control information unit 331 of the first segment is 0 (NO in step S253), there is no process waiting, so there is no need to notify.

FIG. 26 is a flow chart for explaining an example of the operation of the data reverse fetching means according to the third embodiment of the present invention.

When the user program 340 moves from the queue to the LI
In the case where the data is extracted by the FO method, the data reverse extraction unit 317 determines that the number of data in the queue control information unit 331 is 0 (N in step S263 in FIG. 26).
O) Since there is no registered data, the waiting unit 321 waits for data registration by another process (step S277). When the waiting is released, that is, when the data is registered, the data reverse extraction unit 317 re-executes the process from the check of the status flag (step S262). If the data has been completely extracted (executed until step S275), and if the number of queues in the queue control information unit 331 of the first segment is greater than 0 (YES in step S274), there is a process waiting for an empty entry. Means to do.

Then, the data reverse fetch unit 317 notifies the notification semaphore of the queue control information unit 331 of the first segment (step S275), and starts the waiting process. If the number of waits is 0 (NO in step S274), there is no process waiting, and there is no need to notify.

Next, the effect of the present embodiment will be described.

In the present embodiment, when there is no empty entry at the time of data registration, another process retrieves data and automatically waits for an empty entry. You can use the queue without having to do it.

Further, in the present embodiment, if data does not exist at the time of data retrieval, the system is configured to automatically wait for data registration by another process. The queue can be used without being aware of the number.

[0213]

Embodiment 2 Next, the operation of this embodiment will be described using a specific embodiment.

As shown in FIGS. 21 and 22, for example, as shown in FIGS. 21 and 22, the registration pointer points to “entry 4 of segment 1” and the extraction pointer points to “entry 5 of segment 1”. Is "1"
7 ", the number of used segments is 3, the number of initial segments is 3, and the number of maximum segments is 3. In this state, when the user program 340 registers data, the data registration means 3
In No. 15, since the registration pointer points to “entry 4 of segment 1” and is not the last entry (NO in step S223 of FIG. 25), “entry 5 of segment 1” is set as the next registration pointer (step S22).
4).

Then, since the next registration pointer = the extraction pointer (YES in step S229), the queuing means 236 waits for an empty entry (step S236). The queuing unit 321 sets the queuing number of the queue control information unit 331 of the first segment to 1 (step S281 in FIG. 27), releases the exclusion of the queue (step S282), and waits for a notification (step S283).

Here, the user program 341 is an FI
When data is taken out by the FO method, the data taking out means 3
In step 16, data is extracted from "entry 5 of segment 1" (steps S244 and S245 in FIG. 25). Since the entry 5 is not the last entry (step S24)
No in step 6), "entry 6 of segment 1" is set in the take-out pointer (step S247).

Subsequently, since the number of queues in the queue control information unit 331 of the first segment is 1 (YES in step S253), the data extracting unit 316 sets the notification semaphore in the queue control information unit 331 of the first segment. Notify (step S254).

The queuing means 321 receives the notification from the data extracting means 316 in the user program 341 and continues the processing. The queuing means 321 excludes the queue (step S284 in FIG. 27), and subtracts 1 from the number of queuing in the queue control information section 331 of the first segment (step S285).

Subsequently, in the data registration means 315, when the processing is re-executed from the status check (step S222 in FIG. 24), "entry 5 of segment 1" is set in the next registration pointer (step S224), and the next registration Since pointer ≠ extraction pointer (NO in step S229), data registration is completed (step S230,
S231 and S232).

Subsequently, the number of queues in the queue control information section 331 of the first segment is 0 (step S2).
33, NO), the data registration unit 315 releases the exclusion of the queue without performing notification (step S235), and ends.

The queue control system of each of the above embodiments employs a virtual storage system, and is suitable for use in segment management of a computer that manages a virtual storage space by segmentation.

Further, in realizing inter-process communication, the burden on the user can be reduced. That is, in the above embodiment, by registering data in the queue and waiting for an empty entry in the queue control system, in the queue operation, no data empty or overflow occurs, and the user program side There is no need to build a complicated program that takes error processing into account.
In addition to this, any queue having a configuration having a data entry holding information data and a queue control information section, such as dynamic buffer management which acquires a buffer from the buffer pool when necessary and returns the buffer after use, etc. Of course, it can be applied to the management system. Although the present invention has been described with reference to the above embodiment, the present invention is not limited to the above embodiment, and can be made by those skilled in the art without departing from the scope of the claims. Needless to say, various changes and modifications that may be included are included.

[0223]

As described above, according to the present invention, the following effects can be obtained.

A first effect of the present invention is that data can be registered in and retrieved from a queue at high speed.

The reason for this is that, in the present invention, the entry to be processed is determined in advance by a registration pointer or a retrieval pointer, and when registering and retrieving data, it is necessary to search for a queue or replace a chain between entries. This is because it is unnecessary.

A second effect of the present invention is that memory resources can be used efficiently.

The reason is that, in the present invention, a queue whose use has been completed can be deleted or reused, and when the number of registered data temporarily increases, automatic This is because when the number of registered data is reduced, control is performed to degenerate the queue.

A third effect of the present invention is that the burden on the user can be reduced in realizing inter-process communication.

The reason is that, in the present invention, the registration of data in the queue and the queuing of empty entries are performed inside the queue control system.
No data empty or overflow occurs, and there is no need to be aware of abnormalities on the part of the user program.
This is because, for example, it is not necessary to build a program that takes into account error processing and the like.

[Brief description of the drawings]

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

FIG. 2 is a diagram schematically illustrating a queue segment according to the first embodiment of the present invention.

FIG. 3 is a diagram illustrating an example of a queue control information unit according to the first embodiment of the present invention.

FIG. 4 is a flowchart illustrating an example of an operation of a queue generation unit according to the first embodiment of the present invention.

FIG. 5 is a flowchart illustrating an example of an operation of a queue stopping unit according to the first embodiment of the present invention.

FIG. 6 is a flowchart illustrating an example of an operation of a queue erasing unit according to the first embodiment of the present invention.

FIG. 7 is a flowchart illustrating an example of an operation of a queue reinitialization unit according to the first embodiment of the present invention.

FIG. 8 is a flowchart for explaining an example of the operation of the data registration means according to the first embodiment of the present invention.

FIG. 9 is a flowchart illustrating an example of an operation of a data extracting unit according to the first embodiment of the present invention.

FIG. 10 is a flowchart illustrating an example of an operation of a data reverse extracting unit according to the first embodiment of the present invention.

FIG. 11 is a diagram showing a configuration of a second exemplary embodiment of the present invention.

FIG. 12 is a diagram schematically illustrating a queue segment according to the second embodiment of the present invention.

FIG. 13 is a diagram illustrating an example of a queue control information unit according to the second embodiment of the present invention.

FIG. 14 is a flowchart illustrating an example of an operation of a queue re-initialization unit according to the second embodiment of the present invention.

FIG. 15 is a flowchart for explaining an example of the operation of the data registration means according to the second embodiment of the present invention.

FIG. 16 is a flowchart illustrating an example of an operation of a data extracting unit according to the second embodiment of the present invention.

FIG. 17 is a flowchart for explaining an example of the operation of a data reverse retrieval unit according to the second embodiment of the present invention.

FIG. 18 is a flowchart illustrating an example of an operation of a queue expansion unit according to the second embodiment of the present invention.

FIG. 19 is a flowchart illustrating an example of an operation of a queue degenerating unit according to the second embodiment of the present invention.

FIG. 20 is a diagram showing a configuration of a third exemplary embodiment of the present invention.

FIG. 21 is a diagram schematically illustrating a queue segment according to the third embodiment of the present invention.

FIG. 22 is a diagram illustrating an example of a queue control information unit according to the third embodiment of the present invention.

FIG. 23 is a flowchart for explaining an example of the operation of a queue stop unit according to the third embodiment of the present invention.

FIG. 24 is a flowchart illustrating an example of an operation of a data registration unit according to the third embodiment of the present invention.

FIG. 25 is a flowchart illustrating an example of an operation of a data extracting unit according to the third embodiment of the present invention.

FIG. 26 is a flowchart illustrating an example of an operation of a data reverse retrieval unit according to the third embodiment of the present invention.

FIG. 27 is a flowchart illustrating an example of the operation of a queuing unit according to the third embodiment of the present invention.

[Explanation of symbols]

100, 200, 300 Computer system 110, 210, 310 Queue control system 111, 211, 311 queue generating means 112, 212, 312 queue stopping means 113, 213, 313 Queue deleting means 114, 214, 314 queue re-initialization means 115,215,315 Data registration means 116, 216, 316 Data retrieval means 117, 217, 317 Data reverse retrieval means 118, 218, 318 queue exclusion means 219,319 Queue expansion means 220,320 Queue degeneration means 321 Means of meeting 130, 230, 330 queue segment 131, 231, 331 Queue control information section 132, 232, 332 Queue data section 140, 240, 340 User program

Claims (57)

[Claims] 1. A segment used as a queue,
A plurality of segments having a queue control information section for storing control information of a queue in the segment and a data section composed of entries in which data is registered are generated, and a circular link is set for each of the segments. A queue generating unit configured to set an initial value in a queue control information section of one of the plurality of linked segments (referred to as a “first segment”); At least a registration pointer and a retrieval pointer indicating a registration destination entry and a retrieval entry of the first segment; data registration means for registering data in an entry indicated by the registration pointer of the queue control information section of the first segment; Data to be retrieved from the entry pointed to by the retrieval pointer of the queue control information section of Queue control system for the extraction means, and a queue exclusion means for performing exclusive control of the queue, it is characterized. 2. The apparatus according to claim 1, further comprising a data reverse fetching means for fetching data from an entry immediately before an entry pointed to by a registration pointer of said queue control information section of said first segment. Queue control system. 3. A queue stopping means for stopping use of a queue and suppressing data registration and data retrieval after stopping use of the queue, and a queue deleting means for deleting a segment used as a queue. 3. The method according to claim 1, wherein
Queue control system as described. 4. A queue re-initializing means for re-initializing a queue control information section of a queue whose use has been suspended by said queue suspending means so that the queue can be used again. The queue control system according to claim 3. 5. If there is no empty entry at the time of data registration, a new segment to be used as a queue is generated,
5. The apparatus according to claim 1, further comprising queue expansion means for resetting a ring link between segments.
The queue control system according to any one of the above. 6. The apparatus according to claim 1, further comprising a queue degenerating means for deleting a segment that is not used at the time of extracting data and resetting a circular link between the segments. 2. The queue control system according to 1. 7. The data processing apparatus according to claim 1, further comprising a queuing unit that waits for the data to be taken out by another process to create a free entry when there is no free entry at the time of data registration. 2. The queue control system according to 1. 8. The apparatus according to claim 1, wherein said waiting means includes means for waiting for registration of data by another process when there is no data registered at the time of data retrieval. The queue control system according to any one of the above. 9. A segment used as a queue,
A plurality of segments having a queue control information section for storing control information of a queue in the segment and a data section composed of entries in which data is registered are generated, and a circular link is set for each of the segments. Setting an initial value in a queue control information section of one segment (referred to as “first segment”) of the plurality of linked segments, wherein the queue control information section of the first segment includes data of data. Registering at least a registration pointer and a retrieval pointer indicating a registration destination entry and a retrieval entry; and registering data in an entry indicated by the registration pointer in the queue control information section of the first segment; and queue control information of the first segment. Retrieving data from the entry pointed to by the retrieval pointer of the copy unit; Comprising the steps of exclusive control, a queue control method characterized by. 10. The queue control method according to claim 9, further comprising the step of extracting data from an entry immediately before an entry pointed to by a registration pointer of said queue control information section of said first segment. 11. The method according to claim 9, further comprising the steps of: stopping use of the queue to inhibit data registration and data retrieval thereafter; and erasing a segment used as the queue. 11. The queue control method according to item 10. 12. The queue control method according to claim 9, further comprising the step of re-initializing the stopped queue and making the queue usable again. 13. The queue control according to claim 9, further comprising a step of generating a new segment to be used as a queue when there is no empty entry at the time of data registration. Method. 14. The queue control method according to claim 9, further comprising a step of deleting a segment that is not used when data is taken out. 15. If there is no empty entry at the time of data registration, a step of waiting for data to be taken out by another process to create an empty entry, and that an entry is vacant for a process waiting for an empty entry at the time of data extraction. The queue control method according to any one of claims 9 to 14, further comprising the step of: 16. A process for waiting for registration of data by another process when there is no data registered at the time of data extraction, and a process for waiting for data registration at the time of data registration. The queue control method according to any one of claims 9 to 15, further comprising a step of notifying the registration and canceling the waiting. 17. A program for causing a computer to manage a queue, comprising: (a) a segment used as a queue, a queue control information section for storing queue control information in the segment, and data registered therein. A plurality of segments each having a data portion consisting of an entry, and setting a ring-like link to each of the segments, and forming one of the plurality of ring-linked segments (referred to as a “first segment”). A process of setting an initial value in a queue control information section, wherein the queue control information section of the first segment holds at least a registration pointer and a retrieval pointer indicating a data registration destination entry and a retrieval entry; A) registering data in the entry pointed to by the registration pointer in the queue control information section of the first segment; (C) a process of fetching data from the entry pointed to by the fetch pointer of the queue control information section of the first segment; and (d) a process of exclusively controlling the queue. And a program for causing the computer to execute the processing of (1). 18. The program according to claim 17, wherein
A program for causing the computer to further execute a process of extracting data from an entry immediately before an entry indicated by a registration pointer of the queue control information section of the first segment. 19. The program according to claim 17, wherein the processing for stopping the use of the queue and suppressing the subsequent data registration and data retrieval and the processing for erasing the segment used as the queue are performed. A program that causes the computer to execute further. 20. The program according to claim 17, wherein the computer further performs a process of reinitializing a queue control information portion of the queue whose use has been stopped and enabling the queue to be used again. The program to be executed. 21. A program according to any one of claims 17 to 20, wherein if there is no empty entry at the time of data registration, a process of generating a new segment to be used as a queue and re-establishing a link between segments is performed. A program for causing the computer to further execute. 22. The program according to claim 17, further comprising the step of causing said computer to further execute a process of deleting unused segments and re-establishing links between segments when data is taken out. Program. 23. A program according to claim 17, wherein when there is no empty entry at the time of data registration, a process of waiting for data to be taken out by another process to create an empty entry; A process for notifying a process waiting for an empty entry that the entry is free and canceling the waiting; and causing the computer to further execute the following. 24. The program according to claim 17, wherein when there is no data registered at the time of data extraction, a process of waiting for data to be registered by another process; And a process of notifying the process waiting for data registration that the data has been registered and canceling the waiting, and causing the computer to further execute the process. 25. A means for setting a status flag indicating a status of a queue in use after generating a ring-shaped link and initial setting a queue control information section of the first segment, Means for returning an address of the first segment to a program, wherein the user program registers and retrieves data, using the address as a key, for the data registering means and the data retrieving means, The queue control system according to any one of claims 1 to 8, wherein registration and retrieval of data are requested, respectively. 26. The information in which the first segment is set in the queue control information section, a registration pointer indicating an entry of a segment for registering data, an extraction pointer indicating an entry of a segment for extracting data, and registration in a queue. The remaining segment has link information consisting of the address of the next segment as information set in the queue control information section. The queue control system according to any one of claims 1 to 8, wherein: 27. The first segment as a queue control information section, a registration pointer indicating an entry of a segment for registering data, an extraction pointer indicating an entry of a segment for extracting data, and a In addition to the number and link information including the address of the next segment, in addition to the number of used segments currently used, the initial number of segments that is the initial value of the segment, the maximum number of segments indicating the maximum value of the segment, A queue for storing the exclusive semaphore used for the exclusive control of the queue, a notification semaphore for notification between processes, and a queue number for managing the number of queued processes; Only link information consisting of the address of the next segment is set in the control information section The queue control system according to any one of claims 1 to 8, wherein the control is performed. 28. The queue stopping means further comprises means for checking a status flag indicating a status of a queue, and setting the status flag to a stopped status when the status flag is in use. The queue control system according to any one of claims 3 to 8, wherein: 29. The queue erasing means checks a status flag indicating a status of a queue. If the status flag is in a stopped state, the queue deleting means deletes a queue segment used, and if the status flag is not in a stopped state. The queue control system according to any one of claims 3 to 8, further comprising means for controlling so as not to perform erasure. 30. The queue re-initializing means checks a status flag indicating a status of a queue, and if the status flag is in a stopped state, sets an initial value in a queue control information section of the first segment. The area for setting the initial value is limited to an area whose value is updated by use of the queue. When the state flag is set to “in use”, and when the state flag is not in the stop state, the queue is reinitialized. The queue control system according to any one of claims 4 to 8, further comprising means for controlling so as not to perform the conversion. 31. A means for checking whether the entry pointed to by the registration pointer of the queue control information section of the first segment is the last entry in the segment when the status flag indicating the status of the queue is in use. Means for setting the next registration pointer as the first entry of the next segment if the result of the check is the last entry, and setting the next registration pointer as the next entry after the entry pointed to by the registration pointer if not the last entry; Means for determining whether or not the next registration pointer matches the extraction pointer of the queue control information section; and if the result of the determination is that there is no match, no data entry is performed without any empty entry. Means for controlling transfer of registration data to an entry pointed to; queue control information of the first segment Means for setting the registration pointer of the section to an entry pointing to the next pointer;
The queue control system according to any one of claims 1 to 8, further comprising: means for adding. 32. The data fetching means, if a status flag indicating a queue status is being used, checks whether the number of data in the queue control information section of the first segment is a positive integer, If the number is a positive integer, means for acquiring data from the extraction pointer of the queue control information section of the first segment and subtracting one from the number of data; and when the entry from which the data is extracted is the last entry in the segment, The fetch pointer is the first of the next segment
Means for setting to point to an entry, and means for setting, when the entry from which data is fetched is not the last entry in the segment, the fetch pointer to point to the next entry. Item 9. The queue control system according to any one of Items 1 to 8. 33. The data reverse fetching means, when a status flag indicating a queue status is being used, checks the number of data in the queue control information section of the first segment, and the data number is a positive integer. If the entry pointed to by the registration pointer of the queue control information section of the first segment (referred to as “registration entry”) is not the first entry in the segment, the registration pointer is pointed to the entry immediately before the registration entry. Means for updating, when the registration entry is the first entry in a segment, means for finding a segment immediately before the segment pointed to by the registration pointer, and updating the registration pointer to point to the last entry of the segment; From the entry pointed to by the updated registration pointer to the data return area transmitted from the user program 9. A device according to claim 2, further comprising: means for transferring data; and means for subtracting 1 from the number of data in the queue control information section of the first segment. Queue control system. 34. When the entry pointed to by the registration pointer of the queue control information section of the first segment (referred to as a “registration entry”) is the last entry in the segment, the data registration means points to the segment pointed to by the registration pointer. If the next segment (referred to as “registered segment”) is the segment pointed to by the extraction pointer, and if the number of used segments is not more than the predetermined maximum number of segments even if it is increased by one, Means for controlling a queue to be extended by designating a registered segment, wherein the queue expanding means generates one new segment and re-creates the ring link so that the next segment of the registered segment becomes the generated segment. Set and add means to add 1 to the number of used segments. 9. The data registration means according to claim 5, wherein a new queue segment is added, and said data registration means sets a head entry of the added segment in a next registration pointer and performs an entry of registration data in a registration entry. The queue control system according to any one of the above. 35. When the entry pointed to by the retrieval pointer of the queue control information section of the first segment is the last entry in the segment, the data retrieval means updates the data retrieval pointer to point to the first entry of the next segment. At this time, if the segment pointed to by the registration pointer is not the segment from which the data was taken out (referred to as “fetched segment”), the fetched segment is not the one segment but the number of used segments of the queue control information section of the first segment. When the value obtained by subtracting one is equal to or greater than the initial segment number, the queue degeneration means includes means for designating a fetch segment and controlling the queue to be degenerated, and the queue degeneration means performs Erases a fetch segment and deletes the specified 8. The queue control system according to claim 6, further comprising means for resetting an annular link such that a previous segment of the segment points to a next segment. 36. The data reverse fetching means, wherein:
If the entry pointed to by the registration pointer of the queue control information section of the segment is the first entry in the segment, the registration pointer is updated so as to point to the last entry of the previous segment. At this time, the segment pointed to by the registration pointer before the update If the original segment is not the segment pointed to by the extraction pointer, the original segment is not the first segment, the queue has been expanded in the past, and the number of segments used in the queue control information section of the first segment is 8. When the value obtained by subtracting one is equal to or more than the initial number of segments, the queue degeneration means includes means for controlling the degeneration of the queue by designating the original segment. 2. The queue control system according to 1. 37. If the entry pointed to by the set next registration pointer is the same as the entry pointed to by the extraction pointer of the queue control information section of the first segment, the data registration means uses the queuing means. When another process retrieves data and waits for an empty entry, and when the waiting is released and an empty entry is created, the data registration unit re-executes the process from checking the status flag and registers the data. Wherein the first
When the number of queues in the queue control information section of the segment is greater than 0, the data registration unit notifies the notification semaphore of the queue control information section of the first segment and performs control to start the waiting process.
The queue control system according to claim 7, wherein: 38. The queuing means adds 1 to the number of queuing in the queue control information section of the first segment,
Release the exclusion of the queue by using the queue exclusion unit, wait for the notification semaphore of the queue control information section of the first segment, wait for the data registration unit, the data fetch unit, the data reverse fetch unit, and stop the queue. The queuing is canceled by a notification from at least one of the means, and thereafter, the queuing means excludes the queue by the queue exclusion means, and subtracts 1 from the number of queuing in the queue control information section of the first segment. The queue control system according to claim 7, wherein: 39. When the number of data in the queue control information section of the first segment is 0, the data fetching means waits for registration of data by another process using the queuing means, and the queuing is released. When the data is registered, the data retrieving means re-executes the process from checking the status flag, retrieves the data, and when the updating of the pointer is completed, the number of queues in the queue control information section of the first segment is reduced. 8. When the value is larger than 0, the data fetching unit notifies the notification semaphore of the queue control information section of the first segment and performs control for starting a waiting process. 2. The queue control system according to 1. 40. When the user program extracts data from the queue, the data reverse extracting means uses the queuing means when the number of data in the queue control information section of the first segment is 0. hand,
Waiting for registration of data by another process, when the waiting is canceled, that is, when the data is registered, the data reverse fetching means re-executes the processing from checking the status flag, and when the data fetching is completed, When the number of queues in the queue control information section of the first segment is greater than 0, the data reverse fetch unit notifies the notification semaphore of the queue control information section of the first segment to activate the waiting process. 8. The queue control system according to claim 7, wherein the control is performed. 41. An information processing apparatus comprising the queue control system according to any one of claims 1 to 8, 25 to 40. 42. A queue management system according to any one of claims 1 to 8, and 25 to 40, wherein the system uses a virtual storage system and manages segments of a computer that manages a virtual storage space by segmentation using queues. A queue control system, comprising: 43. In generating the queue, after initializing a queue control information section of the first segment, a status flag is set to “in use”, and a user program includes an address of the first segment in the user program. Returning, the user program uses the address as a key,
17. The queue control method according to claim 9, further comprising: requesting data registration and retrieval. 44. The first segment, as a queue control information section, includes a registration pointer indicating an entry of a segment for registering data, an extraction pointer indicating an entry of a segment for extracting data, the number of registered data, the number of segments, and The queue according to any one of claims 9 to 16, wherein the queue has link information consisting of a segment address, and the remaining segments have link information consisting of the address of the next segment as a queue control information section. Control method. 45. The first segment, as a queue control information section, includes a registration pointer indicating an entry of a segment for registering data, an extraction pointer indicating an entry of a segment for extracting data, and a In addition to the number and link information including the address of the next segment, in addition to the number of used segments currently used, the initial number of segments that is the initial value of the segment, the maximum number of segments indicating the maximum value of the segment, A queue for storing the exclusive semaphore used for the exclusive control of the queue, a notification semaphore for notification between processes, and a queue number for managing the number of queued processes; Only link information consisting of the address of the next segment is set in the control information section The queue control method according to claim 9, wherein the queue control is performed. 46. A method of stopping a queue, comprising checking a status flag indicating the status of the queue, and setting the status flag to a stopped status if the status is in use. 17. The queue control method according to any one of 9 to 16. 47. When erasing a queue, the method includes a step of checking a status flag indicating the status of the queue and, if the status is in a stopped state, erasing all segments of the queue being used. Claims 9 to 16
The queue control method according to any one of the above. 48. When re-initializing a queue, checking whether a status flag indicating the status of the queue is stopped, and if the status is stopped, the queue control information section of the first segment is initialized. Setting a value, wherein the area for setting the initial value is only an area for which the value is updated by use of a queue, and the step of setting the state flag to a use state. The queue control method according to any one of claims 9 to 16. 49. A step of checking whether a status flag indicating the status of a queue is in use when registering the data, and, if the status is in use, checking a registration pointer of a queue control information section of the first segment. Checking whether the entry pointed to is the last entry in the segment; if it is the last entry, setting the next registration pointer as the first entry of the next segment; otherwise, the entry pointed to by the next registration pointer to the next registration pointer And determining whether the next registration pointer matches the extraction pointer of the queue control information section of the first segment. If not, the registration data is stored in the entry pointed to by the registration pointer. Transferring the next registration pointer while the next registration pointer is Setting the registration pointer of the queue control information section of the first segment to an entry pointing to the next pointer without performing data registration when there is no empty entry if the extracted pointer matches the extraction pointer of the queue control information section of one segment; The number of data in the queue control information section of the first segment is 1
17. The queue control method according to claim 9, further comprising: adding. 50. A step of checking whether a status flag indicating the status of a queue is in use when extracting the data, and if the status is in use, the number of data in the queue control information section of the first segment is positive. Checking whether the number is an integer; acquiring the data from the extraction pointer of the queue control information section of the first segment when the number of data is a positive integer; and counting the number of data in the queue control information section of the first segment. 1
If the entry from which the data was retrieved is the last entry in the segment, the retrieval pointer is set to the first entry of the next segment.
17. The method of claim 9, further comprising: setting an entry to point to an entry; and, if not the last entry in the segment, setting the retrieval pointer to point to the next entry. 3. The queue control method according to 1. 51. A step of checking whether or not the status flag of the first segment is in use when performing the reverse extraction of the data; and, if the status is in use, determining whether the status flag of the first segment is in use. Checking the number of data; if the number of data is a positive integer, and if the entry pointed to by the registration pointer of the queue control information section of the first segment (referred to as “registration entry”) is not the first entry in the segment, Updating the registration pointer to point to the entry immediately before the entry; and if the registration entry is the first entry in the segment, find the segment immediately before the segment pointed to by the registration pointer, Updating the registration pointer to point to the entry; and Transferring the data from the entry to the data return area transmitted from the user program, and subtracting 1 from the number of data in the queue control information section of the first segment. A queue control method according to any one of claims 10 to 16. 52. In a data registration step when a user program registers data in a queue, an entry pointed to by a registration pointer of the queue control information section of the first segment (referred to as a “registration entry”) is a last entry in the segment. , The segment following the segment pointed to by the registration pointer (referred to as “registration segment”) is the segment pointed to by the extraction pointer of the queue control information section of the first segment, and the number of used segments is increased by one. Also, when the number of segments does not exceed a predetermined maximum number of segments, in the step of expanding the queue by specifying the registration segment, in the queue expansion step,
Create one new segment and make the next segment after the registered segment the generated segment.
Resetting the ring link, adding 1 to the number of used segments of the queue control information section of the first segment, and adding a new queue segment as the next segment of the registered segment; segment added to the next registered pointer Setting the first entry of the first segment, and if the next segment of the registered segment is not the segment pointed to by the extraction pointer, no new segment is generated, and the queue control information of the first segment is not generated. 17. The method according to claim 9, further comprising a step of controlling not to generate a new segment when a value obtained by adding 1 to the number of used segments of the copy is larger than the maximum number of segments. 13. The queue control method according to claim 1. 53. If the entry pointed to by the fetch pointer of the queue control information section of the first segment is the last entry in the segment in the data fetching step when the user program fetches data from the queue, the beginning of the next segment Updating the data fetch pointer to point to the entry, wherein if the segment pointed to by the registration pointer of the queue control information section of the first segment is not the segment from which the data was fetched (referred to as “fetch segment”), If the fetch segment is not the one segment and the number of used segments of the queue control information section of the first segment is not less than the initial number of segments of the queue control information section of the first segment even after subtracting one, the fetch segment Specify the queue The queue degeneration step comprises: erasing a fetch segment which is a specified segment, resetting a circular link so that a previous segment of the specified segment points to the next segment, and pointing to a registration pointer. When the segment is a fetch segment, when the fetch segment is the one segment, and when the value obtained by subtracting 1 from the number of used segments is smaller than the initial number of segments in the queue control information section of the first segment, 17. The queue control method according to claim 9, further comprising: controlling not to delete a segment. 54. In the data reverse fetch step when the user program fetches data from the queue in the LIFO (Last In First Out) format, the entry pointed to by the registration pointer of the queue control information section of the first segment is the If it is the first entry, the registration pointer is updated to point to the last entry of the previous segment, and the segment pointed to by the registration pointer before updating (called the “source segment”) is not the segment pointed to by the extraction pointer If the original segment is not the first segment, the queue has been expanded in the past, and the value obtained by subtracting 1 from the number of used segments in the queue control information section of the first segment is equal to or greater than the initial segment number, the queue degeneration step Degenerating the queue by specifying the source segment in the If the segment pointed to by the registration pointer before the new one (referred to as “source segment”) is the segment pointed to by the extraction pointer, the source segment is the first segment, and the segment used by the queue control information section of the first segment 17. The queue according to claim 10, further comprising: when the value obtained by subtracting 1 from the number is smaller than the initial number of segments, controlling to not delete the segment. Control method. 55. When the user program registers data in the queue, in the data registration step, the entry pointed to by the set next registration pointer is the same as the entry pointed to by the extraction pointer of the queue control information section of the first segment. In some cases, another process takes out data and waits for an empty entry. In the data registration step, the waiting is released,
When an empty entry is created, the process is executed again from the check of the status flag indicating the status of the queue. If the data is registered, if the number of queues in the queue control information section of the first segment is greater than 0, 17. The data registering step, comprising: notifying a notification semaphore of a queue control information section of the first segment, and starting a waiting process. A queue control method according to one of the preceding claims. 56. In the waiting step, the number of queues in the queue control information section of the first segment is set to 1
Is added to the queue, the exclusion of the queue is released, and the queuing is performed by the notification semaphore of the queue control information section of the first segment. 55. The queue control method according to claim 54, further comprising the step of: excluding the queue, and then subtracting 1 from the number of queues in the queue control information section of the first segment. 57. When the user program fetches data from the queue, in the data reverse fetching step, if the number of data in the queue control information section of the first segment is 0, registration of data by another process is performed. In the waiting step, when the waiting is canceled and the data is registered, in the data retrieving step, the step of re-executing the processing from the check of the status flag is performed. When the data retrieval is completed, the queue control of the first segment is performed. If the number of queues in the information section is greater than 0, the data reverse fetching step includes a step of notifying the notification semaphore of the queue control information section of the first segment to start a waiting process. A queue according to any one of claims 10 to 16, characterized in that: -Control method.