Orlov block allocator

The Orlov block allocator is an algorithm to define where a particular file will reside on a given filesystem (blockwise), so as to speed up disk operations.

Etymology

The scheme is named after its creator Grigory Orlov, who first posted a brief description and implementation for OpenBSD ^[1] of the technique which was later used in the BSD Fast Filesystem kernel variants.

Background

The performance of a file system is dependent on many things; one of the crucial factors is just how that filesystem lays out files on the disk. In general, it is best to keep related items together. The linux ext2 and ext3 filesystems, for instance, have tried to spread directories on the cylinders of the disk. Imagine setting up a system with users' home directories in /home: if all the first-level directories within /home (i.e. the home directories for numerous users) are placed next to each other, there may be no space left for the contents of those directories. User files thus end up being placed far from the directories that contain them, and performance suffers.

Spreading directories on the disc allows files in the same directory to remain more or less contiguous as their number and/or size grows, but there are some situations where this causes excessive spreading of the data on the disc's surface.

How it works

Essentially, the Orlov algorithm tries to spread out "top-level" directories, on the assumption that they are unrelated to each other. Directories created in the root directory of a filesystem are considered top-level directories; Ted has added a special inode flag that allows the system administrator to mark other directories as being top-level directories as well. If /home lives in the root filesystem (and people do set up systems that way), a simple chattr command will make the system treat it as a top-level directory.

When creating a directory which is not in a top-level directory, the Orlov algorithm tries to put it into the same cylinder group as its parent. A little more care is taken, however, to ensure that the directory's contents will also be able to fit into that cylinder group; if there are not many inodes or blocks available in the group, the directory will be placed in a different cylinder group which has more resources available. The result of all this, hopefully, is much better locality for files which are truly related to each other and likely to be accessed together.

Performance

As of October 2007^[update], only one benchmark result^[2] 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%.

Evolution

The Orlov scheme needs more rigorous benchmarking; it also needs some serious stress testing to demonstrate that performance does not degrade as the filesystem is changed over time.

References

1. ^ Grigoriy Orlov. "Directory Allocation Algorithm For FFS". Archived from the original on 2008-01-31. http://web.archive.org/web/20080131082712/http://www.ptci.ru/gluk/dirpref/old/dirpref.html. 
2. ^ Bert Hubert, naive but spectacular ext3 HTREE+Orlov benchmark, http://lwn.net/Articles/14631/ 

External links

• The Orlov block allocator
• Orlov block allocator for ext3 e-mail from Theodore Ts'o to Linus Torvalds and Alexander Viro