JP5379075B2 - Data input / output device, data storage method and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To suppress increase in storage capacity for storing data, achieve data first-in first-out for each data series, and re-output output data. <P>SOLUTION: A data input-output device can receive two or more data inputs that belong to any of two or more data series one by one, output received data for each two or more data series by a data first-in first-out method, and re-output output data. The data input-output device includes two or more storage areas and a controller. When data belonging to the same data series as the received data are not stored, the controller stores the data in one of empty storage areas where no data is stored, sets the empty storage area as a leading storage area in the data series, and reads out and output data from the leading storage area in the data series to be output. When receiving reception confirmation for output data, the controller sets the storage area where the data is stored as an empty leading storage area. <P>COPYRIGHT: (C)2012,JPO&amp;INPIT

Description

  The present invention relates to a data input / output device, a data storage method, and a program capable of re-outputting output data.

  In order to input / output data while ensuring high reliability, the data output source must re-output the data if the data output destination cannot confirm that the data has been correctly received. .

  On the other hand, each of a plurality of data belonging to any one of a plurality of low-speed and non-isochronous data series is stored until a predetermined data amount is reached for each data series, and the stored data can be quickly processed at a time. In order to perform processing, it is necessary to realize first-in first-out data for each of a plurality of data series.

  FIG. 16 is a diagram for explaining a configuration of a data input / output device that realizes first-in first-out data for each of a plurality of data series and can re-output the output data.

  The input buffer 114 receives input of a plurality of data one by one. Each of the plurality of data received by the input buffer 114 belongs to one of a plurality of data series. A series number for identifying a data series is assigned to each of the plurality of data.

  Each of the queues 112-1 to 112-n is fixedly associated with each of the plurality of data series, and stores each of the plurality of data received by the input buffer 114 for each data series. For example, if the number of data series is N, N queues are required.

  Each of the re-output queues 113-1 to 113-n is fixedly associated with each of a plurality of data series in the same manner as the queue, and the data output from each of the queues 112-1 to 112-n , Until a predetermined condition is satisfied. The predetermined condition is, for example, a case where a reception confirmation indicating that the data has been received is received from the data output destination. Similarly to the queue, for example, if the number of data series is N, N re-output queues are required.

  The control unit 111 extracts the sequence number assigned to each of the plurality of data received by the input buffer 114, and among the queues 112-1 to 112-n, the queue corresponding to the data sequence of the extracted sequence number To store the data. Then, the control unit 111 reads and outputs the data stored in the queue corresponding to the data series to be output among the queues 112-1 to 112-n. And the control part 111 is until the predetermined conditions as mentioned above are satisfied in the re-output queue corresponding to the data series to which the output data belongs among the re-output queues 113-1 to 113-n. Store the output data.

  A technique related to data re-output is disclosed in Non-Patent Document 1, for example.

http://www.atmarkit.co.jp/fwin2k/network/baswinlan014/baswinlan014_03.html

  As described above, in the data input / output device as shown in FIG. 16, first-in first-out of data is realized for each data series, and a plurality of queues and re-outputs are provided to enable re-output of the output data. Each of the use queues is fixedly associated with each of the plurality of data series.

  At this time, for example, even if the data belonging to one data series occupies most of the accepted data under a predetermined condition, the data belonging to the data series is associated with another data series. It cannot be stored in the queue.

  Further, even after the output of data stored in a queue associated with a certain data series is completed, data belonging to another data series cannot be stored in that queue.

  Similarly, even when it becomes unnecessary to store the data stored in the re-output queue associated with a certain data series, it is possible to store data belonging to other data series in the re-output queue. Can not.

  In this case, there is a problem that the storage capacity necessary for storing data increases as the number of data series increases.

  The present invention provides a data input / output device, a data storage method, and a program capable of realizing first-in first-out data for each data series and re-outputting output data while suppressing an increase in storage capacity for storing data The purpose is to provide.

In order to achieve the above object, a data input / output device according to the present invention receives input of a plurality of data belonging to one of a plurality of data series one by one, and the received data is a first-in first-out method for each of the plurality of data series And a data input / output device capable of re-outputting the output data,
A plurality of storage areas for storing the received plurality of data one by one;
A control unit for managing input / output of data to / from the plurality of storage areas,
The controller is
For each data series, a head number table that stores a head number indicating the order in which data to be output next in the data series is received, and for each data series, re-outputtable data belonging to the data series Among them, a re-outputtable number table that stores a re-outputtable number indicating the order in which the earliest received data is received is set, and a storage area in which the data is not stored among the plurality of storage areas Set as free storage space,
When data belonging to the same data series as the received data is not stored in the plurality of storage areas, the data is stored in one of the storage areas set as the free storage area, and the storage area is Set as the first storage area in which data received first in the data series is stored, and the first number and the re-outputtable number stored in the first number table and the re-outputtable number table of the data series, respectively Set to 1 ,
When data belonging to the same data series as the received data is stored in the plurality of storage areas, a storage area in which the data received immediately before the data in the data series is stored, and the free storage area Is associated with one of the storage areas set as, and the data is stored in the storage area,
Among the plurality of data series, data is read from the storage area set as the top storage area in the data series to be output, and the top number extracted from the top number table of the data series is assigned. Output and set the storage area associated with the storage area as the new start storage area in the data series, and add 1 to the start number stored in the start number table of the data series ,
When receiving a reception confirmation indicating receipt of the previous SL output data, and sets the storage area where the data is stored as the free memory space, is stored in the re-output can number table of the data series The re-outputtable number is updated with the head number stored in the head number table of the data series .

In order to achieve the above object, the data storage method of the present invention has a plurality of storage areas, accepts input of a plurality of data belonging to any of a plurality of data series, one by one, Data storage method in a data input / output device capable of storing data one by one in the plurality of storage areas, outputting the stored data in a first-in first-out manner for each of the plurality of data series, and re-outputting the output data Because
For each data series, a head number table that stores a head number indicating the order in which data to be output next in the data series is received, and for each data series, re-outputtable data belonging to the data series Among them, a re-outputtable number table that stores a re-outputtable number indicating the order in which the earliest received data is received is set, and a storage area in which the data is not stored among the plurality of storage areas Processing to set as free storage area;
When data belonging to the same data series as the received data is not stored in the plurality of storage areas, the data is stored in one of the storage areas set as the free storage area, and the storage area is Set as the first storage area in which data received first in the data series is stored, and the first number and the re-outputtable number stored in the first number table and the re-outputtable number table of the data series, respectively Processing to set to 1 ,
When data belonging to the same data series as the received data is stored in the plurality of storage areas, a storage area in which the data received immediately before the data in the data series is stored, and the free storage area A process of associating with one of the storage areas set as and storing the data in the storage area;
Among the plurality of data series, data is read from the storage area set as the top storage area in the data series to be output, and the top number extracted from the top number table of the data series is assigned. Processing to output,
A process of setting a storage area associated with the storage area as a new start storage area in the data series and adding 1 to the start number stored in the start number table of the data series ;
When a reception confirmation indicating that the output data has been received is received, a storage area in which the data is stored is set as the free storage area and is stored in the re-outputtable number table of the data series And a process of updating the re-outputtable number with the head number stored in the head number table of the data series .

In order to achieve the above object, the program of the present invention has a plurality of storage areas, accepts input of a plurality of data belonging to any of a plurality of data series one by one, and accepts the received plurality of data. Each of the plurality of storage areas is stored one by one, the stored data is output in a first-in first-out manner for each of the plurality of data series, and the output data is re-outputted to a computer,
For each data series, a head number table that stores a head number indicating the order in which data to be output next in the data series is received, and for each data series, re-outputtable data belonging to the data series Among them, a re-outputtable number table that stores a re-outputtable number indicating the order in which the earliest received data is received is set, and a storage area in which the data is not stored among the plurality of storage areas A function to set as a free storage area,
When data belonging to the same data series as the received data is not stored in the plurality of storage areas, the data is stored in one of the storage areas set as the free storage area, and the storage area is Set as the first storage area in which data received first in the data series is stored, and the first number and the re-outputtable number stored in the first number table and the re-outputtable number table of the data series, respectively The function set to 1 ,
When data belonging to the same data series as the received data is stored in the plurality of storage areas, a storage area in which the data received immediately before the data in the data series is stored, and the free storage area A function of associating one of the storage areas set as and storing the data in the storage area;
Among the plurality of data series, data is read from the storage area set as the top storage area in the data series to be output, and the top number extracted from the top number table of the data series is assigned. A function to output,
A function of setting a storage area associated with the storage area as a new start storage area in the data series and adding 1 to the start number stored in the start number table of the data series ;
When a reception confirmation indicating that the output data has been received is received, a storage area in which the data is stored is set as the free storage area and is stored in the re-outputtable number table of the data series And a function of updating the re-outputtable number with the head number stored in the head number table of the data series .

  Since the present invention is configured as described above, in order to realize first-in first-out data for each data series, and to enable re-output of the output data, each of a plurality of data series and a plurality of queues and There is no need to permanently associate each of the re-output queues.

  Therefore, it is possible to realize first-in first-out data for each data series and re-output the output data while suppressing an increase in storage capacity for storing data.

It is a block diagram which shows the structure of one Embodiment of the data input / output device of this invention. It is a figure which shows an example of the correspondence between the pointer list memory and data memory which were shown in FIG. It is a figure which shows an example of the correspondence between the pointer list memory and head pointer table shown in FIG. It is a figure for demonstrating an example of the correspondence between the pointer list memory shown in FIG. 1, and a tail pointer table | surface. It is a figure which shows the other example of the correspondence between the pointer list memory and data memory which were shown in FIG. FIG. 2 is a diagram showing an example of a state when the data memory shown in FIG. 1 is initialized, (a) shows a pointer list memory, (b) shows a re-outputtable pointer table, a re-outputtable number table, and The figure which shows a head number table, (c) is a figure which shows a head pointer table and a tail pointer table. 3 is a flowchart for explaining an operation of storing data in the data input / output device shown in FIG. 1. FIG. 7 is a diagram illustrating an example of a state after the state illustrated in FIG. 6, where (a) illustrates a pointer list memory, and (b) illustrates a re-outputtable pointer table, a re-outputable number table, and a head number table. FIG. 4C is a diagram showing a head pointer table and a tail pointer table. FIG. 9 is a diagram illustrating an example of a state after the state illustrated in FIG. 8, where (a) illustrates a pointer list memory, and (b) illustrates a re-outputtable pointer table, a re-outputable number table, and a head number table. FIG. 4C is a diagram showing a head pointer table and a tail pointer table. FIG. 10 is a diagram illustrating an example of a state after the state illustrated in FIG. 9, where (a) illustrates a pointer list memory, and (b) illustrates a re-outputable pointer table, a re-outputable number table, and a head number table. FIG. 4C is a diagram showing a head pointer table and a tail pointer table. 2 is a flowchart for explaining an operation of outputting stored data in the data input / output device shown in FIG. 1. FIG. 11 is a diagram illustrating an example of a state after the state illustrated in FIG. 10, where (a) illustrates a pointer list memory, and (b) illustrates a re-outputable pointer table, a re-outputable number table, and a head number table. FIG. 4C is a diagram showing a head pointer table and a tail pointer table. 2 is a flowchart for explaining the operation of the data input / output device shown in FIG. 1, (a) is a flowchart showing an operation when reception confirmation is accepted, and (b) is an operation when reception confirmation is not accepted. It is a flowchart. FIG. 13 is a diagram illustrating an example of a state after the state illustrated in FIG. 12, where (a) illustrates a pointer list memory, and (b) illustrates a re-outputtable pointer table, a re-outputable number table, and a head number table. FIG. 4C is a diagram showing a head pointer table and a tail pointer table. FIG. 13 is a diagram showing another example of the state after the state shown in FIG. 12, (a) shows a pointer list memory, and (b) shows a re-outputable pointer table, a re-outputable number table, and a head number table. (C) is a figure which shows a head pointer table and a tail pointer table. It is a figure for demonstrating the structure of the data input / output device which implement | achieves data first-in first-out for every several data series, and can re-output the output data.

  Embodiments of the present invention will be described below with reference to the drawings.

  FIG. 1 is a block diagram showing a configuration of an embodiment of a data input / output device of the present invention.

  As shown in FIG. 1, the data input / output device 10 of this embodiment includes a control unit 11, a data memory 12, an input buffer 13, a pointer list memory 14, a head pointer table 51, a tail pointer table 52, A head number table 53, a re-outputtable pointer table 54, and a re-outputtable number table 55 are provided.

  The input buffer 13 receives a plurality of data inputs one by one. Each of the plurality of data received by the input buffer 13 belongs to one of a plurality of data series. A series number for identifying a data series is assigned to each of the plurality of data. Here, the sequence number is an integer of 1 or more.

  The data memory 12 is composed of a plurality of continuous storage areas having a predetermined length.

  The control unit 11 uses the pointer list memory 14, the head pointer table 51 and the tail pointer table 52, and inputs them to a free storage area that is a storage area in which no data is stored among the plurality of storage areas of the data memory 12. Each of the plurality of data received by the buffer 13 is stored (written). Further, the control unit 11 uses the pointer list memory 14, the head pointer table 51 and the tail pointer table 52, and among the data stored in each of the plurality of storage areas of the data memory 12, Read and output data. In addition, when the control unit 11 receives a reception confirmation indicating that the output data has been received from the output destination of the data, the setting contents of the re-outputable pointer table 54 and the like according to the content indicated by the received reception confirmation Update. On the other hand, when the reception confirmation is not accepted, the control unit 11 performs an operation for re-outputting the data. Details of the operation in which the control unit 11 stores data in a plurality of storage areas of the data memory 12 and the operation of reading and outputting the stored data will be described in an operation flow described later. Details of the operation when the control unit 11 accepts reception confirmation and when it does not accept will also be described in the operation flow described later.

  Here, the correspondence between the pointer list memory 14 and the data memory 12 shown in FIG. 1 will be described.

  FIG. 2 is a diagram illustrating an example of a correspondence relationship between the pointer list memory 14 and the data memory 12 illustrated in FIG.

  The correspondence between the data memory 12 and the pointer list memory 14 exists for each sequence number. FIG. 2 shows the correspondence in one certain sequence number. In the pointer list memory 14, a heading for identifying the sequence number is provided. In FIG. 2, black circles in the figure represent headings for identifying the sequence numbers.

  The data memory 12 and the pointer list memory 14 are a plurality of storage areas of the data memory 12 by using a function f (x) in which one value is determined for one x from the address a of the pointer list memory 14. There is a correspondence relationship that a pointer f (a) specifying any of the above is obtained.

  That is, each address of the pointer list memory 14 and each of the plurality of storage areas of the data memory 12 are associated with each other on a one-to-one basis. Note that the pointer f (a) is, for example, the start address of one of the plurality of storage areas of the data memory 12. Further, as an example of the function f (x), there is a function of multiplying x by 256 (shifting by 8 bits).

  In FIG. 2, for example, the address “0100” of the pointer list memory 14 is associated with the storage area having the head address “010000” among the plurality of storage areas of the data memory 12.

  In addition, as shown in FIG. 2, a value is stored in each address of the pointer list memory 14. When the value stored in the address a of the pointer list memory 14 is b, the data stored in the storage area specified by f (a) is the same as the data stored in the storage area specified by f (b). This is data received before the data belonging to the data series and stored in the storage area specified by f (b). That is, the received data and the data that belongs to the data series to which the data belongs and are received immediately before the data are associated by the pointer list memory 14.

  In FIG. 2, the data stored at the address “0100” of the pointer list memory 14 is “0120”. Here, when the values obtained by using the function f (x) from “0100” and “0120” are “010000” and “012000”, they are stored in the storage area of the data memory 12 with “010000” as the head address. The received data belongs to the same data series as the data stored in the storage area having “012000” as the start address of the data memory 12 and is data received immediately before the data.

  As described above, in the pointer list memory 14, pointers that specify the storage areas in which data is stored in the data memory 12 form a chain (one-way list) for each of a plurality of data series.

  The value stored at the address corresponding to the storage area in which the data received last in each of the plurality of data series is a special value indicating the end of data in the data series. The value is “END”.

  In the above description, the function f (x) is used to associate the address of the pointer list memory 14 with each of the plurality of storage areas of the data memory 12 on a one-to-one basis. However, if the address of the pointer list memory 14 and each of the plurality of storage areas of the data memory 12 are associated one-to-one, the function f (x) is not necessarily used.

  Next, the correspondence between the pointer list memory 14 and the head pointer table 51 and the tail pointer table 52 will be described.

  First, the correspondence between the pointer list memory 14 and the head pointer table 51 will be described.

  FIG. 3 is a diagram showing an example of a correspondence relationship between the pointer list memory 14 and the leading pointer table 51 shown in FIG.

  The head pointer table 51 has a heading for identifying the sequence number. In FIG. 3, black circles and black triangles in the figure represent headings.

  The head pointer table 51 stores a value indicating the address of the pointer list memory 14 of the data series of the series number identified by the heading. The values on the right side of the black circles and black triangles in FIG. 3 indicate the addresses of the pointer list memory 14 in the data series of the relevant series number. Hereinafter, this value is referred to as the value of the head pointer. The value of the head pointer indicates an address corresponding to the head storage area that is the storage area of the data memory 12 in which the first received data is stored in the data sequence of the sequence number.

  For the data series in which no data is stored in the plurality of storage areas of the data memory 12, the value of the head pointer assumes a special value “empty”.

  Next, the correspondence between the pointer list memory 14 and the tail pointer table 52 memory will be described.

  FIG. 4 is a diagram for explaining an example of the correspondence between the pointer list memory 14 and the end pointer table 52 shown in FIG.

  In the tail pointer table 52, as in the head pointer table 51, a heading for identifying the sequence number is provided. In FIG. 4, black circles and black triangles in the figure represent headings.

  Similar to the head pointer table 51, the tail pointer table 52 stores a value indicating the address of the pointer list memory 14 of the data series of the series number identified by the heading. The values on the right side of the black circle and black triangle in the diagram of FIG. 4 indicate the address of the pointer list memory 14 in the data series of the series number. Hereinafter, this value is referred to as a tail pointer value. The value of the tail pointer indicates an address corresponding to the storage area of the data memory 12 in which the data received last in the data series having the series number is stored.

  For a data series in which no data is stored in a plurality of storage areas of the data memory 12, the value of the tail pointer is assumed to be a special value “empty”, similar to the value of the head pointer.

  Here, as described above, the storage area in which data is stored among the plurality of storage areas of the data memory 12 is associated with the address of the pointer list memory 14. Therefore, the control unit 11 can recognize the data stored in the data memory for each data series. However, if a free storage area cannot be specified among the plurality of storage areas of the data memory 12, the control unit 11 may store the data received by the input buffer 13 in any storage area of the data memory 12. I don't know how.

  FIG. 5 is a diagram showing another example of the correspondence relationship between the pointer list memory 14 and the data memory 12 shown in FIG.

  In the pointer list memory 14 shown in FIG. 5, the address and storage area of the pointer list memory 14 are associated with each other as in the pointer list memory 14 for each data series shown in FIG. However, in FIG. 5, the address of the pointer memory is associated with the free storage area among the plurality of storage areas of the data memory 12. The pointers that specify the free storage area form a chain (one-way list).

  Hereinafter, it is assumed that data with sequence number 0 is stored in the free storage area, and the data sequence with sequence number 0 is referred to as a free sequence.

  Note that the address of the pointer list memory 14 is associated with a storage area in which data belonging to an empty sequence (sequence number 0) is stored, and data belonging to any data sequence (sequence number 1 to) is stored. Corresponding to the storage area is an exclusive event. Therefore, it is not necessary to prepare a pointer list memory separately for the empty series.

  Also, the values of the head pointer and tail pointer of the empty series can be stored in the head pointer table 51 and tail pointer table 52 shown in FIGS.

  Next, the re-outputtable pointer table 54, the head number table 53, and the re-outputtable number table 55 shown in FIG. 1 will be described.

  The re-outputable pointer table 54 has the same configuration as the head pointer table shown in FIG. 3 and the tail pointer table shown in FIG. Therefore, although not shown here, the re-outputtable pointer table 54 stores a value indicating the address of the pointer list memory 14 of the data series of the series number identified by the heading. Hereinafter, this value is referred to as a re-outputtable pointer value. The value of the re-outputtable pointer is a pointer list corresponding to the storage area of the data memory 12 in which the data received earliest in the input buffer 13 among the re-outputtable data belonging to the data sequence of the sequence number is stored. The address of the memory 14 is shown.

  The head number table 53 stores a value for each sequence number. This value indicates the order in which the data output next in the data sequence of the sequence number is received by the input buffer 13. Therefore, the head number is an integer of 1 or more.

  In the re-outputtable number table 55, a value is stored for each sequence number. This value indicates the order in which the data received earliest in the input buffer 13 among the re-outputtable data belonging to the data sequence of the sequence number is received. Therefore, the re-output possible number is an integer of 1 or more.

  Hereinafter, the operation of the data input / output device 10 configured as described above will be described.

  First, the operation of storing data in the data input / output device 10 will be described. Before that, the state when the data memory 12 is initialized will be described.

  6 is a diagram showing an example of a state when the data memory 12 shown in FIG. 1 is initialized. (A) is a diagram showing the pointer list memory 14, and (b) is a re-outputtable pointer table 54. FIG. 5C is a diagram showing a re-outputtable number table 55 and a head number table 53, and FIG. 5C is a diagram showing a head pointer table 51 and a tail pointer table 52. Here, the number of data series is eight, and the series number of each data series is 0-7. The data series with sequence number 0 is an empty series as described above.

  Immediately after the data memory 12 is initialized, no data is stored in the plurality of storage areas of the data memory 12. That is, it is considered that data of sequence number 0 is stored in all of the plurality of storage areas.

Therefore, the control unit 11 chains all the addresses in the pointer list memory 14 so as to form a single list. For example, as shown in FIG. 6A, this can be realized by setting values stored in all addresses of the pointer list memory 14 to values indicating the next address. This can be expressed in pseudo code as follows.
# for (i = 0; i ++; i <(n-1)) L (i) = i + 1;
# L (n-1) = END
In the above pseudo code, i indicates the address of the pointer list memory 14, and L (i) indicates the value stored at the address i of the pointer list memory 14. The same applies to the following description.

Further, the control unit 11 sets the first address of the pointer list memory 14 in the head pointer table 51 as the value of the head pointer of the empty series (sequence number 0). Here, as shown in FIG. 6C, “0” is set in the head pointer table 51 as the value of the head pointer of the empty series. Further, the control unit 11 sets the last address of the pointer list memory 14 in the tail pointer table 52 as the value of the tail pointer of the empty series. Here, as shown in FIG. 6C, “7” is set in the tail pointer table 52 as the value of the tail pointer of the empty series. These are shown in pseudo code as follows. In the pseudo code shown below, P_head (j) is the value of the start pointer of sequence number j, and P_tail (j) is the value of the end pointer of sequence number j. The same applies to the following description.
# P_head (0) = 0;
# P_tail (0) = n-1;
Further, the control unit 11 sets “empty” in the head pointer table 51 and the tail pointer table 52 as the values of the head pointer and tail pointer of the data series (sequence numbers 1 to 7) other than the empty series. This is shown in pseudo code as follows.
# for (j = 1; j ++; j <n) P_head (j) = empty;
# for (j = 1; j ++; i <n) P_tail (j) = empty;
Further, the control unit 11 sets the values of all data series (sequence numbers 0 to 7) to special values “null” in the re-outputtable pointer table 54, the re-outputtable number table 55, and the head number table 53. To do.

  Next, an operation for storing data in the data input / output device 10 will be described. Here, it is assumed that a plurality of data are not input simultaneously. The length of the data need not be constant, but for the sake of simplicity, the length of the data is constant, and each of the storage areas of the data memory has the same length as the data. It is assumed that

  FIG. 7 is a flowchart for explaining an operation of storing data in data input / output device 10 shown in FIG. Here, a case will be described in which the first data belonging to the data sequence of sequence number 1 is received after the state shown in FIG.

  First, the input buffer 13 receives data input (step S1).

  The control unit 11 extracts the sequence number j given to the data received in step S1 (step S2). Here, “1” is extracted.

  Next, the control unit 11 obtains the value of the tail pointer (P_tail (j)) of the extracted sequence number j from the tail pointer table 52 (step S3). Here, since “empty” is extracted, it can be seen that data of sequence number 1 is not stored in the data memory 12.

  Next, the control unit 11 updates the value of the head pointer of the extracted sequence number j to the value of the head pointer of the empty sequence (step S4). Here, the value of the head pointer of sequence number 1 is updated from “empty” to “0”. That is, the storage area corresponding to the address of the pointer list memory 14 indicated by the free sequence head pointer is set as the head storage area in the data series of sequence number 1.

  Next, the control unit 11 updates the value of the end pointer of the extracted sequence number j to the value of the start pointer of the empty sequence (step S5). Here, the value of the tail pointer of sequence number 1 is updated from “empty” to “0”.

  Next, the control unit 11 extracts the value stored at the address of the pointer list memory 14 indicated by the value of the head pointer of the empty series (step S6). Here, “1” is extracted.

  Next, the control unit 11 updates the value stored at the address of the pointer list memory 14 indicated by the value of the free sequence head pointer to “END” (step S7).

  Next, the control unit 11 updates the value of the free sequence head pointer to the value extracted in step S6 (step S8). Here, the value of the leading pointer of the empty sequence is changed from “0” to “1”.

  Next, the control unit 11 updates the value of the re-outputtable pointer of the extracted sequence number j with the value of the head pointer of the sequence number j (step S9). Here, the value of the sequence number 1 re-outputtable pointer is updated from “null” to “0”.

  And the control part 11 updates the re-outputtable number and head number of the extracted sequence number j (step S10). Here, the re-outputtable number of sequence number 1 and the leading number are updated from “null” to “1”. This is because the data received in step S1 is the first data received in the data sequence of sequence number 1.

The operations in steps S4, S9, and S10 described above are represented by pseudo code as follows. In the pseudo code shown below, P_ret (j) is the value of the re-outputtable pointer of sequence number j. S_head (j) is the leading number of sequence number j, and S_ret (j) is the re-outputtable number of sequence number j. The same applies to the following description.
j = 1
P_head (j) = 0 / * P_head (0) * /
P_ret (j) = 0 / * P_head (0) * /
S_head (j) = 1
S_ret (j) = 1
Then, the control unit 11 stores the data received in step S1 in the storage area of the data memory 12 corresponding to the address indicated by the value of the tail pointer of the extracted sequence number j among the plurality of storage areas of the data memory 12. Store (step S11). Here, data of sequence number 1 is stored in the storage area of the data memory 12 corresponding to address 0 of the pointer list memory 14.

  FIG. 8 is a diagram illustrating an example of a state after the state illustrated in FIG. 6, where (a) illustrates the pointer list memory 14, and (b) illustrates the re-outputable pointer table 54 and the re-outputable number table. 55 is a diagram showing the head number table 53 and (c) is a diagram showing the head pointer table 51 and the tail pointer table 52. FIG. 8 shows a state after the state shown in FIG. 6 and after the operation described with reference to FIG. 7 is performed.

  As shown in FIG. 8C, the values of the head pointer and tail pointer of the sequence number 1 are both “0”. Further, in the head pointer table 51, the value of the head pointer of the empty series is “1”, indicating the address 1 of the pointer list memory 14. In the pointer list memory 14, as shown in FIG. 8A, the value stored at address 0 is "END". Further, as shown in FIG. 8B, the value of the sequence number 1 re-outputtable pointer is “0”, which is the same as the value of the sequence number 1 head pointer. The numbers are both “1”.

  FIG. 9 is a diagram illustrating an example of a state after the state illustrated in FIG. 8, where (a) illustrates the pointer list memory 14, and (b) illustrates the re-outputable pointer table 54 and the re-outputable number table. 55 is a diagram showing the head number table 53 and (c) is a diagram showing the head pointer table 51 and the tail pointer table 52. FIG. FIG. 9 shows a state when the first data of sequence number 2 is stored after the state shown in FIG. 8, and then the storage of the second data of sequence number 1 is stored.

  Comparing FIG. 8 with FIG. 9, the value of the head pointer of sequence number 1 remains “0” and has not changed. Further, as shown in FIG. 9B, the leading number of sequence number 1 remains “1” and does not change. This is because none of the data of sequence number 1 has been output yet.

In the state shown in FIG. 9, since the first data of the sequence number 2 is stored, the value of the head pointer of the sequence number 2 is updated from “empty” to “1”. Therefore, the value of the sequence number 2 re-outputtable pointer is also updated from “null” to “1”. Further, the re-outputtable number and the leading number of the sequence number 2 are also updated from “null to“ 1. ”These updates are executed by the control unit 11, but are represented in pseudo code as follows: Become.
j = 2
P_head (j) = 1 / * P_head (0) * /
P_ret (j) = 1 / * P_head (0) * /
S_head (j) = 1
S_ret (j) = 1
FIG. 10 is a diagram illustrating an example of a state after the state illustrated in FIG. 9, (a) is a diagram illustrating the pointer list memory 14, and (b) is a reprintable pointer table 54, a reprintable number table. 55 is a diagram showing the head number table 53 and (c) is a diagram showing the head pointer table 51 and the tail pointer table 52. FIG. FIG. 10 shows a state when the first data of sequence number 5 is stored after the state shown in FIG.

Comparing FIG. 9 and FIG. 10, since the first data of the sequence number 5 is stored in the state shown in FIG. 10, the value of the first pointer of the sequence number 5 is updated from “empty” to “3”. Has been. Therefore, the value of the sequence number 5 re-outputtable pointer is also updated from “null” to “3”. In addition, the re-outputtable number and the leading number of the sequence number 5 are updated from “null to“ 1 ”. These updates are executed by the control unit 11, but are expressed in pseudo code as follows: Become.
j = 5
P_head (j) = 3 / * P_head (0) * /
P_ret (j) = 3 / * P_head (0) * /
S_head (j) = 1
S_ret (j) = 1
Next, an operation of outputting stored data in the data input / output device 10 will be described. Here, assuming that the data series to be output is determined separately, here, the operation when data of series number 1 is output from the state shown in FIG. 10 will be described.

  FIG. 11 is a flowchart for explaining an operation of outputting stored data in data input / output device 10 shown in FIG.

  The control unit 11 extracts the value of the head pointer of the sequence number j of the data sequence to be output (step S21). Here, the value of the head pointer of sequence number 1 is extracted. As shown in FIG. 10C, the value of the head pointer of sequence number 1 is “0”. Therefore, “0” is extracted here.

  Next, the control unit 11 extracts the top number of the sequence number j (step S22). Here, “1” is extracted.

  Next, the control part 11 reads the data memorize | stored in the memory area corresponding to the address of the pointer list memory 14 which the value extracted in step S21 shows (step S23). Here, data is read from the storage area corresponding to address 0 of the pointer list memory 14 among the plurality of storage areas of the data memory 12.

  Next, the control unit 11 assigns the sequence number j to the data read in step S23 as the sequence number with the head number extracted in step S22. The sequence number is a number for the data output destination to recognize the data order. Here, “1” is assigned as the sequence number, and “1” is assigned as the sequence number.

  And the control part 11 outputs the data provided with the sequence number and the sequence number j (step S24).

  Next, the control unit 11 updates the value of the head pointer of the sequence number j to the value stored at the address indicated by the value extracted in step S21 (step S25). Here, the value of the head pointer of sequence number 1 is updated from “0” to “2”. That is, the storage area corresponding to the address 2 of the pointer list memory 14 is set as a new head storage area in the data series of series number 1.

  And the control part 11 updates the head number of the said sequence number j (step S26). Here, the leading number of sequence number 1 is updated from “1” to “2”.

  As described above, when data is output, the value of the start pointer and the start number are updated, but the value of the re-outputtable pointer and the re-outputtable number are not updated.

Of the operations for outputting the data described above, the update of the value of the start pointer, the value of the re-outputtable pointer, the start number, and the re-outputtable number is represented by pseudo code as follows.
j = 1
P_head (j) = 2 / * L (P_head (j)) * /
S_head (j) = 2 / * 1 ++ * /
/ * Do not update P_ret (j) * /
/ * Do not update S_ret (j) * /
FIG. 12 is a diagram illustrating an example of a state after the state illustrated in FIG. 10, where (a) illustrates the pointer list memory 14, and (b) illustrates the re-outputable pointer table 54 and the re-outputable number table. 55 is a diagram showing the head number table 53 and (c) is a diagram showing the head pointer table 51 and the tail pointer table 52. FIG. FIG. 12 shows a state after the state shown in FIG. 10 and after the operation described with reference to FIG. 11 is performed.

  Comparing FIG. 10 with FIG. 12, it can be seen that the value of the head pointer of sequence number 1 and the head number are updated.

  Next, an operation when the data input / output device 10 accepts reception confirmation of the output data and an operation when it does not accept will be described.

  FIG. 13 is a flowchart for explaining the operation of the data input / output device 10 shown in FIG. 1, (a) is a flowchart showing the operation when reception confirmation is accepted, and (b) does not accept reception confirmation. It is a flowchart which shows operation | movement in the case.

  First, with reference to FIG. 13A, a case will be described in which reception confirmation for output data is received after the state shown in FIG. A series number is assigned to the reception confirmation.

  The control unit 11 extracts the sequence number j given to the received reception confirmation (step S41). Since the data output in the state of FIG. 12 is data of sequence number 1, “1” is extracted here.

  Next, the control unit 11 extracts the value of the re-outputtable pointer of the extracted data sequence of the sequence number j (step S42). Here, “0” is extracted.

  Next, the control unit 11 updates the value stored at the address indicated by the value extracted in step S42 to “END” (step S43). Here, the value stored at address 0 of the pointer list memory 14 is updated from “2” to “END”.

  Next, the control unit 11 updates the value stored at the address indicated by the value of the end pointer of the empty sequence from “END” to the value extracted in step S42 (step S44). Here, the value stored at address 7 of the pointer list memory is updated from “END” to “0”.

  Next, the control unit 11 updates the value of the end pointer of the empty series with the value extracted in step S42 (step S45). Here, the value of the end pointer of the empty series is updated from “7” to “0”.

  Next, the control unit 11 updates the value of the re-printable pointer of the sequence number j with the extracted value of the start pointer of the sequence number j (step S46). Here, the value of the re-outputtable pointer of sequence number 1 is updated from “0” to “2”.

  And the control part 11 updates the re-output possible number of the said sequence number j with the head number of the extracted sequence number j (step S47). Here, the re-outputtable number of sequence number 1 is updated from “1” to “2”.

  Through the above-described operation, the storage area corresponding to address 0 of the pointer list memory 14 is set as an empty storage area.

Of the above-described operations, the operations of step S46 and step S47 are expressed in pseudo code as follows.
j = 1
P_ret (j) = P_head (j)
S_ret (j) = S_head (j)
FIG. 14 is a diagram illustrating an example of a state after the state illustrated in FIG. 12, (a) is a diagram illustrating the pointer list memory 14, and (b) is a reprintable pointer table 54, a reprintable number table. 55 is a diagram showing the head number table 53 and (c) is a diagram showing the head pointer table 51 and the tail pointer table 52. FIG. FIG. 14 shows a state after the operation shown in FIG. 13A is performed after the state shown in FIG.

  Comparing FIG. 12 and FIG. 14, it can be seen that the value of the re-printable pointer of sequence number 1 and the re-printable number are updated. It can also be seen that the value of the end pointer of the empty series has been updated.

  Next, with reference to FIG. 13B, a case where the reception confirmation of the output data is not accepted after the state shown in FIG. 12 will be described. The case where the reception confirmation of the output data is not accepted is, for example, the case where the reception confirmation is not accepted even after a predetermined time has elapsed after the output of the data. In this case, the control unit 11 includes a timer, and when the data is output, activates the timer. Then, when the elapsed time of the timer reaches a predetermined time, the control unit 11 determines that “reception confirmation is not accepted”.

  The control unit 11 updates the value of the start pointer of the sequence number j with the value of the re-outputtable pointer of the sequence number j of the data sequence to which the output data belongs (step S61). Since the data output in the state of FIG. 12 is data of sequence number 1, the value of the head pointer of sequence number 1 is updated from “2” to “0” here. As a result, the storage area corresponding to the address 0 of the pointer list memory 14 is set as a new head storage area in the data series of series number 1.

  And the control part 11 updates the head number of the said sequence number with the re-outputtable number of the said sequence number (step S62). Here, the leading number of sequence number 1 is changed from “2” to “1”.

The operations in steps S62 and S63 described above are expressed in pseudo code as follows.
j = 1
P_head (j) = P_ret (j)
S_head (j) = S_ret (j)
FIG. 15 is a diagram illustrating another example of the state after the state illustrated in FIG. 12, (a) is a diagram illustrating the pointer list memory 14, and (b) is a re-outputtable pointer table 54, re-output is possible. The figure which shows the number table 55 and the head number table 53, (c) is a figure which shows the head pointer table 51 and the tail pointer table 52. FIG. 15 shows a state after the operation shown in FIG. 13B is performed after the state shown in FIG.

  Comparing FIG. 12 and FIG. 15, it can be seen that the value of the head pointer and the head number of sequence number 1 are updated. It can also be seen that the value of the first pointer of sequence number 1 has been updated.

  Note that, when the kth data received by the input buffer 13 in the data sequence of the sequence number j is output again, whether or not the data is stored in the data memory 12 depends on the re-outputtable number of the sequence number j It is sufficient to check whether k is included between the first number and the first number.

  In the operation flow described with reference to FIG. 13B, the value of the head pointer is updated with the value of the re-outputtable pointer. In other words, when re-outputting data belonging to the data sequence of sequence number j, it is assumed that all data that can be re-output in the data sequence of sequence number j is re-output.

  Here, consider a case where only the data received after the k-th in the input buffer 13 in the data series of the series number j is re-output. This assumes a case where the control unit 11 receives a reception confirmation to which a received number indicating (k-1) is given together with the sequence number j. The received number is a number corresponding to the sequence number assigned when the control unit 11 outputs data. For example, when the data input / output device 10 outputs a plurality of data, when the output destination of the data receives up to the data assigned with the sequence number (k-1), the data Output the reception confirmation with (k-1) as the received number.

When the control unit 11 accepts the reception confirmation assigned (k-1) as the received number, the control unit 11 performs an operation represented by the following pseudo code. Note that the following pseudo code represents the case of the data sequence of sequence number 1.
j = 1;
S_head (j) = k;
P = P_ret (j);
for (t; t <(k-S_ret (j)); t ++) P = L (P);
P_head (j) = P;
P_ret (j) = P;
S_ret (j) = k;
When the control unit 11 outputs five data assigned 1 to 5 as sequence numbers in the sequence number 1, and then the control unit 11 accepts a reception confirmation assigned 1 to 3 as received numbers (k = The above pseudo code will be described by taking 4) as an example. In this case, immediately before the control unit 11 accepts the reception confirmation, the re-outputtable number (S_ret (j)) of the sequence number 1 is “1”.

  First, the control unit 11 sets the top number of sequence number 1 to “4”.

  Next, the control unit 11 sets the value of the re-outputtable pointer of sequence number 1 as “P” and sets the value stored at the address of the pointer list memory 14 indicated by “P” as a new “P”. Repeat this twice. The reason for repeating twice is that the difference between k and S_ret (j) is 3.

  Then, the control unit 11 sets the value of the first pointer of sequence number 1 and the value of the re-outputtable pointer as P after the above repetition. Further, the control unit 11 sets the re-outputtable number of sequence number 1 to 4.

  As a result, the storage area in which the data received in the input buffer 13 in the data sequence of sequence number 1 is stored is set as a new head storage region in the data sequence of sequence number 1.

  As described above, in this embodiment, when the data series to which the received data belongs is not stored in the data memory 12, the data is stored in one of the free storage areas, and the storage area It is set as the first storage area in which data received first in the data series is stored. On the other hand, when data of the data series to which the received data belongs is stored in the data memory 12, a storage area in which the data received immediately before the data in the data series is stored, and an empty storage area The data is stored in the empty storage area.

  The data is read from the storage area set as the first storage area in the data series to be output among the plurality of data series and output, and the storage area associated with the storage area is the data series Is set as a new head storage area. Thereafter, when a reception confirmation indicating that the output data has been received is received, the storage area in which the data is stored is set as a free storage area.

  As a result, first-in first-out of data is realized for each data series, and in order to enable re-output of the output data, each of the plurality of data series and each of the plurality of queues and each of the re-output queues are fixed. There is no need to associate it.

  In addition, even if it is necessary to re-output a large amount of data in an arbitrary data series, it is possible to cope with it by simply rewriting a small number of variables such as the head pointer table. It becomes possible to prepare.

  In the present embodiment, the case where the pointer list memory 14 and the data memory 12 are mounted as separate memories has been described, but these may be mounted in combination in one memory.

  In the present invention, the processing in the data input / output device is not realized by the dedicated hardware described above, but a program for realizing the function is recorded on a recording medium readable by the data input / output device. The program may be recorded, and the program recorded on the recording medium may be read by the data input / output device and executed. The recording medium readable by the data input / output device refers to a transfer medium such as a flexible disk, a magneto-optical disk, a DVD, and a CD, as well as an HDD incorporated in the data input / output device. It is also possible to provide the program recorded on this recording medium via a network.

DESCRIPTION OF SYMBOLS 10 Data input / output device 11 Control part 12 Data memory 13 Input buffer 14 Pointer list memory 51 First pointer table 52 Last pointer table 53 First number table 54 Re-outputtable pointer table 55 Re-outputable number table

Claims (5)

Data input / output that accepts input of a plurality of data belonging to one of a plurality of data series one by one, outputs the accepted data in a first-in first-out manner for each of the plurality of data series, and re-outputs the output data A device,
A plurality of storage areas for storing the received plurality of data one by one;
A control unit for managing input / output of data to / from the plurality of storage areas,
The controller is
For each data series, a head number table that stores a head number indicating the order in which data to be output next in the data series is received, and for each data series, re-outputtable data belonging to the data series Among them, a re-outputtable number table that stores a re-outputtable number indicating the order in which the earliest received data is received is set, and a storage area in which the data is not stored among the plurality of storage areas Set as free storage space,
When data belonging to the same data series as the received data is not stored in the plurality of storage areas, the data is stored in one of the storage areas set as the free storage area, and the storage area is Set as the first storage area in which data received first in the data series is stored, and the first number and the re-outputtable number stored in the first number table and the re-outputtable number table of the data series, respectively Set to 1 ,
When data belonging to the same data series as the received data is stored in the plurality of storage areas, a storage area in which the data received immediately before the data in the data series is stored, and the free storage area Is associated with one of the storage areas set as, and the data is stored in the storage area,
Among the plurality of data series, data is read from the storage area set as the top storage area in the data series to be output, and the top number extracted from the top number table of the data series is assigned. Output and set the storage area associated with the storage area as the new start storage area in the data series, and add 1 to the start number stored in the start number table of the data series ,
When receiving a reception confirmation indicating receipt of the previous SL output data, and sets the storage area where the data is stored as the free memory space, is stored in the re-output can number table of the data series The data input / output device updates the re-outputtable number with the head number stored in the head number table of the data series . The data input / output device according to claim 1,
The controller is
When the reception confirmation is not accepted, the storage area in which the data is stored is set as the new head storage area in the data series to which the data belongs, and the head stored in the head number table of the data series A data input / output device that updates a number with the re-outputtable number stored in the re-outputtable number table of the data series . It has a plurality of storage areas, receives input of a plurality of data belonging to any of a plurality of data series one by one, stores the received plurality of data one by one in the plurality of storage areas, and stores the stored data A data storage method in a data input / output device capable of outputting the output data in a first-in first-out manner for each of the plurality of data series and re-outputting the output data,
For each data series, a head number table that stores a head number indicating the order in which data to be output next in the data series is received, and for each data series, re-outputtable data belonging to the data series Among them, a re-outputtable number table that stores a re-outputtable number indicating the order in which the earliest received data is received is set, and a storage area in which the data is not stored among the plurality of storage areas Processing to set as free storage area;
When data belonging to the same data series as the received data is not stored in the plurality of storage areas, the data is stored in one of the storage areas set as the free storage area, and the storage area is Set as the first storage area in which data received first in the data series is stored, and the first number and the re-outputtable number stored in the first number table and the re-outputtable number table of the data series, respectively Processing to set to 1 ,
When data belonging to the same data series as the received data is stored in the plurality of storage areas, a storage area in which the data received immediately before the data in the data series is stored, and the free storage area A process of associating with one of the storage areas set as and storing the data in the storage area;
Among the plurality of data series, data is read from the storage area set as the top storage area in the data series to be output, and the top number extracted from the top number table of the data series is assigned. Processing to output,
A process of setting a storage area associated with the storage area as a new start storage area in the data series and adding 1 to the start number stored in the start number table of the data series ;
When a reception confirmation indicating that the output data has been received is received, a storage area in which the data is stored is set as the free storage area and is stored in the re-outputtable number table of the data series Updating the re-outputtable number with the head number stored in the head number table of the data series . The data storage method according to claim 3,
When the reception confirmation is not accepted, the storage area in which the data is stored is set as the new head storage area in the data series to which the data belongs, and the head stored in the head number table of the data series A data storage method further comprising a process of updating a number with the re-outputtable number stored in the re-outputtable number table of the data series .   It has a plurality of storage areas, receives input of a plurality of data belonging to any of a plurality of data series one by one, stores the received plurality of data one by one in the plurality of storage areas, and stores the stored data A program for causing a computer capable of outputting the output data in a first-in first-out manner for each of the plurality of data series and re-outputting the output data as a data input / output device according to claim 1.

Images