JPH06332625A - Data multiplexing method for file and data processing system - Google Patents

Abstract

PURPOSE:To provide the file system which has high performance, and also, whose necessary storage capacity is small, in the data processing system to which many disk drive devices are connected. CONSTITUTION:When a file is opened, data of the whole or partial area of its file is multiplexed and distributed and arranged in plural drives 7-12, and when this file is closed, multiplexed data of the file is erased. By doing like this among the multiplexed data, data which is short in an access time, or data which is short in a transfer time by striping, can be selected and accessed, therefore, the file system can be allowed to have high performance. Also, it is suffice that data multiplexing is executed only in the course of being opened, and a necessary storage capacity can be made small. Moreover, when data multiplexing is executed with respect to only the partial area, the capacity can further be made small.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to improvement in performance and reliability of a file system, and particularly in a data processing system to which a large number of disk drive devices are connected, data multiplexing of files suitable for speeding up the file system. Regarding the method.

[0002]

2. Description of the Related Art A first conventional technique relating to a conventional data multiplexing method for files is the "Disk Shadowing", pp. 331-338 of the 14th VLDB Conference Proceedings (1988). Proceedin
gs of the 14th VLDB Conference (1988), pp331-338)
It is described in.

This first prior art discloses a mirroring method for each magnetic disk device. Basic mirroring means that two disk devices are paired and the two hold the same data. In the above document, multiplexing of three or more units is specifically called shadowing, but here, multiplexing of three or more units is also called mirroring.
The operation of mirroring will be described. When writing data, the same data is written in the same address in each of a plurality of disk devices and multiplexed, and when reading, the data is read from an arbitrary disk device.

Therefore, as compared with the case of storing data in a single disk device, a plurality of reads can be processed in parallel, so that the input / output throughput, which is the number of input / output processes per unit time, is improved. Furthermore, since it is possible to read data by selecting a disk device with a short seek time, it is possible to shorten the read input / output time. w
In the write, the input / output throughput and the input / output time are degraded due to the input / output start overhead for a plurality of disk devices and the overhead for waiting for the writing of all the disk devices. However, the performance degradation of write is much smaller than the performance enhancement of read, so
Even if the number of read and write executions is the same, the average performance is improved compared to the case of a single disk device.

Another advantage of mirroring is increased reliability and availability. Since there are multiple copies of the same data, even if a failure occurs in one disk device, the copy data of another disk device can be accessed, so that the data is not lost. The designation of mirroring is
It is set by the system administrator and by issuing a system command from the console. This mirroring is often realized by the hardware and control software of the disk control device, but there are also examples in which it is realized by the operating system (OS).

The second conventional technique, which is a data multiplexing method in units of magnetic disk areas, is the "Guide to OSF / 1: Technical Synopsys"(O'Reilly& Associates, Inc.) published by O'Reilly & Associates, Inc. 1991)
Pages 7-1 to 7-10 (Guide to OSF / 1: A Tech
nical Synopsis (1991), pp7-1-1-10).

In the second conventional technique, mirroring is performed in disk area units based on the concept of a logical volume rather than the entire disk device. The disk is divided into fixed-length areas called extents, and one logical extent is associated with one or more physical extents. The physical extent to be associated may be that of any physical disk device, and one logical extent may be associated with the physical extents of different physical disk devices. A system that collects logical extents into one virtual disk device is called a disk logical volume. Mirroring is performed when one or more physical extents are associated with one logical extent. The operation in the case of mirroring will be described. When writing to a logical extent, the same data is written to each of a plurality of corresponding physical extents at relative addresses within the same extent and multiplexed, and when reading, data is read from an arbitrary physical extent.

Therefore, this logical volume method can partially mirror the disk device. The designation of mirroring is determined by the system administrator and set by issuing a system command from the console, as in the first conventional technique. The advantage of this mirroring of the logical volume is that, in addition to the performance, reliability, and availability described in the first conventional technique, only the important area of the disk device can be multiplexed, so that the disk capacity required for the multiplexing can be reduced. There is. In this example, the mirroring is realized by the OS.

The third conventional technique for multiplexing data in file units rather than in the magnetic disk drive is Addison
Wesley Publishing Company
) Published "Operating system concept 3rd
Edition "(1991) pp. 507-508 (Operati
ng System Concept Third Edition (1991), pp507−50
8).

The data multiplexing method in units of files according to the third prior art is called replication. Replication is used in distributed systems to improve reliability and availability. A file called a replica that holds the same contents as the master file is stored in a magnetic disk device of a data processing system different from that of the master file. If the computer system containing the master file fails, the inaccessible state can be avoided by accessing the replica. When writing to a file, the data is written to the master file, the same data is written to each of the corresponding one or a plurality of replicas for multiplexing, and at the time of reading, the data is read from the master file or any replica. In a distributed system, issuing multiple write to replicas is a large overhead. Therefore,
The method of reflecting the update of the master file in the replica, that is, the matching control method, is performed at the same time as the master file by wr.
In addition to the method with high consistency in executing ite, there is a method with low consistency in which update data is collectively written at fixed time intervals in the replica. The replica is specified by the system administrator by issuing a system command. The replica created for the purpose of caching in the data processing system that requests the access to the file is automatically created by the OS when the access is requested. To be done. This is called cache replication.

[0011]

The mirroring of the above-mentioned first and second prior arts is static data multiplexing in which the system administrator predicts and sets the load in advance.
There is a first problem that a large number of storage devices and a large storage capacity are required for the entire system because the file storage devices for storing all the files that may have a high load are multiplexed in advance. At some point, it is rare that all of the above files are in use, in which case the storage that stores the multiplexed data for the unused files and their storage capacity is completely wasted. Has become. It is desirable to use storage capacity for multiplexing as needed and when needed.

Further, there are a plurality of forms of data multiplexing for the purpose of improving the performance, and there are forms that are compatible and forms that are not compatible depending on the characteristics of the file input / output of the program, that is, the input / output characteristics. For example, in mirroring,
If the number of writes is larger than read, the data is 2
Duplication is good, and if the number of reads is large, the data will be 3
It is better to make it more than heavy. If the data amount of one read is large and high-speed transfer is required, a form called striping in which the data is divided into fixed-length blocks and blocks are cyclically allocated to a plurality of storage devices is suitable. On the other hand, the input / output characteristics of a single file usually differ depending on the program issuing the input / output. Therefore, these prior art static data multiplexes
There is a second problem that the performance deteriorates when the characteristics are different from the input / output characteristics assumed at the time of setting.

The third prior art replication aims at storing multiplexed data in different data processing systems to improve reliability and does not consider improvement of input / output performance. The third problem is that the input / output to / from the replicas in different data processing systems takes time because of the overhead of transferring via the network, and the performance is not improved.

Further, in the replication, as in the case of the mirroring, the center administrator pre-multiplexes all the files that may be overloaded, so that the storage capacity of the entire system is required to be large. There was also. Further, as in the case of mirroring, since the data multiplexing is static, there is the second problem that it cannot cope with changes in input / output characteristics.

A cache, which is a modification of the third prior art,
The replication does not have the first problem because it performs dynamic data multiplexing by creating a caching replica in the requesting data processing system when a file access request is made. However, the caching replica is a simple duplication and does not consider the input / output characteristics. Therefore, the third conventional technique also had the second problem. In addition, cache replication improves access performance by eliminating the overhead of transferring I / O requests to a data processing system having files over a network. However, since the cache replica cannot be accessed by any data processing system other than the cache replica, the fourth problem is that the data processing system having the master file does not improve the input / output performance.

An object of the present invention is to provide a file data multiplexing method and a data processing system for realizing high-performance input / output characteristics in a data processing system in which a plurality of file storage devices are connected via a control device. Especially.

Another object of the present invention is to provide a file data multiplexing method and a data processing system for realizing a file system having a small required storage capacity in a data processing system in which a plurality of file storage devices are connected via a control device. To provide.

[0018]

A feature of the present invention is that when a file open request is issued, data in at least a part of the file is multiplexed and distributed to a plurality of drives (file storage devices). , When the file is closed, the multiplexed data is erased.

Another feature of the present invention is that when the frequency of use of an open file is equal to or higher than a predetermined value, the data of the entire or partial area of this file is multiplexed and distributed to a plurality of drives, and the file is closed. Sometimes it is to erase multiplexed data.

[0020]

According to the present invention, the data of the entire or partial area of an open file is multiplexed and distributed and arranged in a plurality of drives. When writing (writing) to those files, data is written in all of the file areas that are distributed in a multiplex manner, and when reading (reading), data is read from any of the multiplexed file areas. At the time of reading, if a plurality of file areas are accessible, data can be read from the one having the shortest seek time, and the input / output time can be shortened. Also rea
The d can be executed in parallel up to the number of distributed drives, and the input / output throughput can be improved.

Further, since the data multiplexing is performed at the time of opening the file or during the file opening, the data multiplexing degree and the number of drives to be arranged can be selected according to the input / output characteristics of the program to be opened, and the input / output performance can be improved. it can.

On the other hand, since the data is multiplexed at the time of opening the file or during the file is opened and the multiplexed data is erased at the time of closing, it is sufficient to prepare only the storage capacity required for the multiplexing of the files to be opened at a time. The file storage capacity of can be reduced.

[0023]

EXAMPLES Examples of the present invention will be described below. <Embodiment 1> First, a first embodiment will be described with reference to FIGS. The first embodiment is an example in which an operating system (OS) implements the present invention in a data processing system in which a plurality of magnetic disk devices (drives) are connected via a disk control device. Therefore, O
The method of the present invention is incorporated into the file system of S. The file system is based on that of UNIX, which is the current mainstream OS. For the UNIX file system, refer to "The Design of the UNIX Operating System (198) published by Prentice-Hall, Inc.
6)). Since the present invention is implemented with a structure in which processing is added to the UNIX file system, detailed description of the file system not directly related to the invention will be omitted. That is, the processing for the present invention is added to the existing system call of the far system such as open, close, read, and write, and the processing of the original function is performed by calling the processing routine corresponding to the conventional system call. To be realized. Also, add some new processing programs. In the first embodiment, a program started at regular intervals makes a decision to multiplex data, that is, to create a mirror file, based on the usage status of files and file storage devices.

First, the hardware configuration of the first embodiment will be described. FIG. 1 is a block diagram of a data processing system.
The hardware configuration will be described first. Instruction processor (I
P) 1, 2 and the input / output processor (IOP) 4 are connected to the main memory (MS) 3. A disk control unit (DKC) 5, 6 is connected to the IOP 4, and a disk drive unit (DKU) 7, 8, 9, 10, 11,
12 are connected. The DKU is a disk drive including one spindle, and one DKU is managed by the OS 22 as one volume. IOP4 is
From the instruction processors 1 and 2, the channel program I
I / O is executed in response to the activation of the OP program, and I / O
When the O completion is received from the input / output device, the instruction processors 1 and 2 are notified by generating an I / O interrupt.
The DKCs 5 and 6 control the DKU and perform magnetic disk I / O in response to a data write or read command from the IOP 4. I of this IOP, DKC, DKU
The / O hardware configuration is well known in mainframe computers.

Next, the software configuration of the first embodiment will be described. An application program 21 that issues I / O and an OS 22 that processes the application program 21 operate in the data processing system. The OS 22 includes a file system 26, a program module of the disk driver 27, a volume control table 31 and a file control table 32 of the MS 3, and a DK.
It has the data structure of the U volume management block 33 and the OS buffer 40. The file system 26 is software that realizes the concept and operation of an abstract file that is independent of the characteristics of the input / output device.

The OS 22 opens the file, closes the file, reads the file, writes the file, allocates the disk block, determines the multiplexing, creates the mirror file, and deletes the mirror file.
Close program 42, Read program 43,
Write program 44, Alloc program 4
5, multiplexing program 46, mirror creation program 4
7. It has a mirror erasing program 48. The disk driver 27 is software that performs I / O processing in consideration of the characteristics of the disk device. File system 26
Calls the disk driver 27 as a lower module to realize an abstract file function. Driver 2
7 also has an entry of a program corresponding to a system call related to a file such as Open or Read, and performs I / O processing depending on the characteristics of the magnetic disk.

In this embodiment, processing is added to the program of the file system 26 and the driver 27 is not changed, so the processing in the driver 27 will not be described. The file data is stored in the DKU. The original file is called a master file 34, and the files of multiplexed data having the same contents as the master file 34 are called mirror files 35, 36, 38, 39.

As shown in FIG. 2, the split mirror files 38 and 39 are so-called striped files, and the block 302 of the file data 301 is cyclically arranged in a plurality of DKUs 02 and 12. When the data length to be accessed is large, the plurality of DKUs 02 and 12 can operate in parallel, which improves the data transfer rate. For example,
When the application program 21 issues a read request for block 0 and block 1, the data transfer rate is doubled because the DKU02 and DKU12 can perform the read operation in parallel.

FIG. 3 is a block diagram of the volume management block 33. The OS 22 manages one DKU as one volume. The disk area of the volume includes a volume management block 33, a file node area 59,
The data area 62 is divided into three areas. The volume management block 33 has the following fields. The first free block address 56 is a free block 64 in the data area
, The top free node index 58 points to the list of free file nodes 60. When the file system 26 creates a file, the list is searched for an empty space and used.

FIG. 4 is a block diagram of the file node 61. The file node 61 holds information on one file. The following fields of information are added to the fields 71, 72, 73, 74 of the basic information such as the owner identifier. The address table 77 is conventional information for holding the addresses 79 of the plurality of blocks 63 assigned to the file.
A field 78 for the identifier of the volume in which each block 63 exists is provided. The mirror read list 76 indicates a list of file nodes of the mirror when it has a mirror file.

FIG. 5 is a block diagram of the volume control table 31. There is an entry 81 for each volume, the number of opens 85 that holds the number of open files, seek position 86 that represents the current head position of the volume,
Re that indicates the number of read issues for the volume
It has fields of an ad count of 87, a write count of 88 indicating the number of write issuances, and a volume management block 33 for caching, that is, an area 89 for resident in the main memory. 87 read and 8 write
8, the multiplexing program 47 is reset at regular time intervals.

FIG. 6 is a block diagram of the file control table 32. An open number 94 that indicates the number of open files, a mirror status code 95 that indicates what state the file is in with respect to a mirror, and a read number 9 that indicates the number of reads issued to the file.
6, a write count 97 indicating the number of write issuances, an access data length 98 indicating an average data length of read and write requests, and an area 99 for caching a file node. 96 read times and wr
The number of times 97 and the access data length 98 are reset by the multiplexing program 47 at regular time intervals. The access data length 98 is used to determine whether or not striping is performed when creating a mirror file.

Next, the operation of the first embodiment will be described with reference to FIG. 1 and FIGS. First, the operation of the Open program 41 will be described with reference to FIG. After performing the normal file open process (step 101), search for an entry of the file in the file control table 32,
If not, it is secured and initialized (step 102), and the open numbers 85 and 94 of the volume control table 31 and the file control table 32 are incremented (step 1).
03). This will keep the number of files currently open per volume and the number of files open per file.

The operation of the Close program 42 will be described with reference to FIG. After performing the normal file close processing (step 111), the volume control table 31
Then, the open numbers 85 and 94 of the file control table 32 are decremented (step 112). Number of open 94
If is not zero (step 113), it means that there is an application program 21 that is still open, and the processing ends without deleting the mirror file. Number of open 94
If is zero (step 113), the entry in the file control table 32 is initialized (step 11).
4). If there is a mirror file of the file, the mirror file is erased by calling the mirror erasing program 48 (steps 115 to 116). Specifically, the file node of the mirror file is found from the mirror node list 74 of the file node 61 to be closed, the mirror file is deleted, and the file node of the mirror file is removed from the chain of the mirror node list 74.

The operation of the Read program 43 will be described with reference to FIG. If the volume is busy or if the seek time of the mirror files 35 and 36 can be shortened (steps 121 to 122), the mirror file with the shortest seek distance is selected (step 125) and a read is issued to it. (Step 126). The reason why the mirror file is accessed when it is busy is to avoid waiting time. This is because when it is not busy, the I / O execution time is shortened by selecting the volume having the shortest seek distance between the master file and the mirror file. The data length of the read request is large and the split mirror file 38,
If there is 39 (steps 121 to 123), a read is issued to the split mirror file (step 12).
6). If the data length of the read request is large, striping is effective, so the split mirror files 38, 39
It is possible to shorten the I / O execution time by reading the data in parallel.

If none of the above conditions are met, a read is issued to the master file 34 (step 124). After that, the read counts 87 and 96 of the volume control table 31 and the file control table 32 are incremented, and the seek position 86 and the access data length 98 are set.
Is updated according to the lead this time (step 127-
129). The access data length 98 is 96 read times.
And the number of writes 97 is calculated so that the average data length of access is obtained.

The operation of the Write program 44 is shown in FIG.
Will be described. After the normal file write process (step 141) is performed on the master file 34, if the master file 34 has a mirror,
A normal file write process is issued to all mirror files 35, 36, 38, 39 (step 14).
2-143). After that, the write count of the volume control table 31 and the file control table 32 is 88,97.
Is incremented and the seek position 86 and the access data length 98 are updated in accordance with the current write (step 1
44-146). In this way, by executing the write to all the mirror files, the data consistency between the master file and the mirror files is maintained.

The operation of the Alloc program 45 is shown in FIG.
Will be described. The Alloc program 45 is called when the file system 26 writes new data to the file, and allocates the empty block 64 of the data area 62 of the volume to the file. If there is no free block in the volume (step 161), one of the mirror files of the volume is selected and erased to create a free block (step 162).
After that, the free blocks are unchained from the free block list 56 of the volume management block 33, and the normal allocation processing is performed (step 163). When allocated, the address table 77 of the file node 61
The volume identifier 78 and the block address 79 are set. In this way, the block of the data area 62 assigned to the mirror file is used as a semi-empty area, and when the free area is exhausted, it is used as a free area for a new block.

Next, the operation of the programs 46, 47 and 48 of the file system 26 newly provided according to the present invention will be described with reference to FIG.
~ It demonstrates in FIG. First, the operation of the multiplexing program 46 will be described with reference to FIG. The multiplexing program 46
It is activated at fixed time intervals by a timer interrupt. The following steps are performed for all valid entries in the file control table 32, i.e. for all open files. The next valid entry is fetched, and the entry of the volume control table 31 for the volume in which the file of that entry is stored is fetched (steps 181-282). If the value obtained by dividing the volume read count 87 or the file read count 96 by the number of mirror files is larger than the respective threshold value and the file access data length 98 is larger than the threshold value (step 183), striping (split mirror file 38) is performed. , 39) is valid, and the mirror creation program 47 is called with a division designation for the file (step 185).

If the value obtained by dividing the volume read count 87 or the file read count 96 by the number of mirror files is larger than the respective thresholds (step 18
4), it is determined that the mirror files 35 and 36 are valid, and the mirror creation program 47 is called for the files without specifying division (step 186). If none of the above conditions are met, neither mirror file nor split mirror file is created. And file rea
The number of times of d and write 96, 97 and the access data length 98 are reset (step 187). When the above process is completed for all valid entries in the file control table 32 (step 188), re-validates for all valid entries in the volume control table 31.
Reset the number of ads 87, 88 (step 18
9). By resetting the above data each time the program 46 is started, the read counts 87 and 96 represent the latest read frequency, and the access data length 98 represents the latest average access data length. Therefore, it is possible to multiplex data according to the dynamic load change of the system.

The operation of the mirror creation program 47 is shown in FIG.
Will be described. There is no mirror of the file and the read count of the volume control table 31 is 87 + write.
A volume whose number of times 88 is smaller than the threshold is searched (step 201). If there is no corresponding volume, return is made. If there is a corresponding volume and there is a free block where a mirror file can be created, and there is a division designation (steps 202 to 203), select two corresponding volumes,
Normal division file creation processing is performed for the volume (steps 205 to 206). That is, the split mirror files 38 and 39 are created. If there is no designation of division, normal file creation processing is performed for the volume (step 204). That is, the mirror files 35 and 36 are created. Copy the contents of the master file 34 to the created file (step 207),
The file node 61 of the created mirror file is chained to the mirror node list 76 of the master file (step 208). Master file mirror status code 9
5 is set to "split mirror" if split is designated, and to "mirror" if split is not designated (step 209).

The operation of the mirror erase program 48 is shown in FIG.
Will be described. Mirror node list of the file 7
The file node of the mirror file is obtained from 6 (step 221). If there is a mirror file (step 222), a normal file erasing process is performed on the file (step 223), and the process returns to step 222. Mirror status code 9 if there is no mirror file
5 is set to "no mirror" (step 224).

<Embodiment 2> Next, a second embodiment obtained by partially modifying the first embodiment will be described with reference to FIGS. FIG. 15 is a data configuration diagram of this embodiment. In the first embodiment, data is copied from the master file 34 when the mirror files 35 and 36 and the split mirror files 38 and 39 are created. That is, the master file 34 is read in block units into the OS buffer 40 of the main memory 3 and written in the mirror file.
In this embodiment, in order to reduce the copy overhead,
The block 311 read in the OS buffer 40 at the time of processing the read request is written in the mirror file 35. Therefore, the mirror file 35 holds a part of the data of the master file 34, but not the whole of the master file 34.
If the access of ad is local, the performance can be improved even with a partial mirror file. Further, the overhead required for copying is only writing from the OS buffer 40, which is smaller than that in the first embodiment. In this embodiment, only the Read program 43 and the mirror creating program 47 of the first embodiment are changed.

The operation of the Read program 43 will be described with reference to FIG. Whether the volume is busy and there is a target block in the mirror file,
When the seek time is shorter in 6 and the target block exists in the mirror file (steps 401 to 402), the mirror file having the shortest seek distance is selected (step 405) and a read is issued to it (step 405). 406). The reason why the mirror file is accessed when it is busy is to avoid waiting time.

This is because when the volume is not busy, the volume with the shortest seek distance is selected from the master file and the mirror file to shorten the I / O execution time. When the data length of the read request is large and the target block exists in the split mirror files 38 and 39 (steps 401 to 40).
3) Issue a read to the split mirror file (step 406). If the data length of the read request is large, striping is effective, so it is better to read the data in parallel from the split mirror files 38 and 39.
The execution time of O can be shortened. If none of the above conditions are met, a read is issued to the master file 34 (step 404). After that, the read count of the volume control table 31 and the file control table 32 is 8
7 and 96 are incremented, and the seek position 86 and the access data length 98 are updated according to the current read (steps 407 to 409). When the mirror status code of the file is "partial mirror" or "partial split mirror" (step 410), the mirror file of the file is read in step 404, and the block 311 in the OS buffer 40 is set as the mirror file. (Step 411).

The operation of the mirror creation program 47 is shown in FIG.
Will be described. There is no mirror of the file and the read count of the volume control table 31 is 87 + write.
A volume whose number of times 88 is smaller than the threshold is searched (step 421). If there is no corresponding volume, return is made. If there is a corresponding volume and there is a free block where a mirror file can be created and there is a division designation (steps 422 to 423), select two corresponding volumes,
Normal division file creation processing is performed for the volume (steps 425 to 426). That is, the split mirror files 38 and 39 are created. If no division is designated, a normal file creation process is performed for the volume (step 424). That is, the mirror files 35 and 36 are created. The file node 61 of the created mirror file is chained to the mirror node list 76 of the master file (step 427). When the mirror status code 95 of the master file is specified to be split, "
It is set to "partial split mirror" and to "partial mirror" if no split is designated (step 428).

<Third Embodiment> Next, a third embodiment will be described. The third embodiment has almost the same configuration as the first embodiment and operates in almost the same manner, but the trigger for multiplexing the data is different. In the first embodiment, the program started at regular intervals multiplexes data based on the usage status of files and file storage devices, but in the third embodiment, data is multiplexed when the file is opened, That is, a mirror file is created.

The structure of the third embodiment will be described with reference to FIG. As shown in the figure, the configuration is almost the same as that of the first embodiment. The difference is that the multiplexing program 46 disappears,
The reset program 49 is added and the file control table 33 is stored in the DKU 11. The file control table 32 is a table in which files to be multiplexed at the time of opening are registered. The file control table 32 is stored in the DKU 11 when the system is stopped and read into the main storage device 3 at the next system startup.

The operation of the third embodiment differs from that of the first embodiment only in the Open program 41 and the reset program 49. Further, the system control administrator adds and deletes the files to be multiplexed at the time of opening to the file control tables 32 and 33. This registration and deletion is performed by the system administrator by entering a command to specify a file from the console terminal. Since this processing is not special, the processing flow is omitted.

The operation of the Open program 41 will be described with reference to FIG. If the file is registered in the file control table 32 after performing the normal file open process (step 501) (step 50)
2) Increment the open numbers 85 and 94 of the volume control table 31 and the file control table 32 (step 503). This will keep the number of files currently open per volume and the number of files open per file. After that, the mirror creation program 47 is called for the file (step 5).
04).

The operation of the reset program 49 will be described with reference to FIG. This program is started at regular time intervals by a timer interrupt. Volume control table 31
The read and write counts 87 and 88 of all valid entries are reset (step 521), and the read and write counts 96 and 97 and access data length 98 of all valid entries of the file control table 32 are reset (step 522). By resetting the above data each time this program is started, read
The numbers 87 and 96 represent the recent read frequency, and the access data length 98 represents the recent average access data length. Therefore, it becomes possible to select the data multiplexing method according to the dynamic load fluctuation of the system.

<Fourth Embodiment> Next, a fourth embodiment will be described. In this embodiment, the processing of the third embodiment is performed not by the OS but by the library program located between the OS and the application program. This indicates that the present invention does not necessarily have to be implemented in the OS.

The structure of the fourth embodiment will be described with reference to FIG. As shown in FIG. 21, the processing programs and tables necessary for the present invention were included in the OS in the first embodiment.
In the fourth embodiment, it is included in the library program 24. The library program 24 performs a file system process by calling a system call of the conventional OS 22. The operation of the fourth embodiment is the same as the processing of the third embodiment. However, the normal file open, close, read, and write processing calls
Change to call all open, close, read, and write process of S.

[0054]

According to the present invention, the data of all or a partial area of an open file is multiplexed and distributed in a plurality of file storage devices. Therefore, if a plurality of file areas are accessible at the time of read. , The data can be read from the one with the shortest seek time, and the input / output time can be shortened. Further, the read can be executed in parallel up to the number of distributed file storage devices, and the input / output throughput can be improved.

When there are many access requests of short data length, each access request is independently executed in a different file storage device, and a larger number of access requests are processed. In the case of an access request with a long data length, one access request is executed in parallel by a plurality of file storage devices, and the access request is processed at high speed even with a long data length.

Furthermore, since data multiplexing is performed during opening, the data multiplicity and the number of file storage devices to be arranged can be selected according to the input / output characteristics of the program to be opened, and the input / output performance can be improved. For example, when only read is issued, the input / output throughput of read can be increased by n times by increasing the data multiplicity n and distributively arranging it in n file storage devices.

When the read data length d is long, the file data is divided into blocks each having a length of d / m and striped to m file storage devices to reduce the read I / O time. It can be shortened to 1 / m. Therefore, a high performance file system can be realized.

On the other hand, since the data is multiplexed while the file is open and the multiplexed data is erased when the file is closed, it is sufficient to prepare only the storage capacity required for multiplexing the files to be opened at a time. The capacity can be reduced.

Further, only the part of the file used is multiplexed, but since the recently updated part of the file is multiplexed, the conventional mirroring is used in the system in which the backup of the file is performed regularly. It is possible to achieve the same level of reliability with a smaller redundant data storage capacity.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of a data processing system according to a first embodiment.

FIG. 2 is a structural diagram of a split mirror file of the first embodiment.

FIG. 3 is a structural diagram of a volume management block of the first embodiment.

FIG. 4 is a structural diagram of a file node according to the first embodiment.

FIG. 5 is a structural diagram of a volume control table of the first embodiment.

FIG. 6 is a structural diagram of a file control table according to the first embodiment.

FIG. 7 is a flowchart of an Open program of the first embodiment.

FIG. 8 is a flowchart of a Close program according to the first embodiment.

FIG. 9 is a flowchart of a Read program according to the first embodiment.

FIG. 10 is a flowchart of a Write program according to the first embodiment.

FIG. 11 is a flowchart of an Alloc program of the first embodiment.

FIG. 12 is a flowchart of a multiplexing program of the first embodiment.

FIG. 13 is a flowchart of a mirror creating program according to the first embodiment.

FIG. 14 is a flowchart of a mirror erasing program of the first embodiment.

FIG. 15 is a data configuration diagram of the second embodiment.

FIG. 16 is a flowchart of a Read program according to the second embodiment.

FIG. 17 is a flowchart of a mirror creating program according to a second embodiment.

FIG. 18 is a block diagram showing a configuration of a data processing system of a third embodiment.

FIG. 19 is a flowchart of the Open program of the third embodiment.

FIG. 20 is a flow chart of a reset program of the third embodiment.

FIG. 21 is a block diagram showing the configuration of a data processing system of a fourth embodiment.

[Explanation of symbols]

3 ... Main storage device, 4 ... Input / output processor, 5, 6 ... Disk control device, 7, 8, 9, 10, 11, 12 ... Disk drive device, 22 ... OS, 26 ... File system, 2
7 ... Driver, 32 ... File control table, 33 ... Volume management block, 34 ... Master file, 35,
36, 37, 38, 39 ... Mirror file, 40 ... OS
buffer

Claims (12)

[Claims] 1. A data multiplexing method for a file in a data processing system to which a plurality of drives for storing a file are connected. When a file open request is issued, data in at least a part of the area of the file is multiplexed. A data multiplexing method for a file, wherein the multiplexed data of the file is erased when the file is closed. 2. The data multiplexing method for a file according to claim 1, wherein a mirror file of the file is created and the data is multiplexed when an open request is made for the file. 3. A data multiplexing method of a file in a data processing system to which a plurality of drives for storing a file are connected, wherein at least a part of the area of the file when the usage frequency of the file being opened is a predetermined value or more. The data multiplexing method for a file, characterized in that the data is multiplexed and distributed to the plurality of drives, and the multiplexed data of the file is erased when the file is closed. 4. The file data multiplexing method according to claim 3, wherein at least a part of the data of the plurality of files is multiplexed when the total number of the plurality of opened files is equal to or more than a predetermined value. . 5. The data of at least a part of the plurality of files is multiplexed when the number of read times of the opened specific file exceeds a predetermined value within a predetermined time. File data multiplexing method. 6. In the distributed arrangement to the plurality of drives, the multiplexed data is stored in a plurality of drives by striping the data.
Alternatively, the data multiplexing method of the file described in 3. 7. The data multiplexing of files according to claim 1, wherein in the distributed arrangement to the plurality of drives, the multiplexed data is stored in a drive having a small number of open files. Method. 8. In the distributed arrangement of the plurality of drives, the data read in the buffer provided in the main storage device of the data processing system is written in the multiplexed data area of the drive. Alternatively, the data multiplexing method of the file described in 3. 9. A data multiplexing method for a file in a data processing system to which a plurality of drives for storing a file are connected. When a file open request is issued, data in at least a part of the area of the file is multiplexed. Storing the multiplexed data in the empty areas of the plurality of drives and using the multiplexed data storage area as an empty area when there is no free area in the drive where the multiplexed data is not stored. Data multiplexing method for files characterized by: 10. In a data multiplexing method for a file in a data processing system to which a plurality of drives for storing a file are connected, at least a part of the area of the file when the usage frequency of the file being opened is a predetermined value or more. Data of
The multiplexed data is stored in the empty areas of the plurality of drives, and when there is no empty area of the drives in which the multiplexed data is not stored, the multiplexed data storage area is used as an empty area. Data multiplexing method for characteristic files. 11. A data processing system in which a plurality of drives for storing a file are connected to a main storage device and an instruction processor, wherein the main storage device receives a file open request from the instruction processor. A means for multiplexing data in at least a part of an area of the file and dispersively arranging the data in the plurality of drives; and a means for erasing the multiplexed data of the file when the file is closed. Data processing system. 12. In a data processing system in which a plurality of drives for storing files are connected to a main memory device and an instruction processor, the main memory device has a predetermined usage frequency of a file opened by the instruction processor. When it is more than the value,
And a means for multiplexing data in at least a part of the area of the file to disperse the data in the plurality of drives, and a means for erasing the multiplexed data of the file when the file is closed. Data processing system.