lists.openwall.net   lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  linux-cve-announce  PHC 
Open Source and information security mailing list archives
 
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date:	Sat, 19 Sep 2009 10:31:49 +0200
From:	Arjan van de Ven <arjan@...radead.org>
To:	Jim Meyering <jim@...ering.net>
Cc:	Theodore Tso <tytso@....edu>,
	Linux Kernel Mailing List <linux-kernel@...r.kernel.org>
Subject: Re: efficient access to "rotational";  new fcntl?

On Sat, 19 Sep 2009 10:01:51 +0200
Jim Meyering <jim@...ering.net> wrote:
> Yeah, I mentioned I should do exactly that on IRC yesterday.
> I've just run some tests, and see that at least with one SSD (OCZ
> Summit 120GB), the 0.5s cost of sorting pays off handsomely with a
> 12-x speed-up, saving 5.5 minutes, when removing a
> 1-million-empty-file directory.
> 

likely because you actually reduce the amount of IO; inodes share
disk blocks; repeated unlinks in random order likely write the same
block multiple times....


btw have you given thought about using threads as part of rm -r[f] ?
(would make the unlinks of unrelated directories/files asynchronous)

-- 
Arjan van de Ven 	Intel Open Source Technology Centre
For development, discussion and tips for power savings, 
visit http://www.lesswatts.org
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/

Powered by blists - more mailing lists

Powered by Openwall GNU/*/Linux Powered by OpenVZ