Date: Thu, 05 Mar 2009 12:30:12 +0100 From: Jordi Espasa Clofent <jespasac@minibofh.org> To: freebsd-geom@freebsd.org Subject: Re: gmirror(8): round-robin vs. load algorithm Message-ID: <49AFB7C4.4030202@minibofh.org> In-Reply-To: <49AFB41F.8030204@freebsd.org> References: <49AF9B6C.8090908@minibofh.org> <49AFB41F.8030204@freebsd.org>
next in thread | previous in thread | raw e-mail | index | archive | help
Ivan Voras escribió: > There are some performance-improving patches for gmirror out there, for > example here: > > http://www.freebsd.org/cgi/query-pr.cgi?pr=kern/113885 Yes, I know it (indeed I've read it previously to write my post). But according my own benchmark (using postmark tool) the performance of 'load' it's the same as 'round-robin'. So, I tend to view 'load' algorithm (even in this current implementation) as a kind of 'secure round-robin' for a servers with high I/O. > Maybe you should contact pjd. He's so busy. I hope he could read this message in list. -- Thanks, Jordi Espasa Clofent
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?49AFB7C4.4030202>