Towards minimizing disk I/O contention: A partitioned file assignment approach
A new file allocation metric is explored and evaluated. We design a novel static heuristic partitioned file assignment algorithm, MinCPP and its dynamic version DMinCPP. We present the definition and construction procedure of the disk I/O contention probability. We prove that the file assignment of the MinCPP owns a minimum disk I/O contention probability among all the file allocations. We compare the MinCPP and DMinCPP with the round-robin file assignment strategy which is widely used.
partitioned file file assignment algorithm i/o contention probability parallel i/o system distributed resource management