On Sun, 2009-08-23 at 09:32 +0800, Wu Fengguang wrote:
Right, so:
bdi_thresh_n = dirty_thresh * p(n) + eps.
and
\Sum_n p(n) = 1
So:
\Sum_n bdi_thresh_n = dirty_thresh + n*eps
Which yields an O(n) error bound.
I'm just not sure how large the thing is in reality, and paranoia won
out.
--
To unsubscribe from this list: send the line "unsubscribe linux-fsdevel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html