In article <20020502183758.Q31556@unthought.net> you wrote:
>> No, you just distribute the ready round robin, this means each disk has only
>> half the seeks it had before.
> No, this is the way it was done a long time ago.
> It turns out to be an incredibly bad idea. In fact, it is the most CPU-efficient
> way of guaranteeing the largest average seek times on your disks ;)
> The RAID-1 code now looks at which disk worked closest to the wanted position
> last, and picks that disk for the seek.
Thats right, it is done on the distance in sector numbers. Thats a simple
compare, not sure if one could do that better.
raid1.c:raid1_read_balance()
Greetings
Bernd
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
This archive was generated by hypermail 2b29 : Sun Jun 30 2002 - 22:00:13 EST