JPH05250168A - Program startup method and program installation method - Google Patents

Abstract

(57) [Summary] [Purpose] With regard to the program start-up method, the purpose is to minimize the start-up time of the computer system and at the same time reduce the burden on the system designer. [Configuration] Program stored in mass storage device 2
In the program start-up method of the computer system having the program start-up section 5 for transferring and copying 13b to the main memory 4 and starting the program, another program that has already been started at the time of starting each program in the mass storage device 2 By providing the starting order setting information 22 indicating the dependency relationship with the program and the starting means 51 for starting the program according to the dependency relationship described in the starting order setting tree 22 in the program starting unit 5, the program starting section 5 The activation means is configured to activate the program according to the dependency described in the activation order setting information.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a program starting method and a program installing method. In recent years, an automatic service terminal including a computer such as an automatic depositing / dispensing machine of a bank has been increasing, but such a device may be stopped and restarted due to supply of bills. However, in order to reduce customer latency during this time, the computer system needs to be booted in the shortest possible time.

[0002]

2. Description of the Related Art Conventionally, when a computer system is started, a program is started in a predetermined starting order. It has been determined that the program of the base layer is started up before the program of the next layer is started based on the layer of the program such as the OS, the package, and the application program.

FIG. 11 is an explanatory diagram of a conventional computer system program starting method. In the figure, 1a is a program providing medium such as a floppy disk in which a program name table 11 and a program 13a described in an execution format are stored. 11
Is a program name table, which is a table of the names of provided programs. Reference numeral 13a is a program, which is described in an execution format. A mass storage device 2 is composed of 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 mass storage device 2, and transferred to the main memory by the program starting unit 5a to be executed. Reference numeral 21 is a hierarchy-specific program table, which is held in the mass storage device 2 and is a list of programs belonging to each of a plurality of program hierarchies (OS layer, package layer, etc.). Reference numeral 211 denotes an OS layer program table, which 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 and stores the required program 13a from the program providing medium 1a into the mass storage device 2, and corresponds to the program hierarchy described in the program name table 11. The name is added to the hierarchical program table 21.

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

The operation in the figure will be described. First, when the program is installed, the system installation unit 3a transfers or stores all or part of the program 13a stored in the program providing medium 1a in the mass storage device 2 in accordance with the message 6 given from the operator console, and The name of each program is added to the hierarchical program list 21 corresponding to the program hierarchy described in the name table 11. Each program is classified so as to belong to any hierarchy, and is recorded in the hierarchy-based program table of any hierarchy.

At the start of work, the program activation unit 5a activates a program belonging to the OS layer program table 211 to which the most basic program of the hierarchical program table 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. In this way, after sequentially starting all the programs belonging to the lower layer, the programs in the next layer are started, and all the programs are started.

However, since the system has become complicated and various packages and various application programs have been installed in the same computer system, the program having the longest startup time in each layer causes the next layer to be activated. The phenomenon that the startup was delayed occurred.

[0010]

Therefore, when a plurality of business programs are installed in one computer system, it takes time to start the programs in the lower layers necessary for another business. There was a problem that the work start time of another work that did not require the program of the other layer was delayed.

FIG. 12 is an explanatory diagram of a problem in starting a conventional program. In the figure, A, B, C, ..., J are programs, and programs A and B belong to the OS layer,
Program H belongs to the server layer, and programs C, D, 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 belongs to the offline business system. belong to.

Further, the program A and the program B are programs that do not have a condition that other programs are started, the program C is assumed to start the program A, and the program D is set to the program A. And program B are assumed to be started.

The program E is also the same as the program A.
And program B are assumed to be started, program F is assumed to be program C and program D to be started, program G is assumed to be program B and program E to be started, program H is assumed to be program A to be started, and program J is Indicates that the program H is assumed to be activated. The arrow in the figure shows the premise of activation. Therefore, only the program that does not receive the arrow can be started without assuming that another program is started.

Here, when activating the programs F, G, and J, conventionally, all the programs A, B, H, and J belonging to the OS layer are activated first, and then the program H belonging to the server layer is activated. Next, all the programs C, D and E belonging to the package layer are started, and the programs F, G and J are started on condition that all of them are started.

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

Therefore, although the program H is not a prerequisite for the programs C, D, and E to start,
Until the start of this program H is completed, program C,
The activation of D and E is delayed. Similarly, for the program J, although the programs C, D, and E are not prerequisites for activation, they are lower-level (package layer) programs required by another business system, and therefore these programs C, D, and E The start of the program J is delayed until the start of D and E is completed.

Therefore, the programs C, D, E, etc. are grouped by grouping the programs having a dependency relationship of program activation and determining the activation order for each group.
It is conceivable to start H at the same time to minimize the total starting time. However, the actual computer system startup dependency is complicated, and the processing time required to start each program also varies widely, so that the system setter can determine the efficient program startup order. Requires a great deal of labor and in-depth knowledge of the start-up dependency of each program and the time required for the start-up.

According to the present invention, the starting order of the programs incorporated in the computer system is automatically determined to be the most efficient order, and the programs that can be started are started by the maximum parallel processing, thereby making the computer It is an object of the present invention to provide a means for minimizing the system startup time and at the same time reducing the burden on the system designer.

[0019]

The above problems can be solved by a program starting method configured as follows.
FIG. 1 is a principle diagram of the present invention.

In a program starting method of a computer system having a program starting unit 5 for transferring a plurality of programs 13b stored in a large capacity storage device 2 for storing a large capacity to a main memory 4 and starting the program, Storage device
In addition to the start order setting information 22 indicating the dependency relationship with other programs that must already be started at the time of starting each program, the program start unit 5
Further, by providing the starting means 51 for starting the program according to the dependency described in the starting order setting information 22, the starting means starts the program according to the dependency described in the starting order setting information 22 when the program is started. Configure to boot.

[0021]

The boot order setting information 22 provided in the mass storage device 2 indicates a dependency relationship with other programs which must be already started when each program is started.

Starting means provided in the program starting unit 5
51, if there is a program that satisfies the dependency relationship described in the startup order setting information 22, even if a program that is not required by the program is not started in the lower hierarchy, the program is started without waiting for it To do.

Therefore, even if all the programs belonging to the lower hierarchy are not activated as in the conventional case, only the necessary programs are activated, and at that time, the activation means 51 activates the activation order setting information.
Since the program can be started with the maximum number of parallel operations allowed within the range of the dependency described in 22, the start time can be started in the shortest time.

[0024]

BEST MODE FOR CARRYING OUT THE INVENTION The present invention is designed so that the order of activating programs incorporated in a computer system is such that the programs are activated by parallel processing with attention paid to the dependency relationship of the activation of the programs, and the programs are activated in the shortest time.
Therefore, when the respective programs are activated, the activation order setting information indicating the dependency relationship with other programs that must be already activated is provided, and the programs are activated in accordance with the activation order setting information. FIG. 12 is an explanatory diagram of the problem of starting the conventional program.
It is a diagram of a tree structure showing the starting dependency relationship of C, D, E, F, G, H, J, and such a structure is referred to as starting order setting information. The startup order setting information has a tree structure in which each of the programs installed in the computer system is represented by one node, and a link is created between the nodes, and the relationship of the prerequisites for starting the program is represented by the direction of the link. ing. For example, in the figure, programs A and B are programs that do not have a pre-start condition, program C has program A as a pre-start condition, and program D
Is premised on starting programs A and B, program E is premised on starting programs A and B, program F is premising on programs C and D, and program G is on programs B and B. A relationship is shown in which E is assumed to be started, program H is assumed to be program A started, and program J is assumed to be program H started. The arrow in the figure shows the premise of activation. Therefore, only the program that does not receive the arrow can be started without assuming that another program is started.

FIG. 2 is a block diagram of the program starting system according to the embodiment of the present invention. In the figure, 2 is a mass storage device, which is a program installed in a computer system.
13b and boot order setting information 22 are stored.

Reference numeral 13b is a program, which is transferred to the main memory 4 for execution, and 22 is startup order setting information, which records the startup order of the programs installed 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 memory 4 to start the program, and 58 denotes a tree starting unit, which stores the program in the large-capacity storage device 2. The stored boot order setting information 22 is read to determine the programs that can be booted, and the mass storage device 2
Is selected from the programs 13b stored in the program 13c, transferred to the main memory 4 as the program 13c, and started. When the started program 13c notifies the completion, the program that can be started And start it in the same way. By repeating this,
It launches all the built-in programs. The same reference numerals denote the same components throughout the drawings.

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

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

As described above, when the computer system is started up, all the programs are started immediately when the program can be started up. In time, all program launches can be completed.

FIG. 4 shows a processing flow chart (No. 1) of the tree starting unit, and FIG. 5 shows a processing flow chart (No. 2) of the tree starting unit. When the computer system is activated, the tree activation unit 58 reads the activation 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 from others (step 504), and the program corresponding to the node that is not linked from others (Step 505). Repeat steps 502 to 505 until all nodes are checked (step 50
3) First, start all the programs that can be started.

After that, the tree activation unit 58 waits for the activation completion notification from the activated program 13c (step 506),
If there are still programs to launch (step 50
7), take out the link from the node corresponding to the program that has been started (step 508), cut the extracted link (step 510), and the node stretched by the link has no other links. In that case (step 511), the program corresponding to the node is started (step 512).

As described above, steps 508 to 512 are repeated for all the links extending from the node corresponding to the completed program (step 509), and all programs that can be started by the completion of the completed program are started. To do.

When the start completion notice is received and there is no program left to be started (step 507), the program starting section ends. Here, using the explanatory diagram (part 1) of the program activation of the embodiment of the present invention of FIG. 6 and the explanatory diagram (part 2) of the program activation of the embodiment of the present invention of FIG. 7, the activation shown in FIG. How the program is started based on the sequential tree will be described. First, the tree activation unit 58 activates the nodes A and B that have no other links from the beginning in parallel. The double circle in FIG. 6 (a) indicates that it has been activated (similar in FIGS. 6 and 7). After that, when A completes the activation first, the links A → C, A → D, A → E, and A → H are pruned, and as a result, the nodes C and H that have no other links are activated. The state at this time is shown in FIG. After that, when B is completely activated, the links B → D, B → E, and B → G are cut off, and as a result, the nodes D and E that have no other links are activated in parallel. The state at this time is shown in FIG.

After that, when E is completely activated, the link E → G is cut off, and as a result, the node G, which has no other links, is activated. This is (d) in the figure. After this, when D is completely activated, the link D → F is cut, but there is no node with no links from other nodes, so the next activation is awaited. The state at this time is shown in FIG.
(E).

After that, when C is completely activated, the link of C → F is cut off, and as a result, the node F which has no other links is activated. The state at this time is shown in FIG.
Shown in. After that, when the node H is completely activated, the link of H → J is cut off, and as a result, the node J having no other link is activated. The state at this time is shown in FIG.

After that, when G is completely activated, there is no link extended from G, so waiting for the completion of the next activation, and when J is activated, there is no link extended from J, so the next activation is completed. Wait for F, and when F is completely activated, all programs are activated and the system is activated.

As described above, programs that can be activated are instructed to be activated in a multiple manner, but in a system capable of multiple processing, the activation of programs is also performed in a multiple manner, so rather than executing them sequentially. Can be started in a short time. Therefore, the entire startup time is shortened.

The invention according to claim 2 relates to a mechanism for updating the boot order setting information when a new program is introduced. FIG. 8 is a block diagram of an embodiment of the program installation method 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 execution format.

Reference numeral 11 is a program name table, which is a table of program names recorded in the program providing medium 1, and 12 is a prerequisite program name list, which must be completed before starting the program. The name of the program that must be recorded is recorded, and 13a is the program, which describes the program executed by the computer system in the execution format.

Reference numeral 3 denotes a program introduction unit, which provides the program necessary for the computer system with the program providing medium 1.
Program 13a to the mass storage device 2 when installing from
Is stored as a part of the program 13b, and 38 is a tree updating unit. When the program introducing unit 3 incorporates from the program providing medium 1, at the same time, the program name table 11 and the prerequisite program name list 12 are used. In addition, the installation program is additionally updated in the startup order setting information 22. In addition, the same reference numerals as those in FIG. 2 are the same.

In the present invention, a program that needs to be already started when a certain program is started is prepared for each program as the prerequisite program name list 12, and the program name table 11 and the program 13a described in the execution format are prepared.
It is stored in the program providing medium 1 as a pair.

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

When the program update unit 38 of the program introduction unit 3 reads the program providing medium 1 and introduces the program into the computer system, the program 13a described in the execution format is transferred and stored in the mass storage device 2 as the program 13b. At the same time, the transferred program is added to the boot order setting information 22 as a node, the program name in the prerequisite program name list 12 is searched, and a link to the node is created, thereby setting the boot order setting information 22. Update.

As described above, when the program providing medium 1 is installed in the computer system, the optimum boot order 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 boot order setting information according to the embodiment of this invention. The program providing medium 1 is a program name table showing the programs recorded on the medium.
11, a prerequisite program name list 12 that enumerates the names of programs that must already be started when the program is started, and a program 13 that is written in the execution format
It is recorded on a medium such as a magnetic tape or a floppy disk by integrating a. As long as the program name table 11, the prerequisite program name list 12, and the program 13a described in the execution format are integrated, the format of the present invention does not matter. Also, the type of recording medium does not matter.

The start order setting information is the node (A, B, C, D, E, F, G, X) having the same name corresponding to each program to be started.
And a link connecting each node, and any expression method may be used as long as the relationship of the premise of program activation is represented by the direction of the link. Further, the recording medium may be other than the mass storage device as long as it can be used when the system is started.

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

FIG. 10 shows a processing flowchart of the tree updating unit. The tree update unit 38 instructed to install the program of the program providing medium 1 reads the boot order setting information 22 up to that point (step 301), reads the program providing medium 1, and writes the program described in the execution format. 13
Copy a as the program to be started 13b (step
302), the 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 preconditions for starting the program, one name of the precondition program is taken out from the precondition program name list 12 of the program to be introduced (step 304), and the relevant start sequence setting information 22 is selected. 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, links indicating all prerequisites for starting are set, the update of the boot order setting information 22 is completed (step 305), and the updated boot order is set. Writing the setting information 22 completes the installation of the program in the system (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 programs that can be started are started in parallel one after another, and the maximum parallel processing is performed, so that the computer system is started in the shortest time. Therefore, it greatly contributes to the improvement of service by the computer system.

Further, since the designer of the program creates the prerequisite program list, the optimum starting order is automatically determined when the programs are installed in the system, thus reducing the workload of the system designer. There is a big contribution to

[Brief description of 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 the CPU according to the embodiment of the present invention.

[Fig. 4] Flowchart of the tree starting unit (No. 1)

FIG. 5: Flowchart of tree activation part (Part 2)

FIG. 6 is an explanatory diagram (1) of program activation according to the embodiment of this invention.

FIG. 7 is an explanatory diagram (part 2) of program activation according to the embodiment of this invention.

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

FIG. 9 is an explanatory diagram of updating the boot 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 boot order setting information indicating the boot dependency of programs.

[Explanation of symbols]

1, 1a Program providing medium 11 Program name table 12 Prerequisite program name list 13a, 13b,
13c Program 2 Mass storage device 21 Hierarchical program table 211 OS layer program table 212 Package layer program table 22 Startup order setting information 3, 3a Program introduction section 31 Updating means 38 Tree updating section 4 Main memory 5, 5a Program starting section 51 Starting means 58 Tree starting part 6 Message 81-84, 301-308, 501-512 Processing step

Claims (2)

[Claims] 1. A mass storage device for mass storage (2)
In a program starting method of a computer system having a program starting unit (5) for transferring a plurality of programs (13b) stored in the main memory (4) and starting the program, the mass storage device (2) stores The startup order setting information (22) that indicates the dependency relationship with other programs that must already be started when each program is started is provided, and the startup order setting information (22) is set in the program startup section (5). Starting means for starting programs according to the described dependencies
By providing (51) and, when the program is started, the starting means sets the starting order setting information (2
A program start method characterized by starting a program according to the dependency described in 2). 2. The mass storage device from a program providing medium (1) in which a program name table (11) in which program names are described and the contents of the program (13a) are stored.
Program introduction part that transfers and stores the program in (2) (3)
In the program installation method having the following, in the program providing medium (1), a prerequisite program name list (12) which is a list of names of other programs that must be already started at the time of starting each program, and the program installation When installing a program from the program distribution medium (1) into Part (3), list of prerequisite program names
By providing the updating means (31) for adding the introduction program to the boot order setting information (22) based on (12) and adding a new dependency, the prerequisite program is introduced by the updating means when the program is introduced. A program installation method characterized by updating the boot order setting information (22) based on the name list (12).