Data Distribution and Improving Disk Performance for Faster Memory Access

The layout of traditional disks is optimized for file systems with large sequential access. For these sequential workloads, cost of seeks and rotational latencies are amortized on the transfer of a large amount of data to/ from the disk. Each access from a file system workloads, however incurs a time consuming seek and rotational latency that dominate the request response time, resulting in very less data rate. In the designed model to enhance the speed of data accessing from the hard disk and there by improving the over all performance of the system, the authors distribute one file in to the different platters available in the hard disk.

Provided by: International Journal of Computer Theory and Engineering (IJCTE) Topic: Networking Date Added: Apr 2012 Format: PDF

Find By Topic