It seems to me that parallelizing, without substantial locking (-> serialization) or very clever design, is likely to *reduce* correlations between block requests and thus *increase* seeking substantially: and if you're adding enough locking to keep correlations between block requests, you can probably make the whole algorithm a serial one without much difficulty. Certainly the naive implementations (e.g. multiple threads, one per block group) would hugely increase seeking. (There's lots of unavoidable serialization too: e.g. you can't carry out the passes all at once, or in a significantly different order.)
Copyright © 2017, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds