JPH0351949A - End system for computer network system - Google Patents

Abstract

PURPOSE:To simply and surely end the operations of all computers by preparing an end request means, an answer process means, an answer return means, an end means, an end request acceptance means, etc., and by giving an end instruction to a single computer only. CONSTITUTION:An end request acceptance means 5 accepts an end request from a master node computer. A node position recognizing means 6 checks whether a slave node contains a computer or not based on the node information stored in a node position information storage means 7. If so, an end request means 1 gives the end requests to the computers of all slave nodes. When an answer process means 2 receives the answers from all slave nodes, an answer return means 3 sends an answer of the end request to the master node computer. Then an end means 4 ends the operation of the computer. Thus it is possible to simply and surely end the operations of all follower computers just by giving an end instruction to a single computer only.

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Field of Application] The present invention is applied to a computer network system. The present invention relates to a method for reliably terminating computer processors constituting a computer network system in an orderly manner.

〔overview〕

The present invention is a method for terminating a computer network system composed of a plurality of computers connected via a communication line, in which a user simply gives a termination instruction to one computer to configure a computer network under that computer. By making it possible to shut down all computers easily and reliably, it eliminates operational errors associated with shutting down individual systems and reduces manpower.

[Conventional technology]

Conventionally, in order to terminate a computer network system, the system was terminated by performing a termination operation on each individual system.

[Problem that the invention seeks to solve]

Terminating the conventional system described above requires time and effort because the system termination operation must be performed on each individual system that makes up the computer network.
There is a possibility that a system may not be terminated due to an erroneous operation, and it is also difficult to tell whether the system has been terminated or not.

The present invention aims to eliminate such drawbacks and provides a method that can reliably terminate each computer that makes up a computer network system by simply giving a termination instruction to one computer.

[Means for solving problems]

The present invention provides a termination method for a computer network system constituted by a plurality of computers connected via a communication line, wherein the plurality of computers are provided with node position information storage means for storing node information of the computer network in advance. a termination request receiving means for accepting a termination request from a parent node computer; and a termination request receiving means that receives a termination request from a child node computer based on the node information stored in the node position information storage means when the termination request receiving means receives a termination request. a node position recognition means for checking whether the node position recognition means exists; and a response return means for sending a response to the termination request to the parent node computer when the child node computer does not exist by checking the node position recognition means. , termination means for terminating the computer by sending a response from the response return means, and termination request means for transmitting a termination request to all computers of the child node when a child node computer exists according to a check by the node position recognition means. and a response process that receives responses to the termination request from all the computers of the child nodes, sends a response to the termination request to the parent node computer when the parent node computer exists, and causes the termination means to terminate the computer. ? It is characterized by comprising means.

[Effect]

Upon receiving the termination request from the parent node computer, the node location information system checks whether or not a child node computer exists based on the node information of the computer network stored in the storage means. If it does not exist, a response to the termination request is sent to the parent node computer to terminate the computer's operation. If child node computers exist, the combination immediately requests termination to all child node computers, waits for responses to the termination request, and receives responses to the termination request from all child nodes. If a parent node computer exists, a response to the termination request is sent to the parent node computer to cause the computer to terminate.

In this way, all the computers that make up a computer network can be easily and reliably shut down simply by the user giving a termination instruction to one computer, thereby eliminating copying errors and reducing manpower. .

〔Example〕

Next, embodiments of the present invention will be described based on the drawings.

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

The embodiment of the present invention has a plurality of computers connected via a communication line. Each computer of the computer network system configured overnight is provided with node position information storage means 7 for storing node information of the computer network in advance, and termination request receiving means 5 for accepting termination requests from the parent node computer. ,
a node position recognition means 6 for checking whether a child node computer exists based on the node information stored in the node position information storage means 7 when the termination request receiving means 5 receives the termination request; When the node position recognition means 6 checks that the child node computer does not exist, the response return means 3 sends a response to the termination request to the parent node computer, and the response return means 3 sends a response to terminate the computer. termination means 4; termination request means 1 for sending a termination request to all computers of the child node when a child node computer exists according to a check by the node position recognition means 6; a response processing means 2 which receives a response to the termination request and sends a response to the termination request to the parent node computer when the parent node computer exists, causing the termination means 4 to terminate the combination. Be prepared.

Next, the operation of the embodiment of the present invention structured as described above will be explained.

FIG. 2 is an explanatory diagram showing the relationship between parent nodes and child nodes. When focusing on computer B, B's parent node computer is A, and B's child node computer is C.
,D,F. In such a relationship, FIG. 3 shows an example of a computer network system in which a user can directly issue a termination instruction to the termination request receiving means 5 from the computer CO.

FIG. 4 is a flowchart showing the processing flow of the termination request accepting means 5 according to the embodiment of the present invention, FIG. 5 is a flowchart showing the processing flow of the node position recognition means according to the embodiment of the invention, and FIG. 6 is a flowchart showing the processing flow of the termination request receiving means 5 according to the embodiment of the present invention. 12 is a flowchart showing the processing flow of an example response return means.

When the user instructs the computer CO to terminate the computer network, the termination request receiving means 5 of the computer CO receives the termination instruction.6 If the termination request receiving means 5 has already accepted the termination request, the termination request receiving means 5 controls the response returning means 3. give. If the termination request has not been accepted,
In other words, if it is the first termination request, the node position recognition means 6
checks whether a node computer exists based on the information stored in the node location information storage means 7. If the child node computer does not exist, control is passed to the response return means 3.

If a child node computer exists, control is passed to termination requesting means 1, and since C1 exists in computer CO as a child node computer, termination requesting means 1 is passed.
sends a termination request to all child node computers over the line.

In the case shown in FIG. 3, a termination request is sent from computer CO to computer Cl. When the termination request means 1 finishes transmitting the termination request to the child node combinations overnight, it passes the processing to the response processing means 2, waits for responses from the child node computers, and receives responses from all child node computers. The process is transferred to the response return means 3 either at the time of the request or when a certain period of time has elapsed. At this time, any child node computer that does not receive a response within a certain period of time is considered to have already stopped operating.

The response return means 3 checks whether or not a parent node exists based on the information stored in the node position information storage means 7, and if the parent node exists and a termination request has been received from the parent node, the parent node A response to the termination request is returned to the node and the processing is passed to the termination means 4. If the parent node does not exist, or even if the parent node exists but the termination request has not been received from the parent node, the process is transferred to the termination means 4 without responding to the termination request. Termination means 4
terminates the computer system after performing the processing necessary for termination.

By applying the above algorithm to all the computers in the computer network system shown in FIG. 3, the computers that make up the computer network system are C5, C4, C2 or C3, C2.
Or end in the order of C3, C1, CO.

〔Effect of the invention〕

As explained above, according to the present invention, all computers making up a computer network can be easily and reliably terminated simply by the user giving a termination instruction to one computer. This has the effect of eliminating operational errors and reducing manpower.

4.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention. FIG. 2 is an explanatory diagram showing the relationship between parent nodes and child nodes. FIG. 3 is a diagram showing a computer network according to an embodiment of the present invention. FIG. 4 is a flowchart showing the processing flow of the termination request receiving means according to the embodiment of the present invention. FIG. 5 is a flowchart showing the processing flow of the node position recognition means according to the embodiment of the present invention. FIG. 6 is a flowchart showing the processing flow of the response return means according to the embodiment of the present invention. 1... Termination request means, 2... Response processing means, 3...
- Response return means, 4... Termination means, 5... Termination request receptionist, 6... Node position recognition means, 7... Node position information storage means.

Claims (1)

[Scope of Claims] 1. In a termination method for a computer network system constituted by a plurality of computers connected via a communication line, the plurality of computers include node position information storage in which node information of the computer network is stored in advance. A termination request receiving means receives a termination request from a parent node computer, and when the termination request receiving means receives a termination request, the termination request receiving means receives a termination request based on the node information stored in the node position information storage means. Node position recognition means for checking whether or not a child node computer exists; and a response for sending a response to the termination request to the parent node computer when the child node computer does not exist as a result of checking by the node position recognition means. a return means; a termination means for terminating the computer by sending a response from the response return means; and a termination request for sending a termination request to all child node computers when a child node computer exists according to a check of the node position recognition means. Termination requesting means; receiving responses to the termination request from all computers of the child nodes; when a parent node computer exists, transmitting a response to the termination request to the parent node computer; and causing the termination means to terminate the computer. A method for terminating a computer network system, comprising: a response processing means for terminating a computer network system.