Date: Thu, 03 Dec 2009 12:17:12 -0800 From: Maxim Sobolev <sobomax@FreeBSD.org> To: Alexander Motin <mav@FreeBSD.org> Cc: "Derek \(freebsd lists\)" <482254ac@razorfever.net>, FreeBSD-Current <freebsd-current@FreeBSD.org>, Emil Mikulic <emikulic@gmail.com> Subject: Re: gmirror 'load' algorithm (Was: Re: siis/atacam/ata/gmirror 8.0-BETA3 disk performance) Message-ID: <4B181CC8.1040205@FreeBSD.org> In-Reply-To: <4B17B4DA.7050403@FreeBSD.org> References: <h7lmvl$ebq$1@FreeBSD.cs.nctu.edu.tw> <4A9E8677.1020208@FreeBSD.org> <20090903002106.GB17538@dmr.ath.cx> <4AA0075A.5010109@FreeBSD.org> <4B16FFA9.6070002@FreeBSD.org> <4B17B4DA.7050403@FreeBSD.org>
next in thread | previous in thread | raw e-mail | index | archive | help
Alexander Motin wrote: > ### load mav@ > linear 1MB read random > 1 process MBps: 104 tps: 159 > 2 processes MBps: 214 tps: 256 > 4 processes MBps: 425 tps: 332 > 5 processes MBps: 300 tps: 352 > 8 processes MBps: 245 tps: 391 > 16 processes MBps: 255 tps: 436 > 32 processes MBps: 263 tps: 457 > > Random is close to round-robin. Request balancing is close to perfect. > Linear shows maximum possible performance for number of processes up to > the number of drives, using only as much disks as needed. With more > processes then disks, performance predictably reducing, but still beats > all other methods. > > I think it is hardly possible to get much more. > Awesome, please commit - this issue has been dragging for too long already. Pawel seems either busy or have lost interest in maintaining this, so you don't really need to wait for his approval. -Maxim
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?4B181CC8.1040205>