KR20000072461A - Method of operating a circular queue for low-speed storage device - Google Patents

Abstract

PURPOSE: A method of managing a circular queue is provided to improve a processing speed of a buffer consisting of a circular queue by reusing data which has been reproduced without accessing a low speed memory devices again. CONSTITUTION: The method comprises the steps of: determining whether or not a buffer consisting of a circular queue can be written with a new data; in case that the buffer is writable, reading a constant amount of data from a memory device to write in a position within the circular queue indicated by a writer pointer, and increasing the write pointer by the constant amount; determining whether or not the requested data is contained in a valid range, in case that there is a writing demand for a data positioned in a rear of a read pointer; and in case that the data is contained in the valid range, reading a data stored in the valid range, and setting a value of the read pointer to indicate a next position of a latest read data.

Description

METHOD OF OPERATING A CIRCULAR QUEUE FOR LOW-SPEED STORAGE DEVICE}

The present invention relates to a method of managing an annular queue buffer for a low speed storage device. More particularly, the present invention relates to a method of managing the data reproduction speed of an annular queue buffer when random accessing a low speed storage device storing compressed music data such as MP3. A method of managing an annular queue buffer for slow storage that can be improved.

In general, a storage device such as a CD-ROM or a hard disk is referred to as a low speed storage device because the access speed of reading or writing data is slow compared to a memory such as RAM. In addition, the access time varies greatly depending on the location where data is stored in the low speed storage device or the physical state of the stored area. In severe cases, physical damage can result in unreadable data.

Therefore, in a system that reads and processes data in such a low speed memory device, a predetermined amount of data is read in advance from the low speed memory device and stored in a buffer of a predetermined size of memory. Data access speed is slow because CD-ROM or hard disk is driven by motor drive, but buffer is composed of semiconductor memory such as RAM and is accessed through computer internal bus, so data access speed is much higher than auxiliary memory such as hard disk. fast. Therefore, it is possible to increase the data reproduction speed by directly accessing the buffer without having to access the low speed storage device whenever necessary, and solve the problem of the data processing speed caused by the difference in access time being not constant.

These buffers make up a queue. A queue is a data structure in which several data items are arranged in a certain order. There are two types of queues: linear queues, in which data items are read or written in one direction, and circular queues whose start and end points are connected to each other. Such linear or annular cues include a read pointer (RP) (or front pointer, hereinafter called a read pointer) and a write pointer (WP) (or rear pointer, Hereinafter referred to as the write pointer.

In general, when a large amount of data such as movie or music data is read from a low speed storage device and played back, the buffer capacity of the annular queue cannot be read all at once and stored in the annular queue. Therefore, only a part of the annular queue is stored in the annular queue, and the data stored in the annular queue is read and reproduced.

Fig. 1 is a block diagram showing the system configuration when a buffer is used in the middle for reproducing data from a conventional low speed storage device. According to this, the conventional system is composed of a low speed memory device 110, a buffer memory 120, a playback unit (reproduction program unit) 130, and a buffer management unit (buffer management program) 140. When the reproduction unit 130 sends a reproduction request signal to the buffer, the buffer management program 140 reads data from the buffer 120 and sends the data to the reproduction unit 130. The buffer management program 140 reads data from the low speed memory device 110 and writes the data to the buffer 120 when the buffer 120 is empty as much as the read data.

2 and 4 illustrate an example in which data is stored in the low speed memory device 110 when the predetermined amount of data d1-d7 or d8-d10 are sequentially accessed from the low speed memory device 110. . The annular queue 220 of FIG. 2 shows a case where the annular queue 220 is empty when the buffer size is seven. That is, the annular queue 220 has an address from 0 to 6. Initially (ie, when the buffer is empty), RP and WP both point to the starting point of annular queue 220 (RP = WP = 0). The two pointers initially start at the starting point and increase in value as read and write operations occur one by one to read data from the annular queue 220 (counterclockwise in FIG. 2; hereinafter referred to as 'rear'). Move. If a write or read occurs while the pointer is at the end of the queue, the pointer is reset to point back to the starting point. That is, if the write occurs when the pointer RP, WP is the end point (address 6 in the annular queue), WP = 0 and if the read occurs, RP = 0.

FIG. 3 shows the state of the annular queue 220 when d1-d7 data equal to the buffer size is read from the storage device 210 and the buffer is full. FIG. 5 shows the state of the annular queue 220 from the annular queue 220. It is the state of the annular queue 220 after reading, d2, d3. FIG. 6 shows a state of the annular queue 220 in the case where data of d8, d9, d10 are sequentially read from the storage device 210 and written to a buffer. Here, the read pointer has a position (address) value in the annular queue 220 of data to be read in the next playback, and the write pointer is previously used when writing data to the annular queue 220. It has a position (address) value in the annular queue 220 that was written last. That is, the data is written at the position of WP + 1 in the annular queue 220 at the next write.

Referring to FIG. 7, a conventional annular queue management method is described in detail. Initially, RP = WP = 0. First, data d1-d7 having a size corresponding to the buffer size are read from the low speed memory device 110 (step 713). Then, the above read data is written to the annular queue until the empty space of the annular queue is full, and the write pointer is increased by that amount (step 717). At this time, WP = 6 and RP = 0. As a result, the state of the annular queue 220 filled with data from d1 to d7 read out from the low speed storage device 110 is shown in FIG. At this time, it has a value of RP = WP + 1. (The maximum value is 6 when WP = 6, so a value greater than 1 is 0.)

When one piece of data is reproduced from the annular cue 220, the read pointer of the annular cue is increased by one, and the data item at the position is read. In other words, reading a certain amount of data from the annular queue increases the read pointer. If there is a reproduction request signal from the reproducing section 130, instead of reading the data d1, d2, d3 of a certain size from the low speed storage device 110, a predetermined size of data from the annular queue to d1-d3 is read and read by that much. Increment the read pointer (step 721). FIG. 5 shows the position in the annular queue 220 indicated by the write pointer and the read pointer in this case.

Then, when the annular queue is empty as much as it is read, the read data is sequentially read from the low-speed storage device 110 (step 723) and written to the annular queue, and the write pointer is increased by that amount (step 725). ). FIG. 6 illustrates a position indicated by a write pointer and a read pointer immediately after reading data from d8 to d10 from the low speed memory device 110 of FIG. 4 and storing them in the annular queue of FIG. .

This buffer management method is useful when reading data sequentially from the slow memory device 110. In general, a CD-ROM or a hard disk is driven by a motor drive, and data is sequentially stored in the disk rotation direction. By reading the data sequentially, you can read the data at the maximum speed of the storage device.

In particular, when reading compressed files such as MP3s, data is often randomly read back and forth rather than sequentially. In a sequential data read process, rereading data immediately after one byte breaks the sequential data access, resulting in longer data access time. The same is true for annular cues. In order to read the data reproduced once, the annular queue is already filled with new data read from the low speed storage device 210, and thus requires a long time since the data is read from the low speed storage device and the annular queue is filled again. That is, when data access occurs in a direction opposite to the rotation direction of the disk, according to the conventional buffer management method, data that has been reproduced at least once in the annular queue (for example, d1, d2, FIG. 5). d3) is replaced with new data (e.g., d8, d9, d10 in FIG. 6). In order to replay data that has been reproduced more than once (for example, d1, d2, and d3 in FIG. 5), the low speed storage device 110 needs to be accessed again, which takes a lot of data access time. That is, there is a problem that data reproduction becomes slow to be almost useless. Therefore, the conventional buffer management method when reading data while moving back and forth little by little instead of sequentially reading data from the low speed storage device, especially when reading data in a direction opposite to the rotational direction of the disk (hereinafter referred to as reverse direction). You will not get the performance you want. In particular, when playing compressed music data such as MP3, when the compressed data is randomly read back and forth by a prediction technique, there is a problem that the playback speed is lowered and the playback speed is not constant.

Accordingly, the present invention has been devised to solve the problems of the prior art, and when the slow storage device storing compressed music data such as MP3 is randomly accessed without being sequentially read back and forth, it is stored once and stored in an annular queue. It is an object of the present invention to provide a method of managing a buffer of annular queues that enables reuse of data that has never been accessed, thereby improving the processing speed of the buffer of annular queues.

BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a block diagram showing a system configuration when a buffer is used for reproducing data from a conventional low speed storage device.

2 is a diagram showing an example of an annular queue and an example of a low speed storage device when performing a primary read when sequentially accessing data in a sequential access mode.

FIG. 3 is a view showing an annular queue when a conventional annular queue is filled with data of a predetermined size read from the storage device of FIG. 2; FIG.

4 is a diagram illustrating an example of a low speed memory device when performing secondary read when sequentially accessing data in a sequential access mode.

5 and 6 are diagrams showing a state after a read and write operation of a conventional annular queue.

7 is a flow chart illustrating a method of operating an annular queue for a conventional slow memory device.

FIG. 8 illustrates an embodiment of a slow storage device in the case of accessing data in a backward direction in a random access mode in the method of managing an annular queue for a slow storage device according to an embodiment of the present invention. Figure shown.

9 to 11 are diagrams illustrating states after a read, write, and reproducing operation in the annular queue buffer management method for a low speed memory device according to an embodiment of the present invention;

12A is a flow chart illustrating the operation of an annular queue for a low speed memory device in accordance with the present invention.

FIG. 12B is a flow chart illustrating a processing procedure when a storage device access mode is not a backward random access mode in an operation of an annular queue for a slow storage device according to the present invention; FIG.

<Description of the symbols for the main parts of the drawings>

110: low speed memory device 120: buffer (memory)

130: playback unit (playback program) 140: buffer management unit (buffer management program)

210: storage device

220: annular cue

According to one preferred embodiment of the present invention for achieving the above objects, there is provided a method of managing an annular queue buffer for a slow memory device. In the method of managing the buffer of the annular queue, first, it is determined whether new data can be written among the annular queue buffers (in this case, it is determined that the buffer area set backward from the read pointer cannot be written). As a result of the writable determination, a certain amount of data is read from a memory device only in a writeable manner and written to a position in an annular queue indicated by the write pointer, and the write pointer is increased by the predetermined amount. Then, when there is a read request for data behind the read pointer, it is determined whether the requested data is included in the valid area (where the valid area includes the buffer area). In the case of data included in the valid region, the data stored in the valid region is read, and the read pointer value is set to point to the next position of the data read last.

In a preferred embodiment, the step of determining whether or not the write is possible may be determined as writable when the absolute value of the difference between the buffer size and the buffer area size is larger than the write pointer value, otherwise it may be determined as not writable. have.

In a preferred embodiment, determining whether the buffer is stored in the buffer region

The values indicating the addresses of the storage device stored in the buffer region and the address values of the data to be read from the storage device are compared with each other, and if the same values exist, they are determined to be stored. .

In a preferred embodiment, the effective region may be composed of the buffer region and an enlarged buffer region representing the buffer region to the rear just before the write pointer. That is, when the read pointer value is increased by reading data from the annular queue and the read pointer value is increased, the data read from the annular queue exists while the read pointer is increased in the buffer area of the predetermined size. It may further include a region. Alternatively, the effective area may be the same as the buffer area. That is, the size of the buffer area is determined by starting from the area where the data was last read as data was read from the annular queue even when the read pointer value was increased by reading data from the annular queue. Accordingly, an area equal to the predetermined buffer area size may be a fixed buffer area in a direction opposite to the direction in which data is read.

In a preferred embodiment, the size of the buffer region can be varied according to the type of data stored in the storage device, or can be automatically determined in consideration of information on the attribute of the data stored in the storage device. Alternatively, the size of the buffer region may be a constant value determined according to the type of data stored in the storage device.

The buffer management means of the annular queue according to another embodiment of the present invention is a means for judging whether new data can be written in the annular queue buffer, wherein it is determined that the buffer area set backward from the lead pointer cannot be written. And read only a certain amount of data from a memory device when the writable result is determined, and write it to a position in the annular queue indicated by the write pointer, and increase the write pointer by the predetermined amount. Buffering means and means for determining if the requested data is included in the valid area when there is a read request for data behind the read pointer, wherein the valid area includes the buffer area; and the valid area In the case of data contained in, the data stored in the valid area is And, it may comprise a reproduction means for setting to point to the next location of the data read by said read pointer (Read pointer) to the last value.

In a preferred embodiment, the size of the buffer region may vary depending on the type of data stored in the storage device, and may be a constant value predetermined according to the type of data stored in the storage device.

According to another embodiment of the present invention, there is provided a recording medium that can be read by a digital processing apparatus to perform a method of managing the annular queue buffer.

Best Mode for Carrying Out the Invention A preferred embodiment of the method for managing an annular queue buffer according to the present invention will be described in more detail with reference to the accompanying drawings.

8 to 12 illustrate a method of managing an annular queue buffer according to an embodiment of the present invention, in which data is written to or read from the annular queue when the backward data is accessed in the random access mode for the low speed storage device. The state of the time is shown. 12A and 12B are flowcharts for explaining the operation between the annular queue and the low speed storage device.

FIG. 8 is a view illustrating an embodiment in which data is stored in a low speed memory device in a method of managing an annular queue buffer according to an embodiment of the present invention when accessing data in a random access mode. FIG.

As shown in Fig. 9, the buffer of the annular queue according to the present invention has a write pointer, a read pointer, a valid data pointer and a buffer area. The role of the write pointer and read pointer has already been described. The present invention is characterized in that a buffer area A having a predetermined size is added to a conventional annular queue 220 between a read pointer and a write pointer. Conventionally, new data read from the storage device 210 is stored in all areas of the annular queue 220. However, according to the present invention, data that has been read from the annular queue 220 and reproduced by the reproduction request (hereinafter referred to as used data) is stored in an area (effective area) of a predetermined size of the annular queue 220. Here, the effective area is a broader concept that includes the buffer area (A). The size of the buffer area A may vary depending on the type of data stored in the memory device 210. In other words, when the data need to be read back and forth little by little without being sequentially read from the low speed storage device, the size of the buffer area A is increased, and when the data is read sequentially, the buffer area A is mostly Make the size smaller. For example, if the data stored in the storage device is an MP3 compressed file, it will be frequently read randomly back and forth by the prediction technique, so that the playback speed can be increased by increasing the size of the buffer area A. FIG.

The buffer area A is located between the read pointer and the valid data pointer. Initially, the valid data pointer is set to a value obtained by subtracting the size of the buffer area A from the read pointer. Thereafter, when the read pointer increases, the effective area may have the expansion buffer area B in addition to the buffer area A. FIG. As the data is read from the annular queue 220, the buffer area A is defined as an area having a predetermined buffer area size backward along the annular queue starting from the area where the data was last read. The region having a size corresponding to the increment of the read pointer value starting from the next position after the ending position is called the extended buffer region. That is, the effective area may be composed of the buffer area A and the expansion buffer area B as much as the size initially set.

The size of the buffer region A has a predetermined value. That is, it may have a constant value determined by the programmer or may be a variable value. For example, there may be a method of automatically determining the size of the buffer area in consideration of information (for example, whether it is a compressed file) of the attribute of data stored in the storage device. Alternatively, it may have a value selected by the user.

Referring to FIG. 8, before the slow memory device 210 performs backward random access to read d1, d2, and d3, it is checked whether there is data used in the annular queue 220, and there is data used therein. In the case (d1, d2, d3 in Fig. 9), the data d1, d2, d3 are read from the buffer area A directly and reproduced. When reading and playing data from the annular queue 220, the read pointer increases, so that the size of the effective area increases. In other words, the expansion buffer region B is added to the buffer region A. FIG.

Referring to FIG. 10, it shows a case where d4, d5, and d6 are read and reproduced from the annular cue 220, and it can be seen that the read pointer is increased by that amount. At this time, the write pointer and the valid data pointer remain unchanged. The size of the buffer area A is initially set according to the type of data stored in the low speed memory 210, and new data cannot be written in the buffer area A. FIG. However, new data can be written in an area other than the buffer area A (expansion buffer area B) of the effective areas.

Referring to FIG. 11, in the state of the annular queue 220 of FIG. 10, d8, d9, and d10 are read from the storage device 210, and are located next to the position indicated by the write pointer of the annular queue 220. The case where data d8, d9, d10 is written is shown. At this time, the write pointer and the valid data pointer increase together. 11, it can be seen that new data d8, d9 and d10 are not written in the minimum buffer area A, but are written in the remaining buffer area B. FIG. 11 shows the size of the buffer region A = And the annular cue 220 is full. That is, the size of the expansion buffer region is zero. In this case, unless the read pointer is increased by reproducing the data from the annular cue 220, data can no longer be written to the annular cue 220.

The write pointer and the valid data pointer may have different values at first, but once the data is filled in the annular queue 220 after one cycle, the write pointer and the valid data pointer have the same value. That is, the write pointer and the valid data pointer have the same value and increase together with each other. However, if an error occurs in the process of reading data from the storage device with different values at first, it cannot be written to the annular queue 220 and thus has a temporarily different value since the write pointer cannot be increased. Can be. In this case, arbitrary data (also known as garbage data) exists in an area between the write pointer and the valid data pointer. Data read later from the storage device 210 can be written to this area. Data in this area is called garbage data in that it cannot be read and reproduced. In another embodiment, the valid data pointer may be increased together with the read pointer.

12A and 12B illustrate an operation process of the annular queue according to the present invention. Initially, RP = WP = 0. First, a predetermined amount of data Di is read from the storage device 210 (step 1213), and the data Di is written into the buffer until the buffer is full, and the write pointer is increased by that amount (step 1215 and step 1217). ). Whether the buffer is full can be determined by whether RP = WP + 1. If the buffer is turned one cycle and the buffer is full of data, WP = VDP. In subsequent write operations, WP and VDP increase together. The playback program unit 130 then determines whether there is a playback request signal (step 1219), and if there is no playback request signal, it waits until the playback request signal comes. If there is a reproduction request signal, the annular queue 220 reads a certain amount of data Di 'and increases the read pointer RP by that amount (step 1221). Next, it is determined whether the storage device 210 access mode is a backward random access mode (step 1223 to step 1227). That is, when data is sequentially read from the storage device 210 and data is read in a direction opposite to the disk rotation direction, the memory device 210 enters a backward random access mode. As a result of the determination, step 1233 of FIG. 12B is executed in case of no backward random access mode (sequential access or forward random access), and step 1227 is executed in case of backward random access. do. In operation 1227, it is determined whether data to be randomly accessed is included in the used data in the annular queue 220. The values indicating the addresses of the storage device stored in the valid area and the address values of the data to be read from the storage device are compared with each other to determine that the same values are included. If the same values do not exist, they are determined not to be included. If it is not determined, step 1233 is performed. If included, the used data of the annular queue 220 is read out and played back (step 1229) without directly accessing the storage device, and then the step 1219 is repeated by checking whether there is a play request signal.

FIG. 12B illustrates the processing when the storage device access mode is not the backward random access mode in the operation of the annular queue for the slow storage device according to the present invention.

In step 1233, when the data Di 'read from the annular queue 220 is within the valid area, it is determined whether there is a free space (extended buffer area) except for the buffer area A in this area. For example, if free space exists, RP-WP > Should be the size of the buffer zone (A). If it is determined that there is no free space, the process returns to step 1231 of FIG. 12A and is performed. If there is free space, read the maximum amount of data di + 1 from the storage device (step 1235), write the data Di + 1 to the free space in the annular queue 220, and increase the write pointer WP by that amount. (Step 1237), the process returns to step 1231.

In the above, the memory device 210 means a low speed memory device, but it does not mean that the memory device of the semiconductor memory cannot be used. In addition, the present invention can be applied to a method of managing a buffer with an annular queue, but the present invention is not limited thereto. For example, the present invention can be applied not only to playback of still images such as JPEG and moving images such as MPEG1, but also to reproduction of compressed music data such as RA and MP4. If random access occurs without sequentially reading data from the memory device 210, any type of data may be applied as well as compressed data.

Although the above has been described with reference to a preferred embodiment of the present invention, those skilled in the art to which the present invention pertains without departing from the spirit and scope of the present invention as set forth in the claims below It will be appreciated that modifications and variations can be made.

According to the present invention, a method of managing a buffer having an annular queue for a low speed memory device is a slow storage method for data that has been reproduced after being stored in the annular queue once when the slow memory device is randomly accessed in the reverse direction instead of being sequentially read. By reading directly from the annular queue 220 without accessing the device to enable reuse, the data reproduction speed is significantly improved.

In addition, the present invention by varying the size of the buffer area (A) of the annular queue 220 according to the type of data stored in the low-speed memory device 210, the data reproduction speed can be improved as much as possible in consideration of the data characteristics There is also.

In addition, when the present invention is applied to a reproduction program developed on the basis of a semiconductor memory as a storage device from the beginning, it is possible to utilize a much cheaper and larger-capacity low-speed memory device as a data storage space without using an existing reproduction program without modification. It also works.

Claims (27)

In the circular queue buffer management method, Determining whether new data can be written among the buffers of the annular queue, wherein the buffer area preset from the read pointer to the rear is determined to be impossible to write; A buffering step of reading a predetermined amount of data from a memory device only when the writable result is determined, and writing it to a position in an annular queue indicated by the write pointer, and increasing the write pointer by the predetermined amount; ; If there is a read request for data behind the lead pointer, determining whether the requested data is included in the valid area, wherein the valid area includes the buffer area; And In the case of data included in the valid region, reading the data stored in the valid region, and setting the read pointer value to point to a next position of the data read last; Method of managing a buffer of the annular queue comprising a. The method of claim 1, The step of determining whether the write is possible And determining that the absolute value of the difference between the buffer size and the buffer area size is larger than the write pointer value, that the buffer is writeable; otherwise, the buffer is not writable. Way. The method of claim 2, Determining whether it is included in the effective area Comparing the values indicating the addresses of the storage device stored in the valid region with the address values of the data to be read from the storage device, and determining that they are included if they have the same value; A method of managing a buffer consisting of an annular queue. The method of claim 3, The effective area is And a buffer queue having a circular queue. The method of claim 3, The effective area is The buffer region; And And an enlarged buffer region which shows a rearward buffer from the buffer region to just before the write pointer. The method of claim 1, The size of the buffer zone A method of managing a buffer having an annular queue, the variable being variable depending on the type of data stored in the storage device. The method of claim 1, The size of the buffer zone A method for managing a buffer with an annular queue, characterized in that the size of the buffer area is automatically determined in consideration of information on attributes of data stored in the storage device. The method of claim 1, The size of the buffer zone A method of managing a buffer with an annular queue, the constant value being determined according to the type of data stored in the storage device. In the buffer management means of the annular queue, Means for determining whether new data can be written out of the buffer of the annular queue, wherein the buffer area set backward from the lead pointer is determined to be impossible to write; Buffering means for reading a certain amount of data from a memory device only when the writable result is determined, and writing it to a position in the annular queue indicated by the write pointer, and increasing the write pointer by the predetermined amount. ; Means for determining if the requested data is included in the valid area when there is a read request for data behind the lead pointer, wherein the valid area includes the buffer area; And Reproducing means for reading data stored in the valid area and setting the read pointer value to point to the next position of the data read last when the data is included in the valid area; And a buffer management means having an annular queue. The method of claim 9, The means for determining whether the write is possible And determining that the absolute value of the difference between the buffer size and the buffer area size is larger than the write pointer value, that the data is writeable; otherwise, the buffer is not writable. Way. The method of claim 10, Means for determining whether it is included in the effective area Comparing the values indicating the addresses of the storage device stored in the valid region with the address values of the data to be read from the storage device, and determining that they are included if they have the same value; Means for managing a buffer of the annular queue, characterized in that. The method of claim 11, The effective area is The buffer region; And And an enlarged buffer region which shows a rearward buffer region from the buffer region to the rear immediately before the write pointer. The method of claim 9, The size of the buffer zone 15. A buffer management means as an annular queue for a storage device, characterized in that it is variable depending on the type of data stored in the storage device. The method of claim 9, The size of the buffer zone A buffer management means comprising an annular queue for a storage device, characterized in that it is a constant value determined according to the type of data stored in the storage device. A recording medium that can be read by a digital processing device to perform a method of managing an annular queue buffer, The circular queue buffer management method Determining whether new data can be written among the buffers of the annular queue, wherein the buffer area preset from the read pointer to the rear is determined to be impossible to write; A buffering step of reading a predetermined amount of data from a memory device only when the writable result is determined, and writing it to a position in an annular queue indicated by the write pointer, and increasing the write pointer by the predetermined amount; ; If there is a read request for data behind the lead pointer, determining whether the requested data is included in the valid area, wherein the valid area includes the buffer area; And In the case of data included in the valid region, reading the data stored in the valid region, and setting the read pointer value to point to a next position of the data read last; Recording medium comprising a. The method of claim 15, The step of determining whether the write is possible And determining that the absolute value of the difference between the buffer size and the buffer area size is larger than the write pointer value, that the data is writeable; The method of claim 15, Determining whether it is included in the effective area Comparing the values indicating the addresses of the storage device stored in the valid region with the address values of the data to be read from the storage device, and determining that they are included if they have the same value; And a recording medium. The method of claim 15, The size of the buffer zone It is possible to vary according to the type of data stored in the storage device Recording media. The method of claim 15, The size of the buffer zone And a constant value determined according to the type of data stored in the storage device. In the circular queue buffer management method, Determining whether new data can be written among the buffers of the annular queue, wherein the buffer area preset from the read pointer to the rear is determined to be impossible to write; If there is a read request for data behind the lead pointer, determining whether the requested data is included in the valid area, wherein the valid area includes the buffer area; And In the case of data included in the valid region, reading and outputting the data Method of managing a buffer of the annular queue comprising a. The method of claim 20, The step of determining whether the write is possible And determining that the absolute value of the difference between the buffer size and the buffer area size is larger than the write pointer value, that the buffer is writeable; otherwise, the buffer is not writable. Way. The method of claim 21, Determining whether it is included in the effective area Comparing the values indicating the addresses of the storage device stored in the valid region with the address values of the data to be read from the storage device, and determining that they are included if they have the same value; A method of managing a buffer consisting of an annular queue. The method of claim 22, The effective area is And a buffer queue having a circular queue. The method of claim 23, wherein The effective area is The buffer region; And And an enlarged buffer region which shows a rearward buffer from the buffer region to just before the write pointer. The method of claim 23, wherein The size of the buffer zone A method of managing a buffer having an annular queue, the variable being variable depending on the type of data stored in the storage device. The method of claim 1, The size of the buffer zone A method for managing a buffer with an annular queue, characterized in that the size of the buffer area is automatically determined in consideration of information on attributes of data stored in the storage device. The size of the buffer zone A method of managing a buffer with an annular queue, the constant value being determined according to the type of data stored in the storage device.