KR100734826B1 - Method and system for transfering asynchronous data using a shared file - Google Patents

Abstract

Disclosed are a method and system for asynchronous data transfer using a shared file. Record data to be delivered to at least one system in a shared file, and create and manage a shared information file for each system that includes information about the shared file delivered to each system, based on the shared information file Identify and delete shared files that have completed data delivery to the system. This allows asynchronous transfer of data between systems.

Description

Asynchronous data transfer method and system using a shared file {Method and system for transfering asynchronous data using a shared file}

1 is a diagram showing the structure of an asynchronous data delivery system according to the present invention;

2A illustrates the structure of a shared file according to the present invention;

2B is a diagram showing the structure of a shared information file according to the present invention;

3 is a flowchart illustrating a flow of an asynchronous data transfer method according to the present invention.

The present invention relates to a data transfer method between systems, and more particularly, to a method and a system for asynchronously transferring data between systems using an Internet protocol such as TCP, UDP.

The data transmission method between systems using the conventional Internet protocol requires synchronization between the sender and the receiver. Therefore, there is a problem in that when the speed of the work on the sending side and the receiving side is different, it is limited by the speed of the slow processing speed of the work on the fast side.

Korean Laid-Open Patent Publication No. 2003-0048619 discloses a shared data prefetch method using a global lock pattern in a shared file system. This is about prefetching data from a shared file system. Specifically, in a shared file system used by multiple hosts, it analyzes the global lock pattern for transactions handled by the host's file system calls, thereby analyzing the shared data from the host. When a request comes in, the global lock pattern is stored and the host selects the shared data to be requested in advance so that the shared data can be received from the disk or another host and processed. In other words, the present invention relates to providing a pre-fetched shared data by identifying a global lock pattern in a shared file system.

SUMMARY OF THE INVENTION The present invention provides an asynchronous data transfer method and a method for operating each system irrespective of differences in processing speeds of a receiving system and a sending system by transferring data asynchronously using a shared file. To provide a system.

In order to achieve the above technical problem, an embodiment of the asynchronous data transfer method according to the present invention, recording the data to be delivered to at least one or more systems in a shared file; Creating and managing a shared information file for each of the systems, the shared information file including information about the shared file delivered to each of the systems; And identifying and deleting the shared file of which data transfer is completed to the respective systems based on the shared information file.

In order to achieve the above technical problem, an embodiment of the asynchronous data delivery system according to the present invention records each data to be transferred to each shared file having a sequential name according to the generation order of the shared file. A shared file recorder for managing a shared information file including information about the shared file being recorded; A shared file receiving unit configured to read the shared file and manage a shared information file including information about the shared file; And a shared file deletion unit for identifying and deleting the shared file having completed data transfer to the respective systems based on the shared information file.

This allows asynchronous transfer of data between systems.

Hereinafter, with reference to the accompanying drawings will be described in detail with respect to the asynchronous data transfer method between systems using the shared file and the system according to the present invention.

1 is a diagram showing the structure of an asynchronous data transfer system according to the present invention.

Referring to FIG. 1, a system 100, 102, 104 for transferring data writes data to a shared file 130, 132, 134 to be transferred to a shared storage device between systems such as a storage area network (SAN) or a NAS. The system 110 and 112 receiving the data receive the data by reading the data recorded in the shared files 130, 132, and 134 stored in the shared storage device. There are one system 100, 102, 104 for transmitting data, but a plurality of systems 110, 112 for receiving data may exist.

If the size of a shared file grows larger than a certain amount, there is a limit in the size of the shared file because a performance degradation occurs when the system processes the shared file. That is, if the system 100, 102, 104 that delivers data continuously records data in one shared file, the size of the shared file may exceed the size supported by the system that receives the data, and processing speed may decrease. have.

Thus, systems 100, 102, and 104 that wish to deliver data write a certain amount of data to each shared file. And each shared file contains at least one record. The structure of the shared file will be described in detail with reference to FIG. 2A.

The system 100, 102, 104 for transmitting data and the system 110, 112 for receiving data are read to find the recording position and the reading position of the shared file that was received before the termination when the system was restarted after the normal shutdown or sudden shutdown of the system. And create and manage shared information files that store recording work locations. The shared information file is stored and managed in the same storage location as the shared file. The structure of the shared information file will be described in detail with reference to FIG. 2B.

If the system 110 or 112 receiving the data does not delete the shared file after reading the data of the shared file, the number of shared files continues to increase. Therefore, it is necessary to properly delete all shared files after data transfer.

If there is one system that reads (delivered) a shared file, the system that reads the shared file deletes the shared file after reading the data. However, if multiple systems read a single shared file, it checks whether multiple systems have read all of the shared files and deletes the shared files. Such shared file deletion may be implemented by a separate system, or may be implemented with a system that delivers data or a system that receives data.

2A illustrates the structure of a shared file according to the present invention.

Referring to FIG. 2A, the shared file 220 is composed of at least one record 200, 202, 204, 206 including a data end display field 210, a data length field 212, and a data field 214.

The data end display field 210 is a field for distinguishing the last record from the shared file composed of at least one record. The data length field 212 indicates the length of data included in each record, and the data to be transmitted is recorded in the data field 214. And, the last record 206 includes the number field 216 of the read system. The number of read systems indicates the number of systems that receive data.

That is, the shared file 220 includes additional information 210, 212, and 216 for smooth data transfer between the data transmitting side and the receiving side together with the data 214 to be transmitted. At least one shared file 220 exists according to the size of data to be delivered, and the last record 206 of each shared file includes information 210 for identifying the end of the data.

The name of the shared file has a sequential name according to the generation order of the shared file. An example of the sequential name is a file name including shared file creation time information. By having a shared file name sequentially according to the generation order, the generation order of the shared file can be known only by the shared file name.

2B is a diagram illustrating the structure of a shared information file according to the present invention.

Referring to FIG. 2B, the shared information file 250 is composed of a number field 252 of a reading system, a file usage indication field 254, a file name field 256, and a next record number field 258 to read.

The number of read systems 252 indicates the number of systems to which the shared file should be delivered, that is, the number of systems receiving the shared file. If the number field 252 of the read system is marked as 1, the systems 110 and 112 receiving the data delete the shared file directly after reading the shared file. If the number field 252 of the read system is 2 or more, all systems that need to receive data delete the shared file after receiving the shared file. Deletion of the shared file is preferably operated by a separate system.

The file usage indication field 254 distinguishes whether the system is reading / writing a shared file or whether the operation is completed. When the system opens the shared file, the file usage indication field 254 is displayed as read / write in progress and ends when the shared file is read.

The file name field 256 indicates the name of the shared file currently being used by the system receiving the data. The name of the shared file has a sequential name according to the generation order as described above in FIG. 2A.

The next record number field 258 to read refers to the record location to read next associated with the record currently being read when the shared file consists of multiple records 200, 202, 204 and 206. When the receiving system reads the shared file, it records the location information of the next record to be read, so that when the receiving system reads the shared file again after an abrupt termination, the shared information does not need to be read from the beginning of the shared file. Reference the record number to be read in the file and read it again from the end.

3 is a flowchart illustrating a flow of an asynchronous data transfer method according to the present invention.

Referring to FIG. 3, data to be delivered to at least one or more systems 110 and 112 is recorded in a shared file (S300). In addition, the shared file 220 generates and manages a shared information file 250 for a system for transmitting data and a system for receiving data. The shared file 220 and the shared information file 250 are stored in storage shared by multiple systems 100, 102, 104, 110, 112, and 120. Data is recorded in each shared file 220 in a predetermined amount of size, and the shared file 220 is composed of at least one record 200, 202, 204, 206. The structure and function of the shared file 220 and the shared information file 250 have been described with reference to FIGS. 2A and 2B.

When the system 100, 102, 104 for transferring data creates the shared file 220, the system 100, 102, 104 records the information of the shared file 220 currently being used in the shared information file 250 (S300). In addition, when the system 110 or 112 receiving the data reads the shared file 220, the system 110 and 112 records the information of the shared file 220 currently being used in the shared information file 250 (S310). The shared information file 250 exists for each system that delivers data and each system that receives the data.

When all data of the shared file 220 is delivered to the systems 110 and 112 receiving the data, the shared file 220 is deleted (S320). The systems 110 and 112 receiving the data have a shared information file 250 for each system. In the shared information file 250, the name of the shared file 220 currently used by each system is present.

Looking specifically at the process of deleting a shared file, first examines the file name 256 of the shared information file to determine whether the shared file has been delivered to all systems 110 and 112 receiving the data. The file name 256 of the shared information file is sequentially found. Since the name 256 of the shared file is composed of sequential names according to the generation order as described above, the shared file 220 generated first based on the name can be found.

If the shared file name generated first among the file names 256 of the shared information files existing in the systems 110 and 112 receiving data is found, the shared file whose file creation order is earlier than the found shared file (that is, the file names are sequential) In the order of sharing, the shared file is deleted because data transfer is completed.

The shared information file 250 includes a record number field 258 to read next and a file usage indication field 254. Therefore, when the system 110 or 112 receiving the data is restarted after the termination, the system ends with reference to the record number field 258 and the file usage indication field 254 to be read next without rereading the shared file read before the termination. You can read the shared file again from where you left off.

When the system 100, 102, 104 that delivers the data restarts after termination, the previously shared file 220 is opened, and a record 206 indicating the end of the file is recorded at the end of the shared file 220 and the new shared file is opened. Create a record to continue recording. The system passing the data does not use the next record number field 258 portion to read.

The invention can also be embodied as computer readable code on a computer readable recording medium. The computer-readable recording medium includes all kinds of recording devices in which data that can be read by a computer system is stored. Examples of computer-readable recording media include ROM, RAM, CD-ROM, magnetic tape, floppy disk, optical data storage, and the like, and may also be implemented in the form of a carrier wave (for example, transmission over the Internet). Include. The computer readable recording medium can also be distributed over network coupled computer systems so that the computer readable code is stored and executed in a distributed fashion.

So far I looked at the center of the preferred embodiment for the present invention. Those skilled in the art will appreciate that the present invention can be implemented in a modified form without departing from the essential features of the present invention. Therefore, the disclosed embodiments should be considered in descriptive sense only and not for purposes of limitation. The scope of the present invention is shown in the claims rather than the foregoing description, and all differences within the scope will be construed as being included in the present invention.

According to the present invention, when data is transmitted between systems, the processing speed of the sending side is slowed down when the processing speed of the receiving side is slowed down, and the data transmitting side and the receiving side perform tasks asynchronously. To do it. In addition, by storing and managing the location of the shared file that was read before the shutdown even in the event of an unexpected shutdown of the system, the shared file can be read again from the part before the shutdown without having to read it from the beginning again.

Claims (7)

Recording and storing data to be delivered to at least one or more systems in a shared file having a sequential name in a generation order; Generating a shared information file including a name of a shared file currently received by each system; And Identifying a shared file name that is earlier in the sequential order among the shared file names included in the shared information file, and determining that the shared file having a name earlier than the identified shared file name is completed and deleted; Asynchronous data transfer method comprising a. The method of claim 1, And said recording step comprises storing said shared file in a storage device shared by at least one or more systems. The method of claim 1, And the recording step comprises recording each data to be transferred to each shared file having a sequential name according to the generation order of the shared file. The method of claim 1, The shared information file includes a name of the shared file, which is given a sequential name according to a generation order, The deleting step may include retrieving the shared file name generated first based on the shared file name recorded in the shared information file, and then deleting the generated shared file before the searched shared file. Data delivery methods. The method of claim 1, And said recording step comprises separating and storing data into at least one or more records. The method of claim 1, The shared information file includes a record number field indicating a location of a shared file being used by the system, and a file usage indication field indicating a usage state of the shared file. A shared file recording unit for recording each data to be transferred to a shared file having a sequential name according to a generation order, and generating a shared information file including a name of a shared file currently received by at least one system; A shared file that grasps the shared file name that is the first in the sequential order among the shared file names included in the shared information file, and determines that the shared file having the name earlier than the identified shared file name is completed by transferring data. Deletion unit; asynchronous data transfer system comprising a.

Images