| 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
| ||
|
Message-ID: <4CFF2C1A.1010100@fusionio.com> Date: Wed, 8 Dec 2010 14:56:26 +0800 From: Jens Axboe <jaxboe@...ionio.com> To: Shaohua Li <shaohua.li@...el.com> CC: lkml <linux-kernel@...r.kernel.org>, "vgoyal@...hat.com" <vgoyal@...hat.com> Subject: Re: [RFC]block: change sort order of elv_dispatch_sort On 2010-12-08 13:42, Shaohua Li wrote: > Change the sort order a little bit. Makes requests with sector above boundary > in ascendant order, and requests with sector below boundary in descendant > order. The goal is we have less disk spindle move. > For example, boundary is 7, we add sector 8, 1, 9, 2, 3, 4, 10, 12, 5, 11, 6 > In the original sort, the sorted list is: > 8, 9, 10, 11, 12, 1, 2, 3, 4, 5, 6 > the spindle move is 8->12->1->6, total movement is 12*2 sectors > with the new sort, the list is: > 8, 9, 10, 11, 12, 6, 5, 4, 3, 2, 1 > the spindle move is 8->12->6->1, total movement is 12*1.5 sectors It was actually done this way on purpose, it's been a while since we have done two way elevators even outside the dispatch list sorting itself. Do you have any results to back this change up? I'd argue that continuing to the end, sweeping back, and reading forwards again will be faster then doing backwards reads usually. -- Jens Axboe -- 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