Orlov block allocator: Difference between revisions

Revision as of 21:14, 13 June 2013

Revision as of 22:34, 21 July 2016

Line 2:

== Etymology ==

The scheme is named after its creator Grigory Orlov, who first posted a brief description and implementation for [[OpenBSD]]<ref>{{cite web | url=http://www.ptci.ru/gluk/dirpref/old/dirpref.html | title=Directory Allocation Algorithm For FFS | author=Grigoriy Orlov |archiveurl = httphttps://web.archive.org/web/20080131082712/http://www.ptci.ru/gluk/dirpref/old/dirpref.html |archivedate = 2008-01-31}}</ref> of the technique which was later used in the [[BSD]] Fast Filesystem [[Kernel (computer science)|kernel]] variants.

== Background ==

Line 15:

== Performance ==

The Orlov block allocator was shown to offer performance gains on workloads that traverse directory trees <ref>{{citecitation|url=http://static.usenix.org/events/usenix02/tech/freenix/dowse.html|title=Recent Filesystem Optimisations in FreeBSD}}</ref> on FreeBSD. {{As of|2007|10}}, only one benchmark result<ref>{{citecitation|url=httphttps://lwn.net/Articles/14631/|title=naive but spectacular ext3 HTREE+Orlov benchmark|author=Bert Hubert

}}</ref> for ext3 with the new allocator seems to have been posted. The results are promising: the time required to traverse through a Linux kernel tree was reduced by roughly 30%.

Line 25:

== External links ==

* [httphttps://lwn.net/Articles/14633/ The Orlov block allocator]

* [httphttps://lwn.net/Articles/14447/ Orlov block allocator for ext3] e-mail from Theodore Ts'o to [[Linus Torvalds]] and [[Alexander Viro]]

[[Category:Unix file system technology]]