JPH04156030A - Acceleration system for data transfer by linkage of data - Google Patents

Abstract

PURPOSE:To enhance the transfer efficiency of data and to improve the transfer speed of the data by performing data linkage and transferring plural pieces of data with single data transfer in a communication processing procedure which performs data transfer processing. CONSTITUTION:This system is provided with a data linkage means 106 which checks whether or not data for transmission can be linked and links the data until the data linkage is not available, data transfer means 107, 108 which perform the transfer of the data, and an area length reception means 109 which acquires the buffer length of the buffer for data transfer of a reception side job 101. Also, an area length information means 111 which informs the area length of the buffer for data transfer to a transmission side job 102, and a linkage data separating means 112 which checks whether or not received data is linkage data and separates the data and returns it to original data are provided. The job 102 links the data desired to transfer in the case of receiving a data reception request from the job 1, and transmits the plural pieces of data with the single data transfer. In such a manner, the data transfer can be accelerated.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention is used in an overconfidence processing procedure for data transfer processing, and is particularly a method for speeding up data transfer by concatenating data when a large amount of small data is sent. It is related to.

[Conventional technology]

Conventionally, when data transfer between jobs from a sending job to a receiving job is performed in synchronization between the sending job and the receiving job, the sending job receives a data reception request from the receiving job. Wait, and then send one piece of data from the 0 transmission data group in the sending job.

After transmitting one piece of data, the transmitting job waits for the next data reception request from the receiving job and transmits the next data. When the sending job sends data, one free space is created in the data storage area for sending data in the sending job, and the sending job stores new sending data in the empty area.

[Problem to be solved by the invention]

In the conventional method described above, the sender job sends data when a data reception request comes from the receiver job, but in other words, data can only be sent when a data reception request comes from the receiver job. However, there was a problem in that the data transfer speed slowed down when data was sent one by one.

Means for Solving Problem C8] In the method of speeding up data transfer by concatenating data of Kinoi 8A, there are two jobs, a sender job and a receiver job, which send and receive data, and the sender job has two jobs: a sender job and a receiver job. In this case, there is a plurality of sending data whose sending order is predetermined and data concatenation is permitted or disallowed, and the sending job sends the sending data to the receiving side in accordance with the O data reception request from the receiving job. In a job transfer system that transmits data to jobs in accordance with the transmission order, the data linking means checks whether the data for transmission existing in the sending job can be linked, and links the data until linking becomes impossible; A data transmitting/receiving means exists in each of the transmitting job and the receiving job and transmits and receives data between the transmitting job and the receiving job, and a data transmitting/receiving means exists in the transmitting job and uses a buffer for transmitting and receiving data of the receiving job. an area length receiving unit that acquires a buffer length; an area length notification unit that is present in the receiving job and that notifies the sending job of the area length of the data transmission/reception buffer; and an area length notifying unit that is present in the receiving job; Concatenated data separating means that checks whether the received data is concatenated data and, if the received data is concatenated data, separates the data and returns it to its original form, the transmitting side zip extracts the data from the receiving job. When a reception request is received, the data to be transferred is concatenated to transmit the count O data in - times of transfer, thereby speeding up the data transfer.

[Effect]

In the present invention, in a communication processing procedure for performing data transfer processing, data is linked, and a plurality of pieces of data are transferred in - times of data transfer.

〔Example〕

Hereinafter, embodiments of the present invention will be described in detail based on the drawings.

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

In FIG. 1, a data receiving job (receiving side job) which receives data 101a is shown.
02 indicates a data transmission job (sending side job) that transmits data. 103 indicates a user AP, 104 indicates a data reception subroutine group, and 105 indicates a data reception area.

In this way, the sending job 102 that sends and receives data
There are two jobs, a receiving job 101 and a receiving fi' side job 101, and within the sending job 102 there is a plurality of sending data for which the sending order is determined in advance and data concatenation is permitted or not allowed. In response to a data reception request from the receiving job 101, the sending job 102 is configured to send transmission data to the receiving job 101 in the transmission order.

10G is a data concatenation part in the sending job 102,
This data linking unit 101 exists in the sending job 102, and constitutes a data linking means that checks whether or not the data to be sent can be linked, and links the data until it becomes impossible to link the data. 107 and 1 (Ill is sender job 1
02 and the receiving job 101 K, this data transmitting/receiving unit 1 (17 and 10a exist in the sending job 102 and the receiving job 101, respectively, and the data between the sending job 102 and the receiving job 101 is It constitutes a data transmitting/receiving means for transmitting and receiving.

1011 is an area length receiving unit in the sending job 102, and this area length receiving unit 1 (Ill is an area length that exists in the sending zip 102 and acquires the buffer length of the data transmission/reception buffer 110 of the receiving job 101). 111 is an area length notification section in the receiving job 101;
It constitutes an area length notifying means for notifying the sending job 102 of the area length of the data transmission/reception buffer 110. 112 is a concatenated data separation unit in the receiving job 101. This concatenated data separating unit 112 exists in the receiving job 101, checks whether the received data is concatenated data, and if the received mourning data is concatenated data, , constitutes a connected data separation means that separates data and restores it to its original form. 113 is a data transmission/reception buffer existing in the sending job 102; 114, 115, 116;
. . . is a transmission data storage area existing in the sending job 102.

117 is a common area between jobs.

When the sending job 2 receives a data reception request from the receiving job 1, it concatenates the data it wants to transfer, thereby transmitting multiple pieces of data in - times of transfer, thereby speeding up the data transfer. It is designed to be measured.

Next, the operation of the embodiment shown in FIG. 1 will be explained in FIGS. 2 to 11.
This will be explained with reference to the figures.

First, an overview of the data transmission job 102C) will be explained using FIG. 1 and FIG. 2, which is a flowchart showing an outline of the data transmission job 102C).

As an initial process, the data transmission job 102 obtains the size of the data reception zip 10141) data transmission/reception buffer 711@. This buffer size is sent from the data reception zip 101, received by the area length reception unit 101, and sends a buffer size acquisition notification to the data reception zip 101.
1K is returned (step 201). When the initial processing is completed, the data sending job 102 enters an event waiting state in which it waits for an event to arrive from the data receiving zip 101 (step 202).

Here, an event is a signal that informs the other party that some data has been transmitted.

When an event comes from the data reception zip 101, the data is received by the data transmission/reception section 1071'C of the data transmission zip 1020 (step 203).

When the received data is a data reception request (step 204), the data connection 11101 is called (step 20
5) The data stored in the transmission data storage areas 114 to 116 are concatenated to create a data transmission/reception buffer 711.
3, and the data transmitting/receiving unit 197 transmits the concatenated data and notifies the data receiving zip 101 of the event (step 206). After transmitting the data, the data transmitting jib 102 enters the event waiting state again (step 202).

FIG. 3 is a flowchart showing an overview of the data reception zip 101.

The data reception zip 101 consists of a group of blue routines 104 that receive data from the kneader AP 10$.When this data reception subroutine group 104 is started from the user p1as, it sends and receives data to the data transmission job 102 as an initial process. The buffer length of the data buffer 110 is notified, and the data received flag is turned OFF (step 301
).

After that, the data reception subroutine group 1@4 is performed on the kneader AP.
In response to the data reception request from 103, the data reception completed flag is checked (step 302), and when the data reception completion flag is OFF (step 302), the data transmission/reception unit full is used to send data to the data transmission job 102. After transmitting a data reception request and issuing an event (step 303), the process waits for an event (step 304).

Then, when an event occurs and the data transmitting/receiving section 108 receives data (step 305), the data reception completed flag is turned ON (step 306), and the concatenated data separation section 112 separates the concatenated data (step 307). If the data received flag is ON (step 302)
Since there is data in the connected data separation unit 112, the connected data separation unit 112 is called (step 307).

After this, the separated data is passed to the user AP 103 (step 309), and the connected data separation 511
2, check the separated data flag and check if this flag is O.
If it is FF (step 310), the data received flag is turned OFF (step 311).

FIG. 4 is a flowchart showing the processing procedures of the data transmitting/receiving sections 107 and 1018.

The data transmitting/receiving units 108 and 107 receive an instruction for transmission or reception from the data receiving zip 101 or the data transmitting zip 102. Then, check whether it is sending or receiving (
When step 401) is a reception request, the zip-related common area 117 that can be accessed from both the transmitter and receiver
The data is read out to the data transmission/reception buffer based on the data length (steps 402 and 403).

When a transmission request is made, the data length and data content are written in the zip common area 117, and when this is completed, an event is issued (steps 404 to 406). FIG. 10 shows how data is stored in this inter-job common area.

) FIG. 5 is a 70-chart showing the processing procedure H of the data linking section 106. FIG. 11 shows an aspect of data linkage using link headers.

The data linking unit 10G first clears the link data length and check data length (step 501).

Next, the data that must be transmitted first from the transmission data storage area is 4! Step 502), check the connectable flag attached to the beginning of the data (step 503). And the connectable flag is ON
When , the data can be concatenated. When the data concatenation flag is ON, the data length of the extracted data and the concatenation header length are added to the check data length (step 504). The structure of this concatenated header 901 is shown in FIG. 9.

The concatenated header 801 includes a concatenated header flag (concatenated structure flag) 902 indicating that it is a concatenated header 901, a concatenated ID 803 for identifying data in the chunk 9 as concatenated data, and a pointer to the next concatenated header 901. (
It consists of a pointer to the next concatenated structure) 804, a data size 905, and a pointer to the data sO6, and if there is no primary concatenated header 901, the next concatenated header 80
Pointer to 1 (pointer to the next concatenated structure) 80
4 is stored as zero (NULL), which is also the initial value. Then, the check data length is data reception job 101
It is checked whether the buffer length is p smaller than the buffer length of the data transmission/reception buffer 110 (step 505).

And the check data length is data transmission/reception pants 711
(If it is larger than I, the process ends. If it is smaller, it is checked whether the check data length is smaller than the buffer length of the data transmission block 1020 and the data transmission/reception buffer 113 (step 506L). If the length is larger than the data transmission/reception buffer 113, the process ends. If it is smaller, the check data length is stored in the concatenated data length (step 507).

Next, the header 8 is connected to the buffer 113 for sending and receiving one data.
Please check if there is 01 (step 50g)
, when there is no concatenated header 901, no data is stored, so the concatenated header lol is stored at the beginning of the buffer (step 509). And the concatenated header! 10
If there is a 1, refer to the concatenated header 901 attached at the end (step 510), and store a pointer to the concatenated header 801 to be added to the new nine in the data pointer 110&, which is the address of the next data of the concatenated header 101 (step 510). 511). The final concatenated header! 101 is a zero (NUL) at the address of the next data of the concatenated header 1101.
L) is saying L.

Thereafter, data is written into the data transmission/reception buffer 113 (step 512), and the link ID, data size, and pointer to the data are stored in the link header 901 (steps 515 and 516). When the setting of the concatenated header s01 is completed, the original transmission data area is released (step 515). And this step 502-5
Repeat step 15 and when the buffer is full of data,
finish.

Here, when the connectable flag is QFF (step 50
3) is the connection header 1 to the data transmission/reception buffer 113.
Check if 01 exists. In other words, the address of the last header is zero = last header PFiNUL
L (step 516), and the concatenation header 10
If there is no 1, the data is stored as is in the data transmission/reception buffer 113 (step 517), and the transmission data area is released (step 518). Concatenation header 901
If there is (step 516), the process ends.

FIG. 6 is a flowchart showing the processing procedure of the linked data separation unit 112.

The initial value of the separated data flag in this connected data separating unit 112 is OFF. Then, the connected data separation unit 112
first checks whether data is being received (
Step 601). If data has been received, a concatenated header 8 is placed at the beginning of the data transmission/reception buffer 110.
Please check if there is 01 (Step 602)
, if the concatenated header so1 is missing, the data in the data transmission/reception buffer 110 is passed to the user AP 103 (step 603). When there is a concatenated header 801 (step 60
2) Check whether the separated data flag is ON or not.Step 604) If the separated data flag is OFF,
The flag is turned ON (step 605), and the first concatenated header 1101 is referenced (step 606). Then, the data is separated based on the pointer to the data in the concatenated header 5a142) and the size of the data (step 608).
). After separating the data, pass the data to the Aesam P103 (step 609), and refer to the referenced concatenated header 110I.
A pointer to the next concatenated header 101 in O is stored at the address of the next data (step 610). If the address of the next data stored in step 610 is zero (NU
LL) (step 611), and zero (
(NULL), the mourning process ends, and zero (NULL)
The data transmission/reception buffer 11G is released (step 612), and the minute 1175 signal is turned off (step 613). Then, from next time onwards, the separated data flag will be ON.
If so, (step 604), the concatenated header 801 pointing to the address of the next data set in (step 610)
(step 607).

FIG. 7 is a 70-chart showing the processing procedure of the area length notification unit 111.

In this area length notification unit 111, data reception job 101
To obtain the buffer length of the data transmission/reception buffer 1100 (step 701), to store it in the data transmission/reception buffer 110 (step 702), to the data transmission/reception unit 101
1 (step F03). After transmitting the buffer length, it waits for a notification that the area length has been acquired and enters an event waiting state (step 7o4). The area length acquisition completion notification is received, and the process ends (steps 705 and 706).

Fig. 8 is a flowchart showing the processing procedure of the area length receiving section 10842).

First, wait for data in an event wait state (step 80).
1). When an event is received, the data transmitter/receiver 1
07 (step 802) to obtain data. The data is the area length (Step 803). When the area length is received, a notification that the area length has been acquired is stored in the data transmission/reception buffer 113. Step 804). The data is sent to the data transmission/reception unit 107 (Step 805). The data is transmitted. .

〔Effect of the invention〕

As explained above, the present invention performs data concatenation in the communication processing procedure for data transfer processing, and transfers a plurality of pieces of data in - times of data transfer, thereby increasing the data transfer efficiency and increasing the data transfer efficiency. This has the effect of improving the data transfer speed.

[Brief explanation of the drawing]

Fig. 1 is a block diagram showing an embodiment of the present invention, Fig. 2 is a flowchart showing an outline of a data transmission job, Fig. 3 is a flowchart showing an outline of a data reception job,
The figure is a flowchart showing the processing procedure of the data transmitting and receiving unit.
Figure 5 is a flowchart showing the processing procedure of the data linking unit, Figure 6 is a flowchart showing the processing procedure of the linked data separation unit, Figure 7 is a flowchart showing the processing procedure of the area length notification unit, and Figure 8 is a flowchart showing the processing procedure of the area length notification unit. A flowchart showing the processing procedure of the receiving section, Wkg diagram is an explanatory diagram showing the structure of the concatenated header, Fig. 10 is an explanatory diagram showing the structure of the data transmission/reception area in the common area between jobs, and Fig. 11 is an explanatory diagram showing the structure of the data transmission/reception area in the common area between jobs. FIG. 101...Data reception job (reception side job 102
...Data transmission job (sending side job) 103--
--User AP, 104-@--day! Reception subroutine group, 14) S...Data reception area 101...
Data connection unit, 107, 101-・Lu・Data transmission/reception unit, 101・Fist・Region length reception unit, 11000. - Data transmission/reception buffer, 111 --- Area length notification section, 1
12--Concatenated data separation section, 113.phi.. Data transmission/reception buffer, 114-116..-Transmission data storage area, 111.--Job-related common area. Patented Reijin NEC Co., Ltd.

Claims (1)

[Claims] There are two jobs, a sending job and a receiving job, which send and receive data, and within the sending job, the sending order is predetermined, and there is permission or disapproval for data concatenation. In an inter-job transfer system in which multiple pieces of data exist and the sending job sends the data for transmission to the receiving job in the transmission order according to a data reception request from the receiving job, the data exists within the sending job. a data linking means that checks whether the data to be sent can be linked and links the data until it becomes impossible to link the data; data transmitting/receiving means for transmitting and receiving data; area length receiving means existing in the transmitting job and acquiring the buffer length of the data transmitting and receiving buffer of the receiving job; and area length receiving means existing in the receiving job and transmitting and receiving data an area length notification means for notifying the sending job of the area length of the buffer for the sending job; and checking whether the received data existing in the receiving job is connected data, and if the received data is connected data,
and a concatenated data separation means for separating data and returning it to its original form, and when the sending job receives a data reception request from the receiving preparation job, it concatenates the data to be transferred, so that multiple data can be transferred in one transfer. 1. A method for increasing the speed of data transfer by linking data, characterized in that data is transmitted at a higher speed, thereby increasing the speed of data transfer.