JP3278885B2 - Computer system - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION The present invention relates to a computer system.
, Especially when starting a new program
It relates to means for updating the order setting information. Recently, the automatic service terminal with a built-in computer, such as an automatic deposit and withdrawal machine bank has increased, such devices, new pro
To improve services by introducing gram
Operation may be stopped and restarted. However,
To reduce customer waits during this time, computer systems should install programs as quickly as possible.
Need to be installed and started. In this case,
Add the added program to the boot order setting information
Must be set and updated in the correct order.

[0002]

2. Description of the Related Art Conventionally, when a computer system is started, a program is started according to a predetermined start order. It has been determined that, based on a program hierarchy, such as an OS, a package, and an application program, a program of a base hierarchy is started and then a program of a next hierarchy is started.

FIG. 11 is an explanatory diagram of a program starting method of a conventional computer system. In FIG. 1, reference numeral 1a denotes a program providing medium such as a floppy disk, which stores a program name table 11 and a program 13a described in an executable form. 11
Is a program name table, which is a table of names of programs to be provided. 13a is a program described in an executable form. Reference numeral 2 denotes a large-capacity storage device which is constituted by a magnetic disk or the like and stores programs, data, and the like.

A program 13b is transferred from the program providing medium 1a, stored in the large-capacity storage device 2, and transferred to the main memory by the program starting unit 5a for execution. Reference numeral 21 denotes a hierarchical program table, which is stored in the mass storage device 2 and is a list of programs belonging to each layer for each of a plurality of program layers (OS layer, package layer, etc.). An OS layer program table 211 is a list of programs belonging to the OS layer. A package layer program table 212 is a list of programs belonging to the package layer.

Reference numeral 3a denotes a system introduction unit which transfers a necessary program 13a from the program providing medium 1a into the large-capacity storage device 2 and stores the program 13a in accordance with the program hierarchy described in the program name table 11. The name is added to the hierarchy-specific program table 21 shown in FIG.

Reference numeral 4 denotes a main memory where a program is started and executed. 13c is a program,
The program 13b is selectively transferred to the main memory 4. 5a is a program starting unit, which is a mass storage device.
The program is started by selectively transferring a program from the program 13b stored in the main memory 2 to the main memory 4. Reference numeral 6 denotes a message which gives an instruction from the console to the system introduction unit 3 when the program is introduced. Reference numeral 7 denotes a central control device (hereinafter abbreviated as CPU), which executes a program.

The operation in the figure will be described. First, at the time of program introduction, the system introduction unit 3a transfers and stores all or a part of the program 13a stored in the program providing medium 1a in the mass storage device 2 according to the message 6 given from the console, and The name of each program is added to the program table 21 for each layer corresponding to the layer of the program described in the name table 11. Each program is classified so as to belong to any one of the hierarchies, and is recorded in a hierarchy-specific program table of any one of the hierarchies.

At the start of business, the program starting unit 5a starts a program belonging to the OS layer program table 211 to which the most basic program among the hierarchical program tables belongs,
After all the programs belonging to the OS layer program table 211 have been started, the programs belonging to the package layer program table 212 which is the next layer are started. After all the programs belonging to the lower layer are sequentially activated in this way, the program of the next layer is activated, and all the programs are activated.

However, the system has become complicated, and various packages and various application programs have been mounted on the same computer system. The phenomenon that startup was delayed occurred.

[0010]

Accordingly, when a plurality of business programs are mounted on one computer system, it takes time to start a lower-layer program required for another business. The problem is that the work start time of another work that does not require a program of the second layer is delayed.

FIG. 12 is an explanatory diagram of a problem of starting a conventional program. In the figure, A, B, C,..., J are programs, and the programs A and B belong to the OS layer.
Program H belongs to the server layer, and programs C, D, and E
Belongs to the package layer, and the programs F, G, and J belong to the application layer. The server layer program H belongs to the offline business system, the package layer programs C, D and E belong to the online business system, the application layer programs F and G belong to the online business system, and J the offline business system. belong to.

Further, the programs A and B are programs which have no precondition that the other programs are activated on the activation, the program C is an assumption that the program A is activated, and the program D is the program A And the program B are assumed to be activated.

[0013] Similarly, the program E is the same as the program A
And program B are assumed to be activated, program F is assumed to activate program C and program D, program G is assumed to activate program B and program E, program H is assumed to activate program A, and program J is assumed to be activated. Indicates that the program H is assumed to be activated. The arrows in the figure indicate the assumptions for activation. Therefore, only the program not receiving the arrow can be started without assuming the start of another program.

Here, when starting the programs F, G, J, conventionally, first, all the programs belonging to the OS layer are started.
A and B are activated, then the program H belonging to the server layer is activated, and then all the programs C, D and E belonging to the package layer are activated, and the program F is conditioned on all of these activations. , G and J were running.

That is, first, the program belonging to the OS layer is activated, then the program belonging to the server layer is activated, then the program belonging to the package layer is activated, and all the programs in the lower layers are activated. Then, the next layer program was started, and finally the top layer application program was started.

Therefore, although the program H is not a prerequisite for starting the programs C, D, and E,
Until the start of the program H is completed, the programs C,
The activation of D and E is delayed. Similarly, for the program J, although the programs C, D, and E are not assumed to be activated, they are lower-layer (package layer) programs necessary for another business system. The activation of the program J is delayed until the activation of D and E is completed.

Therefore, programs C, D, E, and C are grouped by grouping programs having a program startup dependency and determining a startup order for each group.
It is conceivable to start H at the same time to minimize the entire starting time. However, the actual computer system startup dependencies are complicated, and the processing time required to start each program varies greatly, so that the system setter needs to determine an efficient program startup sequence. Requires a great deal of labor and in-depth knowledge such as the dependency of activation of each program and the time required for activation.

The present invention relates to a program incorporated in a computer system , in particular, a newly introduced program.
The system startup sequence is automatically determined to be the most efficient sequence, and the programs that can be started are started with the maximum parallel processing, so that the program
It is an object of the present invention to provide means for minimizing installation time and start-up time , and at the same time, lightening the burden on a computer system designer.

[0019]

SUMMARY OF THE INVENTION The above-mentioned problem is solved by a computer system having the following configuration.
This is solved by the information updating means. FIG. 1 shows the principle of the present invention.
FIG. 2 is a schematic diagram showing the basic configuration of the computer system of the present invention.
Is explained.

The computer system of the present invention comprises the following:
Has a basic configuration. That is, a computer having a program starting unit 5 that transfers a plurality of programs 13b stored in the large-capacity storage device 2 that performs large-capacity storage to the main storage 4 and starts them.
In the data system, the mass storage device 2 is provided with start order setting information 22 indicating a dependency relationship with another program that must be already started when each program is started, and the program start unit 5 includes: Starting means 51 for starting a program according to the dependency described in the starting order setting information 22 is provided,
Then, the boot means 51 is described in the boot order setting information 22.
With means to launch programs according to dependencies
I have.

The present invention is directed to a large-capacity storage for performing large-capacity storage.
Main program 4 stores a plurality of programs 13b stored in storage device 2.
A computer system that transfers and executes
Program name table 11 with the program name
The contents of the program 13a
From the donor 1 to the large-capacity storage device 2 for performing the large-capacity storage.
It has a program introduction unit 3 for transferring and storing programs.
Each program is stored in the mass storage device 2.
Other programs that must already be running when
When the startup order setting information 22 indicating the dependency with the
In the program provider 1, each program
Other programs that must already be running at startup
Prerequisite program name list 12, which is a list of names,
The program introduction unit 3 sends the program
When introducing the program, the prerequisite program name list 12
The installation program is added to the boot order setting information 22 based on the
Update means 31 for additionally adding a dependency
Therefore, at the time of program introduction,
Based on the program name list 12, the start order setting information 22 is
Configure to update.

[0022]

In the computer system according to the present invention,
Start each program in the mass storage device 2.
Sometimes with other programs that must already be running
In addition to providing the boot order setting information 22 indicating the dependency,
At the start of each program,
One of the names of other programs that must already be running
List of prerequisite program names 12
Introduce the program from the program provider 1 to the introduction unit 3.
At the time of introduction, based on the prerequisite program name list 12,
The installation program is added to the boot order setting information 22 to
In addition, an update means 31 for adding a dependency is provided.
At the time of program introduction by the updating means 31
Based on the program name list 12, the start order setting information 22 is
Efficiently set and update in the correct order
You.

[0023]

[0024]

DESCRIPTION OF THE PREFERRED EMBODIMENTS In the present invention, when a new program is introduced,
The startup sequence setting information of the computer system.
When new, it is set up efficiently in the correct order.
You. For this purpose, startup order setting information indicating a dependency relationship with another program that must be already started when each program is started is provided, and the programs are started according to the startup order setting information. FIG. 12 is an explanatory diagram of a problem of starting a conventional program.
It is a figure of the tree structure which showed the dependence of the start of C, D, E, F, G, H, and J, and such a structure is called start order setting information. The start order setting information has a tree structure in which each of the programs incorporated in the computer system is represented by one node, and the nodes are linked by a link. Shows the relationship. For example, in the figure, a program A and a program B are programs that do not need to be activated, a program C has a
Is based on the assumption that the programs A and B are activated, the program E is also based on the assumption that the programs A and B are activated, the program F is based on the assumption that the programs C and D are activated, and the program G is based on the programs B and B The relationship indicates that E is assumed to be activated, program H is assumed to be activated for program A, and program J is assumed to be activated for program H. The arrows in the figure indicate the assumptions for activation. Therefore, only the program not receiving the arrow can be started without assuming the start of another program.

FIG. 2 is a block diagram of a program starting method according to an embodiment of the present invention. In the figure, reference numeral 2 denotes a mass storage device, a program incorporated in a computer system.
13b and the boot order setting information 22.

Reference numeral 13b denotes a program which is transferred to the main memory 4 and executed, and reference numeral 22 denotes start order setting information, which records the start order of programs incorporated in the system.

Reference numeral 5 denotes a program starting unit, which transfers a program recorded in the large-capacity storage device 2 to the main storage 4 and starts the program. Reference numeral 58 denotes a tree starting unit. The recorded start order setting information 22 is read, a startable program is determined, and the mass storage device 2 is read.
Is selected from the programs 13b stored in the main memory 4 and transferred to the main memory 4 as the program 13c to be activated.When the activated program 13c notifies the completion of the activation, the program that can be activated thereby is started. Is determined and started in the same manner.
Starts all installed programs. The same reference numerals indicate the same items throughout the drawings.

FIG. 3 is a flowchart showing the operation of the CPU according to the embodiment of the present invention. FIG. 3A shows the flow of the operation in the case of starting the tree starting unit. CPU 7 proceeds to step 85
When the power is turned on in step 86, the initial diagnosis is performed in step 86 to confirm the normal operation, and then in step 87, the tree starting unit is read from the mass storage device 2. Next, control is passed to the tree activation unit.

The tree starting unit 58 reads the start order setting information 22 from the large-capacity storage device 2 into the main memory 4 before starting the application program, and determines a node that is not linked to another (there is no starting prerequisite program). Search and start all the programs in parallel.
(In the example of FIG. 12, A and B are activated in parallel.) When the activated programs have been activated, the tree activation unit 58 is notified of activation completion. Tree activation unit 58 that received the activation completion notification
Cuts the link from the node corresponding to the program that has been started, and as a result, searches for a node that is no longer linked to the other (all of the prerequisite programs have been started). Start programs in parallel. (In the example of FIG. 12, when the start completion notification is received from A and the start completion notification is not received from B, C and H can be started, but D and E can be started.
Is not activated because no completion notification has been received from B. Each time the tree activation unit 58 receives the activation completion notification from the activated program, it performs the above-described link pruning and program activation, and repeats until all the programs have been activated.

As described above, when the computer system is started, all the programs are started immediately when the programs can be started. Therefore, the programs are started with the maximum parallel processing, and the program is started in the shortest time. In time, all program launches can be completed.

FIG. 4 shows a processing flowchart (part 1) of the tree starting unit, and FIG. 5 shows a processing flowchart (part 2) of the tree starting unit. When the computer system is started, the tree starting unit 58 reads the start order setting information 22 (step 50).
1) For each node constituting the boot order setting information 22 (step 502), it is checked whether or not it is a node that is not linked to another (step 504), and a program corresponding to a node that is not linked to another is checked. Is started (step 505). Steps 502 to 505 are repeated until all nodes have been checked (step 50
3) Start all bootable programs first.

Thereafter, the tree starting unit 58 waits for a start completion notification from the started program 13c (step 506).
If there are still programs to be started (Step 50
7), the link established from the node corresponding to the program that has been started is extracted (step 508), the extracted link is reaped (step 510), and the node established by the link has no other link. In this case (step 511), a program corresponding to the node is started (step 512).

Steps 508 to 512 are repeated for all links provided from the node corresponding to the program that has been started (step 509), and all programs that can be started by the completion of the completed program are started. I do.

If the program to be started does not remain when the start completion notification is received (step 507), the program starting unit ends. Here, the start shown in FIG. 12 will be described using the explanatory diagram (part 1) of the program start of the embodiment of the present invention of FIG. 6 and the explanatory diagram (part 2) of the program start of the embodiment of the present invention of FIG. The state of starting a program based on the sequential tree will be described. First, the tree activation unit 58 activates nodes A and B having no link from the beginning in parallel. The double circle in (a) of FIG. 6 indicates that it has been activated (similar in FIGS. 6 and 7). Thereafter, if A is completed first, the links A → C, A → D, A → E, and A → H are cut, and as a result, the nodes C and H having no other links are activated. The state at this time is shown in FIG. Thereafter, when the activation of B is completed, the links of B → D, B → E, and B → G are pruned, and as a result, the nodes D and E having no other links are activated in parallel. The state at this time is shown in FIG.

Thereafter, when the activation of E is completed, the link of E → G is reaped, and as a result, the node G having no other link is activated. This is shown in FIG. After that, when D is started, the link from D to F is reaped. However, since there is no node in which no other link has been lost, the next start is waited for. The state at this time is shown in FIG.
(E) of FIG.

Thereafter, when the activation of C is completed, the link of C → F is reaped, and as a result, the node F having no other link is activated. The state at this time is shown in FIG.
Shown in Thereafter, when the activation of the node H is completed, the link of H → J is cut, and as a result, the node J having no other link is activated. The state at this time is shown in FIG.

Thereafter, when the activation of G is completed, since there is no link extended from G, the next activation is waited for, and when J is activated, there is no link extended from J, so that the next activation is completed. When F has been started, all programs have been started and the system has been started.

As described above, a program that can be activated is instructed to be activated multiple times. However, in a system capable of multiplex processing, the activation of the program is also performed multiple times, so that the activation is not performed sequentially. Can be started in a short time. Therefore, the entire startup time is reduced.

Starting when a new program is introduced
The mechanism for updating the order setting information is specifically described below.
I will tell. FIG. 8 is a configuration diagram of an embodiment of the program installation system of the present invention. In the figure, reference numeral 1 denotes a program providing medium which records a program name table 11 and a prerequisite program name list 12 together with a program 13a described in an executable form.

Reference numeral 11 denotes a program name table, which is a table of names of programs recorded on the program providing medium 1, and reference numeral 12 denotes a list of prerequisite programs, the start of which must be completed before the start of the program. The name of a program to be recorded is recorded. Reference numeral 13a denotes a program, which describes a program to be executed by the computer system in an executable form.

Reference numeral 3 denotes a program introduction unit, which stores a program necessary for the computer system in a program providing medium 1.
When installing from the
Is stored as a part of the program 13b. Reference numeral 38 denotes a tree updating unit. When the program introducing unit 3 incorporates the program from the program providing medium 1, the tree updating unit 38 simultaneously reads the program name table 11 and the prerequisite program name list 12. Then, the installation program is additionally updated in the boot order setting information 22. In addition, the components having the same reference numerals as those in FIG. 2 are the same.

In the present invention, a program which must be already started when a certain program is started is prepared for each program as a prerequisite program name list 12, and a program name table 11 and a program 13a described in an execution format are prepared.
And stored in the program providing medium 1.

FIG. 3B is a flowchart of the operation of the CPU according to the embodiment of the present invention. FIG. In step 88, the program introduction unit 3 is started as one of the application programs, and
At 89, the program introduction unit 3 reads the message 6. Next, the tree updating unit 38 is activated.

When reading the program providing medium 1 and introducing the program into the computer system, the tree updating unit 38 of the program introducing unit 3 transfers and stores the program 13a described in the executable form as the program 13b to the mass storage device 2. At the same time, the transferred program is added as a node to the boot order setting information 22, a program name in the prerequisite program name list 12 is searched, and a link to the node is established, so that the boot order setting information 22 is Update.

As described above, when the program providing medium 1 is introduced into the computer system, the optimum boot sequence can be automatically determined. When a plurality of programs are introduced, the above operation of the tree updating unit 38 is repeated for each program.

FIG. 9 is an explanatory diagram of updating the startup order setting information according to the embodiment of the present invention. The program providing medium 1 is a program name table representing programs recorded on the medium.
11, a prerequisite program name list 12 listing names of programs that must be already started when the program is started, and a program 13 described in an executable form
a is integrally recorded on a medium such as a magnetic tape or a floppy disk. As long as the program name table 11, the prerequisite program name list 12, and the program 13a described in the execution form are integrated, the form of the present invention is not limited. Further, the type of recording medium does not matter.

The start order setting information includes nodes (A, B, C, D, E, F, G, X) having the same name corresponding to each program to be started.
And a link that connects the nodes, and any expression method may be used as long as the relation of the premise of starting the program is represented by the direction of the link. The medium to be recorded may be other than the mass storage device as long as it can be used at the time of starting the system.

Here, an example will be described in which a program newly provided by a program providing medium is incorporated in the boot order setting information as shown in FIG. In FIG. 9, first, based on the description in the program name table 11, the node X
(Step 81), and then link A to X based on the prerequisite program name list 12 (step 82).
Similarly, a link is provided from C to X (step 83) and a link is provided from D to X (step 84), and the updating of the boot order setting information is completed.

FIG. 10 is a flowchart of the process performed by the tree updating unit. The tree updating unit 38 instructed to install the program of the program providing medium 1 reads the start order setting information 22 up to that point (step 301), reads the program providing medium 1 and writes the program described in an executable form. 13
a as the target program 13b (step
302), a new node of the program to be introduced is added to the boot order setting information 22 (step 303).

Next, in order to establish a link indicating the prerequisite relationship for starting the program, one prerequisite program name is extracted from the prerequisite program name list 12 of the program to be introduced (step 304), and A node having the prerequisite program name is searched (step 306), and a link is established from the node to the new node (step 307).
By repeating steps 304 to 307 until the prerequisite program name is exhausted, a link indicating the prerequisite relations for all boots is established, the update of the boot order setting information 22 is completed (step 305), and the updated boot order By writing the setting information 22, the incorporation of the program into the system is completed (step 308).

[0051]

As described above, according to the present invention,
When the necessary programs are installed, the boot order is automatically determined, and when the system is started, the computer system can be started in the shortest time by starting the programs that can be started one after another in parallel and maximizing the parallel processing. This greatly contributes to the improvement of services provided by computer systems.

In addition, since the program designer prepares the prerequisite program list, the optimum starting order is automatically determined when the program is incorporated into the system, so that the work load of the system designer can be reduced. It also greatly contributes to.

[Brief description of the drawings]

FIG. 1 is a principle diagram of the present invention.

FIG. 2 is a configuration diagram of a program starting method according to an embodiment of the present invention;

FIG. 3 is an operation flowchart of a CPU according to an embodiment of the present invention.

FIG. 4 is a flowchart of a tree starting unit (part 1).

FIG. 5 is a flowchart of a tree activation unit (part 2).

FIG. 6 is an explanatory diagram (part 1) of starting a program according to the embodiment of the present invention.

FIG. 7 is an explanatory diagram (part 2) of starting a program according to the embodiment of the present invention.

FIG. 8 is a configuration diagram of an embodiment of a program installation method according to the present invention.

FIG. 9 is an explanatory diagram of updating the startup order setting information according to the embodiment of this invention.

FIG. 10 is a processing flowchart of a tree updating unit;

FIG. 11 is an explanatory diagram of a program starting method of a conventional computer system.

FIG. 12 is an explanatory diagram of startup order setting information indicating a startup dependency of a program;

[Explanation of symbols]

1, 1a Program providing medium 11 Program name table 12 Prerequisite program name list 13a, 13b,
13c program 2 large-capacity storage device 21 tier-specific program table 211 OS layer program table 212 package layer program table 22 start order setting information 3, 3a program introduction unit 31 updating means 38 tree update unit 4 main memory 5, 5a program start unit 51 Starting means 58 Tree starting part 6 Message 81-84, 301-308, 501-512 Processing steps

Claims (1)

(57) [Claims] 1. A large-capacity storage device for performing large-capacity storage.
Transfers multiple stored programs to main memory for execution
Program name table in which program names are described in a computer system
Program provider that stores the contents of the program
From a large-capacity storage device that performs the large-capacity storage.
A program introduction unit for transferring and storing programs, and starting each program in the mass storage device.
Sometimes with other programs that must already be running
In addition to providing start order setting information indicating dependency, the program provider is provided with a
Other program names that must already be started
A list of prerequisite programs, which is a list, and the program
When introducing the program, the prerequisite program name list
Based on the above, add the installation program to the boot order setting information
Update means for newly adding a dependency relationship, and the pre-
Update the boot order setting information based on the ram name list.
And a computer system.