JPS61175738A - File replacement system - Google Patents

Abstract

PURPOSE:To improve the responsiveness of the replacement processing to a specific file by extracting the replacement indication data out of an FIFO buffer for each replacement subject file through a file replacement program in accordance with the prescribed priority. CONSTITUTION:The replacement request indication data #1-#3 given from program A and B are supplied to an FIFO buffer 2. The file replacement program 3 searches the inside of the buffer 2 in order of the replacement request indication data to a file F1, the replacement request indication data to a file F2 and the replacement request indication data to a file F3. The replacement time lag during which the replacement request indication data to the F1 is reflected to the F1 is comparatively small since the file F1 is replaced with highest priority. Furthermore the load is smoothed to a replacement program 3 since the file F3 is replaced in an idle time obtained after the replacement is through with both files F1 and F2.

Description

[Detailed Description of the Invention] [Technical Field of the Invention] The present invention relates to a file update method related to a computer system in which data is simultaneously read or updated for a plurality of common files by a plurality of expansion devices (programs). .

[Technical background of the invention]

Conventionally, in computer systems that read or update data from multiple terminal devices to multiple common files at the same time, timing conflicts occur between the terminal devices.
A so-called deadlock situation occurs. Therefore, in order to avoid this problem, a system has been proposed that includes a batch file update program that exclusively updates files. In this system, update requests (update request instruction data) from each terminal device are stored in a FIFO (FiFO) system, which organizes update requests (update request instruction data) from each terminal device in a first-in, first-out order.
rst In Fist Out ) Buffer y [Input.

The batch file update program a program takes out the file update requests (update request instruction data) in the order organized by the FIFO buffer and updates the files to be updated all at once. be exposed.

In this way, in the system having the batch file update program proposed above, file update processing is performed according to the FIFO rules, so no file to be updated is in its final form until the last update request instruction data has been processed. become.

FIG. 4 shows an operation timing chart of the previously proposed example. Figure 2 shows how update request instruction data is input to FIFO buffer 1 from each terminal device.
1.4-2.4-3 indicates each update request instruction data. ■ indicates the number of unprocessed (waiting to be processed) data in the FIFO buffer. (Q shows how files A%B and C are each updated by the batch file update program. In this example, after the update request instruction data +3 is input to the FIFO bubble 71, the target file user is There will be an update time lag until the update is completed.

[Problems with background technology]

As described above, in a system having a batch file update program, when attempting to refer to the contents of a file in real time, an error occurs due to unprocessed update instruction data remaining in the FIFO buffer. - Some of the files to be updated are not used for the purpose of "inquiry" as mentioned above.
This is because the batch file update program updates all files at once, without distinguishing between files that should be updated immediately and 7 files that are not eligible.

An error occurs in the timing of inquiries due to the update processing time of files that are not urgently updated (files that are not queried). Such an error becomes a serious problem as the number of files to be updated increases, and is a fatal flaw in systems that require real-time performance.

[Purpose of the invention]

SUMMARY OF THE INVENTION In view of the above drawbacks, an object of the present invention is to provide a file update system that increases the responsiveness of update processing for a specific file and substantially improves real-time performance.

[Summary of the invention]

In a system in which a plurality of programs access a common file, the present invention provides a file update request organizing means that receives the file update requests from each program and organizes them in first-in, first-out order, and a file update request organizing means that receives the file update requests from each program and organizes them in a first-in, first-out order The above object is achieved by comprising a file update program that extracts update request data for each update countermeasure file from the file update request organizing means and updates the corresponding file based on this data. It is.

[Embodiments of the invention]

An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram showing an embodiment of a computer system to which the file update method of the present invention is applied. Foam powder device I
The update request instruction data output from the unique programs A%B accessed by A and IB are each independently stored in FIFO (
(first in, first out) is written to the buzzer 712. The file update program 3 updates the contents of the files Fl, F2, and F3 (61), and at that time, it extracts the update request instruction data for each update target and file from the FIFO buffer 12 according to the predetermined priority. Perform updates.

Next, the operation of this embodiment will be explained using FIG. 2.

Figure 2 is a timing diagram when update request instruction data is input to FIFO buffer 2, 0.0.0 is file Fl,
F2. Timing diagram showing how F3 updates, ■, ■,
0 is a timing diagram showing the number of target data for files L/F1, F2, and F3 in the FIFO. First, as shown in FIG.
2, and file update program 3 is input to file F
The FIFO buffer 12 is searched in the order of update request instruction data for file F2, update request instruction data for file F2, and update request instruction data for 7 isle F3, and if update request instruction data is found, it is transferred to the FIFO buffer 2. Update the file to be retrieved. However, the algorithm for extracting the update request instruction data is assumed to operate from the beginning every time one file is updated. For this reason, the file update program 3 updates files F11, F21, F12 as shown in
, after updating F22, F13, Phi, /L/F31
, F32, and F33 are updated. In this way, the file update program 3 extracts the update request instruction data in the FIFO buffer 2 based on a predetermined priority order and updates the file. The number of data, the number of update instruction data for file F2, and the number of update instruction data for file F3 are as shown in Figure 2 ■, [F], 0.Furthermore, file Fil indicates a narrower file division to which file IK belongs. , and others as well.

FIG. 3 shows an operational flowchart of the file update program shown in FIG. First step 10
In step 1, the FIFO buffer z is searched to see if there is any update request instruction data for the 7eye/I/F1, and if there is, in step 102, one corresponding update request instruction data is retrieved and After updating the file F1 based on the information, the process returns to step 101. At step 101, F
IFO (7 eyes in rough 12, updated for zF1!!
If there is no instruction data, go to step 1o3.
Search whether there is update request instruction data for file F2 in IFO buffer 2, and if so, proceed to step 1.
Go to 04 and display the corresponding update request instruction data one by one.
After updating file F2 based on this, step 1
Return to 01. Step 101. If there is no corresponding instruction data in step 103, the process goes to step 105, and a search is made to see if there is update request instruction data for file F3 in the FO buffer 2. If there is, step 105
After extracting one corresponding update request instruction data in step 6 and updating the file F3, step 10IIC
return. If there is no corresponding update request instruction data in steps 101, 103, and 105, the process goes to step 107, where it is determined whether or not to continue the process. finish.

According to this embodiment, since the file Fil is updated with the highest priority, until the update request instruction data divided by 3 for the file F1 shown in FIG. The update time lag Ta can be made smaller than in the conventional example. Furthermore, since the file F3 is updated at a leisure time after all the updates of the files Fl and F2 are completed, the load on the file update program 3 can be smoothed. Furthermore, the priority level 1 which the file update program 3 takes out of the FIFO (retrieve update instruction data from the file 2) can be set relatively easily by changing the program part that determines the priority order of the file update program 3. This allows the system to be optimally set for actual operation.

〔Effect of the invention〕

As described above (according to the file update processing method of the present invention), the file update program extracts update instruction data for each file to be updated from the FIFO buffer 1 according to predetermined priorities and updates the file. This has the effect of increasing the responsiveness of update processing for specific files and substantially improving the real-time performance of system update processing.

[Brief explanation of the drawing]

Fig. 1 is a block diagram showing an embodiment of a computer system to which the file update method of the present invention is applied, Fig. 2 is an operation timing chart of the file update program and FIFO buffer 1 shown in Fig. 1, and Fig. 3 1 is an operation flowchart of the update program shown in FIG. 1, and FIG. 4 is an operation timing chart of a system to which the previously proposed file update method is applied.・ 1 person, IB - Floor expansion device z - FIFO buffer 3 - File update program Fl, F2, F3 - File agent Patent attorney Kensuke Chika (and 1 other person) Figure 1 2 Tomi U Hyakuguchi 2 Figure 3 < EB (J

Claims (1)

[Claims] In a system in which a plurality of programs access a common file, a file update request organizing means receives the file update request instruction data from each program and organizes the file update request instruction data in a first-in, first-out order; A file update method comprising: a file update program that extracts update request instruction data for each update countermeasure file from a file update request organizer and updates the corresponding file based on this data.