tofu1998
09-27-2009, 02:44 PM
I'm thinking that partitioning an HDD and use the partitions wisely may optimize the performance if the following premises hold:
1. An HDD accesses the out most rings faster and inner bits slower.
2. Partitioning a HDD will divide the disk from outside to the inside. That means Partition C will be on the outer rings and Partition D will be on inner rings and so on so forth.
If the above premises hold, than Partition C will be accessed faster than D, and D be faster than E. Am I correct? Are my premises true?
If I am right. I can put my OS in the first partition and frequently accessed data in the second and the least accessed archived data in the third.
And is all the above still true if I use a RAID 0 array? The data are stripped into two HDDs, but is the partitioning process also proceed from outside to inside for each individual HDD? Can I choose to assign the inner bit of each HDD for the least frequently accessed data by partitioning?
1. An HDD accesses the out most rings faster and inner bits slower.
2. Partitioning a HDD will divide the disk from outside to the inside. That means Partition C will be on the outer rings and Partition D will be on inner rings and so on so forth.
If the above premises hold, than Partition C will be accessed faster than D, and D be faster than E. Am I correct? Are my premises true?
If I am right. I can put my OS in the first partition and frequently accessed data in the second and the least accessed archived data in the third.
And is all the above still true if I use a RAID 0 array? The data are stripped into two HDDs, but is the partitioning process also proceed from outside to inside for each individual HDD? Can I choose to assign the inner bit of each HDD for the least frequently accessed data by partitioning?