[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <20060822171133.72692542.akpm@osdl.org>
Date: Tue, 22 Aug 2006 17:11:33 -0700
From: Andrew Morton <akpm@...l.org>
To: Jeff Mahoney <jeffm@...e.com>
Cc: David Masover <ninja@...phack.com>,
Linus Torvalds <torvalds@...l.org>,
Linux Kernel Mailing List <linux-kernel@...r.kernel.org>,
ReiserFS List <reiserfs-list@...esys.com>,
Mike Benoit <ipso@...ppymail.ca>
Subject: Re: [PATCH] reiserfs: eliminate minimum window size for bitmap
searching
I can see that the bigalloc code as-is is pretty sad, but this is a scary
patch. It has the potential to cause people significant performance
problems way, way ahead in the future.
For example, suppose userspace is growing two files concurrently. It could
be that the bigalloc code would cause one file's allocation cursor to
repeatedly jump far away from the second. ie: a beneficial side-effect.
Without bigalloc that side-effect is lost and the two files blocks end up
all intermingled.
I don't know if that scenario is realistic, but I bet there are similar
accidental oddities which can occur as a result of this change.
But what are they?
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists