Zbr's days.
March
Sun Mon Tue Wed Thu Fri Sat
           
25
         
2008
Months
Mar
Sep
Oct Nov Dec

About TODO Blog RSS Old blog Projects Gallery Notes

Tue, 25 Mar 2008

POHMELFS status.

I've started mostly from scratch, I think it is a good sign, when project can be rewritten without any pain to implement a really interesting ideas instead of having multiple crutches all over the place. This also means that it is not that complex, so I do not regret about dropped code.

Now it is in a very testing stage without network protocol at all, but I test new paradigm in the pohmelfs: its inodes will not be hashed into global hash table, but instead will be placed into local trie-like structure, which (optionally) will allow RCU-fied lookup. Something similar to data structure created for multidimensional trie used for unified socket lookup patch.

I very like two-hash approach, but since there is no proof (yet) it will work for all possible cases, I will first implement radix-like tree to store object names. Network protocol will also operate on full-length pathes, which actually can be a bad idea, I will see.

Another uber cool feature of the full-path approach is ability to create number of directories, which form a path to given object, in a single command, i.e. when client sends a network command to create object /a/b/c/d/file, there is no need to send separate commands to create /a, /a/b and so on, it can be done automatically by server. This requires to send not only path though, but also information about permissions for each subdir.

/devel/fs :: Link / Comments (2)

ak wrote at 2008-03-25 12:29:

The uber cool feature sounds a little useless because it cannot be expressed in POSIX system calls nor in current Linux VFS calls.

Zbr wrote at 2008-03-25 14:25:

It allows to avoid additional network transfers, so there will not be performance and latency drops during processing. Server code will parse the structure and create objects one-by-one.

Please solve this captcha to be allowed to post (need to reload in a minute): 14 * 73

Comments are closed for this story.