If the present messy disk space is "_ 1 _ 11 _ 1 _", this space can't be loaded if you want to copy files 111 into it. Of course, all of the above description can be summarized as pictographic explanation of teacher at school: let's set "_" as the space left after files are deleted. So, searching time and reading time largely affect the efficiency of program execution. When the same data need to be read for several times, cache plays a great role.īut if a file is read for the first time, cache can do nothing. If not, disk will be accessed, which is also called reading disk. If the data are in the cache, they will be read directly.
When disk is read, system will check whether the data are in the cache. Time required for reading data of sectors under the head is only one fifth of that required for moving head to another place and then reading the same data. If the relevant documents of application can be placed in continuous disk space, the search time of head will be reduced a lot.
Average seek time of hard disk is less than 9.5ms. Searching time is called average seek time ( milliseconds) in hard disk performance index. And finally, it does reading processing - transfers data to disk cache and memory. Generally, when a program runs, head of disk driver will search the files which are necessary to run the program. 1.Defragmentation Working PrincipleĪfter we know the cause of disk fragmentation, we also need to get to know how disk reads and writes when program runs. Note: The Disk Management console view is not up-to-date error may appear suddenly, you should master the exact ways to fix it properly.
0 kommentar(er)
