Some time back, I noticed that with a two HDD btrfs raid1, some tasks suffered ALL the IO getting choked onto just one HDD! That turned out to be a feature of the btrfs code whereby a device is chosen depending on the process ID. For some cases such as in a bash loop, the PID increments by two for each iteration and so only one HDD ever gets hit... So... Running with a 3-disk btrfs raid1 and... I still see the same problem for such as compile tasks where only one of the three disks is maxed out for periods with the other two disks left nearly idle. Perhaps?... Is there an easy fix in the code to allocate IO according to the following search order: Last used disk with an IO queue < 2 items; Any disk with an IO queue < 2 items; Whichever disk with least queued items. The intention there is to repeat sequential IO to the current disk, but allow a second disk to interleave data requests for a same one file if data is requested faster than what the one disk can support. Other aspects are that the IO queue length checks hopefully will proportionately balance the requests across disks that offer different speeds. Hence a faster disk will get used to advantage if paired with a slower device. There looks to be two points in the code where a device gets selected. Not having delved into filesystems before... Is there easy/safe reading available for the IO queues for a device? Or rather: All easily done? (Or is the btrfs code at too high a level to be able to see/access the device IO queues?) Regards, Martin -- To unsubscribe from this list: send the line "unsubscribe linux-btrfs" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
