JPH09204325A - File arrangement system for hard disk - Google Patents

Abstract

PROBLEM TO BE SOLVED: To improve reliability by re-arranging information stored on a hard disk in a time band when the frequency of accessing the hard disk is low. SOLUTION: A hard disk controller 3 inside a device 1 informs a CPU 4 of the information for indicating whether or not the hard disk 2 is accessed. In the CPU 4, the number of times of accessing the hard disk 2 is stored for each date and hour in a memory 5 every hour (for one month for instance). In the CPU 4, the time band when the number of times of accessing the hard disk 2 is least is periodically (every hour for instance) obtained from the information stored in the memory 5, and when the present time is in the time band, the re-arrangement of tiles 15 instructed to the hard disk 2.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a file arrangement method for a hard disk in a device having a hard disk.

[0002]

2. Description of the Related Art As an example of a system for rearranging physical storage positions of files on a hard disk in a device having a conventional hard disk, there is a "file storage system" disclosed in Japanese Patent Laid-Open No. 4-81942.

In this conventional file storage system,
By learning the usage frequency of each file by the user, the storage location of the file is rearranged, and it is rearranged without checking the time zone when the frequency of access to the file is low.

[0004]

In the file storage system of this conventional example, the size of the file changes due to the writing and deletion of the file during relocation, so the file on the hard disk is accessed during times when the hard disk is frequently accessed. When relocating the physical storage location of the file, it is conceivable to read from or write to the file while performing the relocation, but the problem is that this method does not always perform optimum relocation. there were.

The object of the present invention is to improve the reliability by rearranging the information stored on the hard disk during a time period when the hard disk is accessed infrequently, and at the same time, to rearrange the information without any user operation. The purpose of the present invention is to provide a file arrangement method for a hard disk that can improve maintainability by executing.

[0006]

According to the present invention, in a device having a hard disk, time information of not accessing the hard disk is accumulated, and the most frequent access frequency to the hard disk obtained from the past time information is stored. A hard disk file arrangement method is provided, which comprises means for rearranging a physical storage location on the hard disk in a low time zone.

Further, the apparatus having the hard disk stores access frequency storage means for storing the frequency of accessing the hard disk, and the access frequency storage for the time zone with the lowest access frequency based on the past record of use of the hard disk by the user. A hard disk file arranging method is obtained, which comprises: an estimating means for learning and estimating from accumulated information of the means.

Further, the device having the hard disk includes the hard disk for storing file information,
A hard disk control device for controlling the hard disk, a central processing unit for controlling all processes in the device, a memory for accumulating access information to the hard disk, and a clock circuit for counting date and time are provided. A file arrangement system of a hard disk is obtained in which the central processing unit has a function of the estimating unit.

[0009]

Next, the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram of an apparatus having a hard disk according to an embodiment of the present invention, FIG. 2 is a diagram showing an example of the contents of the memory in FIG. 1, and FIG. FIG. 4 is a flowchart showing an operation flow when an access occurs, and FIG. 4 is a flowchart showing an operation flow in which the central processing unit in FIG. 1 issues a file rearrangement instruction at predetermined time intervals.

Referring to FIG. 1, a device 1 having a hard disk according to this embodiment has a hard disk 2 for storing information such as files, a hard disk controller 3 for controlling the hard disk 2, and all the devices in the device 1. It is provided with a central processing unit (CPU) 4 for controlling the processing, a memory 5 for accumulating access information to the hard disk 2, and a clock circuit 6 for counting the date and time.

Referring to FIG. 2, the memory 5 has a two-dimensional array structure in which the number of times the hard disk 2 is accessed can be stored, for example, every hour of one day, with time as columns and dates as rows. I am taking it.

In FIG. 2, the 0th line indicates "1st day" and the 30th line indicates "31st day". Further, the 0th column shows “00:00”, and the 23rd column shows “23:00”. Therefore, the number of accesses at “0:00 a day” is “0”,
The number of accesses at “22:00 a day” is “10”, which is “1”.
It can be seen that the number of accesses at 23:00 on the day is “12”.

Next, the operation of this embodiment will be described with reference to FIGS. 3 and 4.

In this embodiment, the hard disk 2
It is premised that the above rearrangement is performed once from the access frequency of the past month in the time of the least access frequency. The method of rearranging the files on the hard disk 2 differs depending on the system, the operating system, etc., and will not be described here.

Now, the hard disk 2 is operated by the user.
If an access for writing or reading to or from the hard disk 2 occurs, the hard disk controller 3 notifies the CPU 4 that the access to the hard disk 2 has started.

Upon receipt of this notification, the CPU 4 starts the process of the procedure shown in FIG. That is, the CPU 4 reads the current "day" and "time" from the clock circuit 6 (step S1). Then, according to the read "day" and "time", the content of the corresponding address of the two-dimensional array of the content of the memory 5 is incremented by 1 (S2).

By this processing operation, information indicating the frequency of access to the hard disk 2 is stored in the memory 5.

Next, the CPU 4 carries out the processing of the procedure shown in FIG. 4 every hour.

Variables are used to describe the processing in this operation flow. The variable DAY is used to store the row value when referring to the two-dimensional array in the memory 5. Variable T
The IME is also used to store the column value when referring to the two-dimensional array in the memory 5. The variable COUNT is used to store the smallest number of accesses in the past month. The variable DAY ′ is used to store the day with the smallest access count in the past month. Variable TIM
Similarly, E'is used to store the time of the smallest access count in the past month.

First, the CPU 4 uses the variable DA used in processing.
Initial values "0" for Y, variable DAY 'and variable TIME'
Is set (S11).

Next, the contents of the beginning of the memory 5, that is, the contents of the 0th row and 0th column of the two-dimensional array are set in the variable COUNT (S12).

Next, in order to find the day and time when the hard disk 2 is least accessed, that is, the content of the memory 5 is the minimum, the operation of sequentially referring to the head of the two-dimensional array in the memory 5 is started.

First, in order to determine whether the reference up to the last line has been completed, the variable DAY indicating the line number and the final value "30" of the line number are compared (S13), and the variable DAY is "30". If the following is true (YES in S13), the column is next referenced.

First, the column number "0" is set in the variable TIME in order to make reference in ascending order from the smallest column number (S).
14).

Next, in order to determine whether or not the reference up to the last column has been completed, the variable TIME indicating the column number is compared with the final value "23" of the column number (S15), and the variable TIME is determined.
If "23" or less (YES in S15), the current variable D
The contents of the array indicated by AY and the value of the current variable TIME, that is, the hard disk access count in the DAY column (day), TIME row (hour) is compared with the variable COUNT that has set the minimum hard disk access count (S1).
7).

If the content of the array indicated by the values of the current variable DAY and the current variable TIME is smaller than the variable COUNT (YES in S17), the value of the content is the minimum number of hard disks, so this value is set in the variable COUNT. Is copied and set (S18), the current variable DAY and the current variable TIME are set.
The values of the variable DAY 'and the variable TI are defined as the day and time when the hard disk is least accessed.
It is set to ME '(S19). Thereafter, the variable TIME is incremented by 1 to refer to the next column of the two-dimensional array (S20) and the process returns to S15.

Further, NO in S17, that is, the current variable DAY
And the contents of the array indicated by the value of the current variable TIME are the variables COU
Even when it is not smaller than NT, the variable TIME is similarly incremented by 1 to refer to the next column of the two-dimensional array (S20) and the process returns to S15.

NO in S15, that is, the variable TIME is "2".
If it is not equal to or less than 3 ", it means that the reference up to the last column has been completed, so the variable DAY is incremented by 1 to refer to the next column (S16) and the process returns to S13.

Next, if NO in S13, that is, if the variable DAY is not equal to or less than "30", it means that the reference up to the last line is completed, and the day and time with the least hard disk access frequency in the past month are variable. DA
It has been set to Y'and the variable TIME '.

Then, the current date and time are read from the clock circuit 6 (S21), and it is determined whether the current time is the time when the number of hard disk accesses is the smallest in the past month.

The number obtained by adding "1" to the variable DAY 'is compared with the date read from the clock circuit 6, and the variable TIME' is compared with the time read from the clock circuit 6 (S22).

Here, "1" is added to the variable DAY 'because the value of the variable DAY' is a number decremented by 1 from the actual day for referring to the two-dimensional array.

As a result of comparing the times in S22, the variable TIM
If the value of E ′ is the same as the current time (YES), an instruction for relocation is issued to the hard disk control device 3 to relocate the files on the hard disk 2 (S23), and the process is terminated. .

If NO in S22, that is, if the results of comparing the times are not the same, it is not the time to relocate the files on the hard disk 2, and the process is terminated.

In the present embodiment, the processing according to the above procedure makes it possible to instruct relocation to the hard disk at the time when the number of times of access to the hard disk is the smallest in the past month.

In this embodiment, the hard disk 2
The above rearrangement is performed once from the access frequency of the past month to the time of the least access frequency, but it goes without saying that this precondition period is not limited to one month.

[0038]

As described above, according to the present invention, in a device having a hard disk, the time information when the hard disk is not accessed is accumulated and the hard disk is accessed in the lowest time zone obtained from past time information. By providing the means for rearranging the physical storage location on the hard disk, the device having the hard disk can be accessed based on the access frequency storage means for storing the frequency of accessing the hard disk and the past record of using the hard disk by the user. By further comprising an estimating means for learning and estimating a time zone having the lowest frequency from the accumulated information of the access frequency accumulating means, as an embodiment thereof, the device having the hard disk is a hard disk for accumulating file information. And control this hard disk The hard disk control device, a central processing unit that controls all processing in the device, a memory that stores access information to the hard disk, and a clock circuit that counts the date and time, and the central processing unit is the above-mentioned estimating means. With this function, files are relocated during the time when the hard disk is least accessed, so the time required for relocation is minimized and malfunctions due to file access during relocation are minimized. It has the effect that it can be retained.

Further, since the apparatus itself periodically executes the file rearrangement processing on the hard disk, the maintenance person rearranges the files in order to eliminate the discontinuous area on the hard disk which occurs when the apparatus is used for a long time. This has the effect that the work of operating the software on a regular basis becomes unnecessary.

[Brief description of drawings]

FIG. 1 is a block diagram of an apparatus having a hard disk according to an embodiment of the present invention.

FIG. 2 is a diagram showing an example of contents of a memory in FIG.

3 is a flowchart showing an operation flow when an access to a hard disk is generated by the central processing unit in FIG.

FIG. 4 is a flowchart showing an operation flow in which the central processing unit in FIG. 1 issues a file rearrangement instruction at predetermined time intervals.

[Explanation of symbols]

 1 device 2 hard disk 3 hard disk control device 4 central processing unit (CPU) 5 memory 6 clock circuit

Claims (3)

[Claims] 1. An apparatus having a hard disk,
A means is provided for accumulating time information when the hard disk is not accessed, and relocating a physical storage position on the hard disk in a time zone when the frequency of access to the hard disk obtained from the past time information is the lowest. Characteristic hard disk file allocation method. 2. The apparatus having the hard disk, the access frequency accumulating means for accumulating the frequency of accessing the hard disk, and the access frequency accumulating the time zone in which the access frequency is the lowest from the past record of use of the hard disk by the user. 2. The hard disk file arrangement method according to claim 1, further comprising: an estimating means for learning and estimating from the accumulated information of the means. 3. A device having the hard disk comprises: the hard disk for storing file information; and a hard disk control device for controlling the hard disk.
A central processing unit that controls all processes in the device, a memory that stores access information to the hard disk,
With a clock circuit that counts the date and time,
3. The hard disk file arrangement method according to claim 2, wherein the central processing unit has a function of the estimating unit.