JPS5854455A - Down-line loading system - Google Patents

Abstract

PURPOSE:To realize a series of processing without any user's operation by directly transferring a control program, a control management table, a operating program, etc. from a center to each terminal. CONSTITUTION:Information is exchanged between a center 1 and each terminal 2 with a conversation mode. A terminal 2 outputs only necessary program information to store it in a storage medium 3. Receiving a program management information from the center 1, the terminal 2 checks the file name and program name and also checks whether the program is to be recorded or updated. In case of updating, the version information is checked. Subsequently the length between a transfer requesting program and the preceeding program is compared and the file area is sorted. When the program information to be requested to the center 1 is left in case of the program updating, processing after the version information checking is repeated. After receiving the whole program information to be requested to the center 1, the processing is ended.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a data communication system A having program-controlled terminals, in which terminals K are connected from a center.

This invention relates to a down-line loading method that transfers the latest information on programs, tables, and a portion of the information used within a terminal, and writes it into a medium memory.

Conventionally, in program-controlled terminal devices, when expanding the functions of control poodrams, control management tables, business programs, etc., changing specifications, or making corrections for program failures, the developer or maintainer mNWt must update the updated programs, tables, etc. Create, FD, DK or MT
A common solution was to store the data in a storage medium such as a computer, etc., and then deliver the storage medium to the home of the terminal device user.

However, this method can be implemented when the number of terminal devices is small, or when it is not necessary to provide homogeneous services at the same time. Smooth operation cannot be expected with this method. In particular, it is virtually impossible to deal with processes such as repairing bugs and changing functional specifications, all at once and quickly within a certain period of time, using conventional methods.

Another method is to send Poudaram patch information to all users and manually modify the program at each user's home, but this method results in the program being destroyed due to operational errors or due to failure to perform batch operations, leading to unbalanced program generation management. ,
The current situation is that subsequent maintenance and management of Bougram will become even more complicated.

Furthermore, when updating a program, there is usually an increase or decrease in the length of the old and new program, and it is necessary to set up sufficient free space in advance or reconfigure the linkage of all program programs, and in the end, the entire storage medium must be replaced. The current situation is that it will disappear.

This invention provides 411*! control programs for terminal devices, control management tables, business programs, etc. in a system having a large number of terminal devices. ! When expanding, changing specifications, updating the boogram generation, etc.

Instead of distributing storage media storing these program programs, a new method is proposed in which the program information is transferred from the center to each terminal, thereby solving the aforementioned problems and realizing a series of processes without any user operations. It was 5K. The present invention will be explained below with reference to the drawings.

FIG. 1 is a block diagram of a system for implementing the present invention. Center 1 and terminal 2 exchange information in conversation mode, and terminal 2 stores only necessary program information on storage medium 3.
Store in.

IIJI showing 7p-char of 11E2rlJK treatment
In the first step 1, the terminal 2 receives Pregra immigration information from the center 1. Information on Pregra Immigration Shoes is shown in Figure 3 (
a) It has the configuration shown in K, and has verge track information for the entire or part of the boogram in addition to the file name. In other words, the file name ^.

Boogram B, purge information C1-C8...
etc., and each virgin information C2 to C3+ is shown in Figure 3 (b
)K, it is composed of a purge name a% p-do pongee address b, an old boogram C0, a new boogram d, etc.

After terminal 2 receives the information, it checks the 7th file and Poodaram name in step 2 of jl12WJ.

Check whether the program is registered or updated. In case of update, step 3 is bar 9! Check the information.

In step 4, the program you are about to request to transfer (11
Find the increase/decrease in the length of the old Pujidaram (I1 minute) and the length of the old Pujidaram (I1 minute), and sort the file area according to the procedure shown in Figure 4 in Step 5. F in FIG. 4 indicates the file area, p) indicates the state before sorting, ←) indicates the state after sorting, and t→ indicates the state after Pugtsu mood. 5, which you can understand from now on, create an empty area according to the new boogram length, and insert the new program there as described below.

Next, in step 6, terminal 2 is set to center IK.

Request the transfer of a program corresponding to the purge information,
In step 7, the program sent from the center 1 is received, and in step 8, the file area Kp- of the storage medium 3 is completed. (eyebrow program, p-gram, etc.). In the case of program update, if the program information requested from center 1 remains in step 10,
After repeating the processing steps after the purge information check and receiving all the program information requested by the center IK,
The FDD is closed and the process ends in step #11. If it is not a boogram update, the process jumps from step #2 to step ##6, and the same process is performed thereafter.

Since the present invention performs one or more of the processes described above, it has the following advantages.

(1) Since the communication function allows registering and updating programs in the storage medium, it is possible to eliminate the need for humans to deliver each terminal KFDD, and it can be done much more quickly.

(2) The program automatically performs the above processing on line 5, so
There is no burden on the terminal operator at all.

(3) Since the generation of boograms can be managed using the barge shoulder, the terminal can select only the necessary information.

(4) Since it has a file area sorting function, there is no need to worry about dividing the program and redoing it, or creating empty areas (unusable areas), allowing for effective use of memory. .

-4. Brief explanation of the drawings Figure 1 is a diagram of the system configuration when Dakun Line ---Ding is executed, Figure 2 is a 7-chart of the process, and Figure 3 (
a) and (b) are diagrams illustrating the configuration of Bougla entry-department slip information, # and virgin information, and FIG. 4 is a diagram showing a method of sorting file areas.

be.

Figure 1 Figure 2

Claims (1)

[Scope of Claims] 0) In a data communication system consisting of a center that manages the entire system, and five poodaram-controlled terminals that transmit and receive information to and from the center, the center controls the poudaram, control management table, and business of the terminals. Boogram, these pzigrams, and table steel modification proboscis update information are sent to the terminal, and the terminal temporarily stores each of the information in an external storage device, and after completion, it receives the scissorbug program and table steel from the center. A down-threat line/one-daying method characterized by replacing the information with new information and updating the generation. (2) Program generation update KI! Claim No. 2 is characterized in that, after receiving all the existing generation information and comparing it with the generation of its own program, only the boot program update information of the necessary generation or later is selected.
1) Down-line-one-daying method described in section 1). (3) When updating the generation of program programs, the system performs sorting work for all program programs on the storage medium based on the received change/update value information, regardless of the increase or decrease in the amount of modified program programs. Claim No. (1)
The down line P-ding method described in section.