Mirrored disk rouing and scheduling

Alexander Thomasian

doi:10.1007/s10586-006-0014-3

2006-10-01

PRE

Alexander Thomasian *

DOI：10.1007/s10586-006-0014-3

原文链接

原文求助

摘要

En 中文

Disk mirroring or RAID level 1 stores the same data twice, on two independent disks, to ensure that all single disk failures can be tolerated. This high storage overhead is acceptable in view of the drop in storage cost per gigabyte and rapidly increasing disk capacities. Disk access time, on the other hand, is improving at a very slow pace, so that another important advantage of disk mirroring is the doubling of the disk access bandwidth in processing read requests. Efficient routing of read requests to disks and local disk scheduling can be used to improve performance even further. We are primarily concerned with two RAID I configurations: (i) source-initiated routing with the independent queues-IQ method; (ii) destination-initiated routing with the shared quette-SQ method. Static, dynamic, and affinity-based (AB) routing methods are used to distribute requests with the IQ method. We compare the performance of various IQ and SQ based routing policies using a random number-driven simulation. While there is some improvement in performance with the more sophisticated routing policies, performance is dominated by the local disk scheduling policy. The SQ method allows resource sharing, so that it tends to outperform the IQ based routing, but it requires the scheduler to keep, track of the state of the disk drives. As a further means to improve performance, we consider the effect of prioritizing reads with respect to writes, transposed data allocation, and replicating data more than twice.

Keyword:

storage systems

mirrored disks

RAID level 1

routing of requests

affinity based routing

disk scheduling

shortest access time first