lkml.org 
[lkml]   [2008]   [Apr]   [1]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: UBIFS vs Logfs (was [RFC PATCH] UBIFS - new flash file system)
Jörn Engel wrote:
> Correct. I have a patch that caches this information in RAM, so the
> worst-case scenario is to do the full scan once - if the filesystem is
> near 100% full and performance is down the drain anyway. The goal is
> obviously to store that information on the medium.

Anyway, if you do not store this information on the flash, you are going
to scan to acquire it. You may have caches, but they do not have to have
information (may be empty), then you scan. This will lead to scalability
problems at some point anyway.

>> UBIFS stores per-eraseblock information on the media in a B-tree, and
>> it also has lists of empty/dirty eraseblocks, which allow to very quickly
>> find the best eraseblock to garbage-collect or to write to.
>
> So how do you solve the catch-22?

I'm not sure what you mean. In UBIFS we have lprops area, where we store
per-LEB accounting. UBI lets it possible to have it on a fixed position.
The accounting is a separate B-tree. Lprops area has its own independent
garbage collector. You should probably refer the white paper for more
information.

--
Best Regards,
Artem Bityutskiy (Артём Битюцкий)
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2008-04-01 11:45    [from the cache]
©2003-2011 Jasper Spaans