Date: Tue, 16 Nov 1999 15:15:13 -0500 (EST) From: Zhihui Zhang <zzhang@cs.binghamton.edu> To: Alfred Perlstein <bright@wintelcom.net> Cc: freebsd-fs@FreeBSD.ORG Subject: Re: On-the-fly defragmentation of FFS Message-ID: <Pine.GSO.3.96.991116150930.11223C-100000@sol.cs.binghamton.edu> In-Reply-To: <Pine.BSF.4.05.9911161331090.12797-100000@fw.wintelcom.net>
next in thread | previous in thread | raw e-mail | index | archive | help
> One of the things that Kirk mused making adaptive was FFS's aggressive > write-behind feature that can cause problems when the entire dataset > fits into ram. Are you talking about softupdate code? Could you explain a little more about this? It seems to me that writes will not happen unless there is no room in the cache. > It doesn't necessarily cause problems, execpt for > the fact that linux has a more aggressive caching algorithm that will > not write anything out until the cache is nearly full. Each approach > has it's advantages and drawbacks, FreeBSD excels when the dataset is > larger than ram, whereas Linux owns the show when it does fit into > ram. An adaptive algorithm would be very benificial for this strategy. Are there any references for this subject? -Zhihui To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-fs" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?Pine.GSO.3.96.991116150930.11223C-100000>