Read algorithm-raid1/raid10

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



hi guys, could we implement a load_balance read algorithm for SSD?
nearest head isn't as fast as round robin for ssd.
i'm talking about raid1 (raid10 too)
what's my problem?
as i can see, raid0 is faster than raid1
for example:
two disks raid0 is faster than
two disks raid1.

why?
nearest head
instead of a balanced read algorithm (like raid0) the nearest head
make raid1 use only one disk for searchs where we could use two disks
(like raid0)

could we implement a round robin for ssd? and make raid1 as fast as
raid0 for ssd?
i didn't tested the raid10 algorithm yet.
thanks a lot.

-- 
Roberto Spadim
Spadim Technology / SPAEmpresarial
--
To unsubscribe from this list: send the line "unsubscribe linux-raid" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html


[Index of Archives]     [Linux RAID Wiki]     [ATA RAID]     [Linux SCSI Target Infrastructure]     [Linux Block]     [Linux IDE]     [Linux SCSI]     [Linux Hams]     [Device Mapper]     [Device Mapper Cryptographics]     [Kernel]     [Linux Admin]     [Linux Net]     [GFS]     [RPM]     [git]     [Yosemite Forum]


  Powered by Linux