From mboxrd@z Thu Jan 1 00:00:00 1970 From: Hans Reiser Subject: Re: [PATCH] various allocator optimizations Date: Wed, 12 Mar 2003 01:46:38 +0300 Message-ID: <3E6E674E.4040305@namesys.com> References: <1047400482.8215.312.camel@tiny.suse.com> <20030311194205.A4493@namesys.com> <1047403968.8219.337.camel@tiny.suse.com> <3E6E584D.4080809@namesys.com> <1047421551.8219.448.camel@tiny.suse.com> Mime-Version: 1.0 Content-Transfer-Encoding: 7bit Return-path: list-help: list-unsubscribe: list-post: Errors-To: flx@namesys.com In-Reply-To: <1047421551.8219.448.camel@tiny.suse.com> List-Id: Content-Type: text/plain; charset="us-ascii"; format="flowed" To: Chris Mason Cc: Oleg Drokin , reiserfs-list@namesys.com Chris Mason wrote: >On Tue, 2003-03-11 at 16:42, Hans Reiser wrote: > > > >>Chris, don't you think the right answer would be to take zam's resizer >>and make a defragmenter out of it? >> >> > >Yes and no, for a defrag program to fix things we'd have to agree on an >optimal layout ;-) Also it assumes the machine has idle time when a >defragment cycle is possible. > No, it assumes that 80% of files don't move during the course of a week, so if defrag takes a week, it still adds value. > For many servers this is entirely >untrue...the oracle boxes I ran didn't have a spare second for something >like a defrag. > >We can all agree that fragmentation is bad, but the real question is how >do we group the blocks. Lets pretend for a minute that fragmentation >isn't an issue at all, and our allocator is perfect. > >The optimal grouping for reading/writing files is to have the files you >are going to read/write together in the same area of the disk. > >The current default uses the start of the disk as a starting point for >each new file. > No, it uses the left neighbor in the tree. Please correct me if I am wrong, because if I am wrong we have a bug. > This roughly translates to files that are created >together end up in the same part of the disk. As long as you always >access files in roughly the same order that you create them, it performs >pretty well. > >But if a process creates dirA/file1 and then dirB/file2, file1 and file2 >are going to be together on the disk. If file1 tends to be used along >with all the other files in dirA, performance will suffer because we've >got to seek from all the other files in dirA over to file1. > If I understand your intended statement, you meant to say If file1 tends to be used along with all the other files in dirA, performance will suffer because we've got to seek over all other files in dirB when going from file1 to the next file in dirA.. > >And this is what we see over time, our performance decreases as people >add files onto their directories and shift things around. Especially on >multi-user systems files are rarely accessed in the same order they were >created. > >What we need is a knob for the admin to use to suggest 'I'm probably >going to access these files together'. The only one I can think if is >the directory itself, but it isn't optimal either since subdirectories >are frequently accessed with their parents and with other subdirs. > In 1994, we realized that putting the grandparent directory into the key was infeasible, and decided we would just leave it for some future repacker to try to locate subdirectories of the same directory together. We decided that locating files within the same directory near each other was good enough. I still think this is correct. > >-chris > > > > > -- Hans