[Gluster-devel] [bug #17353] fast-dircache for quick lookups

Anand Avati INVALID.NOREPLY at gnu.org
Mon Aug 7 12:08:28 UTC 2006


                 Summary: fast-dircache for quick lookups
                 Project: Gluster
            Submitted by: avati
            Submitted on: Monday 08/07/2006 at 12:08
                Category: GlusterFS
                Severity: 5 - Blocker
                Priority: 5 - Normal
              Item Group: Redesign
                  Status: None
                 Privacy: Public
             Assigned to: vikasgp
             Open/Closed: Open
        Operating System: GNU/Linux



a library for storing dir entries using two dimensional data strucutre, hash
table in one dimension fo'yr operations and a linked list in another
dimension for maintainence (allocation/free/ageing) is needed to implement
xlators like unionfs, ALU, Raid-0.

the library gives a lookup (via hash table) from filename to file-layout
(pointer to which child xlator has the file). Every lookup on an entry makes
the entry 'younger'. Entries are pre-allocated and 'oldest' entry is salvaged
for new entry request.

cache coherancy can be easily handled by invalidating the cached entry when a
cache-miss is encountered and rebuilding the entry.

implementing a simple geneirc hash table api into libglusterfs is needed as
part of implementing the dircache


Reply to this item at:


  Message sent via/by Savannah

More information about the Gluster-devel mailing list