HAMMER Performance

Posted by Sander_Marechal on Oct 14, 2007 9:47 PM EDT
KernelTrap
Mail this story
Print this story

"I've never looked at the Reiser code though the comments I get from friends who use it are on the order of'extremely reliable but not the fastest filesystem in the world'," Matt Dillon explained when asked to compare his new clustering HAMMER filesystem with ReiserFS, both of which utilize BTrees to organize objects and records. He continued,"I don't expect HAMMER to be slow. A B-Tree typically uses a fairly small radix in the 8-64 range (HAMMER uses 8 for now). A standard indirect block methodology typically uses a much larger radix, such as 512, but is only able to organize information in a very restricted, linear way." He continued to describe numerous plans he has for optimizing performance,"my expectation is that this will lead to a fairly fast filesystem. We will know in about a month :-)

Full Story

  Nav
» Read more about: Story Type: News Story

« Return to the newswire homepage

This topic does not have any threads posted yet!

You cannot post until you login.