Thanks for the reply. I had thought that IO wait would initially be the limiting factor in a threaded rmtree operation, but some early (non-perl, but shell with multiple process(not-threaded)) experiments indicated that I may see some improvement over a recursive deletion.
I admit ignorance as to how Perl's rmtree is implemented, but I thought there may have been some loose parallels.
Unfortunately, after spending a couple of hours on a fine Sunday testing a (quick and dirty) threaded rmtree failed to yield the results I was looking to justify my initial query.
Namely, the single deltree operation that seemed to be taking over two hours according to logfiles, took only 158 seconds using a threaded model, but surprisingly enough; only 222 seconds using a single, top-level rmtree operation.
Suffice to say; I am both humbled and stumped. I've put some additional logging into the script to try to determine exactly where the bottle-neck is occurring (I'm thinking it may be due to my scarce logging practices and the compressions of said tree prior to removal). Hopefully, I'll have some better meditation fodder tomorrow.
In reply to Re^2: Threaded tree deletion
by ltp
in thread Threaded tree deletion
by ltp
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |