JPS5850057A - Management system for shared file - Google Patents

Abstract

PURPOSE:To use a required shared file by the indication of a file name from a computer, by providing a storage circuit for management of the shared file to a node processor, and using in common this storage circuit to register the computer address and the file name together. CONSTITUTION:Files AA-NN are connected to plural processors A-N, and a node processor NP is connected to processors A-N, and plural terminal equipments A0-Ah...N0-Ni are connected to respective processors A-N. This node processor NP is provided with interface parts 1-1-1-1n, a program storage memory PM connected to a CPU, a system table memory STM, and a storage circuit CFM which manages shared files. This circuit CFM consists of a shared file area table and a shared file management table. Computer addresses and file names are registered together in the circuit CFM, and a required shared file is used by the indication of a file name from a computer.

Description

[Detailed Description of the Invention] The present invention relates to a shared file management method, and in particular registers a shared 7eye μ in a node processor so that each computer can use a desired shared file by simply specifying the file name. Concerning improvements to shared file management methods.

In the summer, a computer system with multiple terminal devices connected is configured with multiple systems, and each calculation is performed via a node processor.
(hereinafter referred to as processor) is a system in which each terminal device commonly uses a file as shown in @1. Each of the multiple processors tA to N is a file A.
A to NN, each processor to N is connected to a node processor fNP, and each processor to N has a plurality of terminal devices Ao to Ah, N, respectively.

to N1. In the above system, for example, the terminal device Be connects the fiber fi/AA to the shared fiber μ.
If you try to use it as Terminal Bo is Processera fA.
Specify the address and file AA name, or
There are two methods of providing the BK file AA. The former is inconvenient for the user, and the latter has the disadvantage of increasing equipment costs since it is necessary to provide a shared file for all files μ, and in any case, it also increases the processing load of the processor.

The present invention has been made in view of the above-mentioned drawbacks, and an object of the present invention is to provide a shared file μ management system that allows users to easily handle and use shared files without increasing equipment costs. It is.

To briefly explain the present invention, the node processor is equipped with a storage circuit, and the address and file name of a computer to be shared is registered in the storage circuit for shared use, and the shared file is used by a file name instruction from the computer. It is characterized by:

Preferred specific examples for carrying out the present invention will be described in detail below with reference to the drawings. Prior to describing the embodiments, the packet format used in the present invention will be explained. FIG. 2 is a schematic diagram showing the packet format, and only the parts related to the present invention are shown.

In the figure, l is a flag indicating the beginning of the packet, and 2 is a partner processor and a node processor t.

3 indicates the source processor and node processor, 4 indicates an instruction, S indicates data, and 6 indicates a flag indicating the end of the packet. .

FIG. 3 is a schematic diagram illustrating a communication V-enable for shared file transfer, showing the shared tour management method of the present invention. The embodiment will be explained with reference to FIG. 4 and FIG.

When the end device [Ao on the user side] registers the file A'AA as the shared file I, the end device @ Ao requests registration from the processor A, as shown in FIG. Processor A, which received the request, uses the packet format described above to send the first flag, the other party's processor NP, the shared file registration as an instruction to the source processor A, and file μ name file *A.
A. Create a transfer packet in the order of the final flag and send it to the node.
Instructs processor NPK shared file μ registration. Which node processor received this packet? The NP (Fig. 3) receives the packet via the processor interface 1G-1, detects the leading flag, and stores the following data in the storage time %CFM for shared file management of the present invention as shown in the table below. urge

The difference between the present invention and the conventional one is that this memory circuit CFM is provided and stored as shown in the table above, and this memory circuit CF
The key point is to add a function for operating M to the program memory P-M and the V stem tape μ/memo 9STM. Upon completion of the storage, the processing unit fcPU allows the node 9 processor NP to complete the shared file μ registration and notifies the processor A of the completion via the node 9 and the processor interface 1G-1. The registration of the shared 7eye A/AA is completed with respect to the processor AU terminal device ^O, and the message and message are sent to complete the registration. A case in which the terminal device Bo uses the shared network A/AA registered as described above will be explained based on FIG. 5. When the user using terminal device B sends a transfer request to processor B to transfer the shared file μAA, processor tB sends a packet, that is, a head flag, to the node processor NP, and the other node processor NP.
, sender 7'a set iB, shared file N transfer as an instruction, file μ name AA as data, and M end flag in this order. Node processor NP that received this packet F
searches the memory circuit CFM and returns the file name A A KJt
J& extracts processor address A and instructs processor AK to transmit shared file A/AA. That is, the order is the head flag, the other racer A, the shared file transfer as the source node/precessor A1 instruction, the file name AA and destination processor B as data, and the final flag.

Processor A then transfers File A/AA to node processor? Transmit phi μ to processor B via NP. The contents of this packet are the head flag, the destination is processor B, the source is precessor A1, the instruction is file transfer, and the data is the contents of file μAA. The above communication V-en is supported by the program control added based on the present invention of the program memory P-M. It is convenient for the user to use the shared 7-iP, and it is also an inexpensive shared management method that only requires a storage circuit as an equipment cost.If the present invention is applied to the data transfer V-step, it will improve operational convenience and equipment. This is extremely effective in reducing costs.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the V stem configuration to which the present invention is applied, FIG. 42 is a schematic diagram showing the packet format, FIG. 3 is a block diagram of an embodiment showing the shared file management method of the present invention, The fifth factor in FIG. 4 is a schematic diagram showing a communication V-ken for shared file transfer. In the figure, person to N are processors, AA to NN are files, CFM is a storage circuit for shared management, and NP is a node processor. Figure 1 Figure 2 Figure 3 i1%40 1rjtwvA
J+fRJNP Figure 5

Claims (1)

[Claims] A node processor with data exchange 41 &
According to a shared file management method in which several computers are connected and shared files of each computer are jointly used, the node processor is provided with a storage circuit for managing the shared file, and the computer has a computer address and 774 to 774. A shared file management system characterized in that a name is registered in the storage circuit for shared use, and a corresponding required shared file is used according to an instruction of the file name from the computer.