[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [PATCH] Use a heap for the internal merge.
From: |
Pádraig Brady |
Subject: |
Re: [PATCH] Use a heap for the internal merge. |
Date: |
Mon, 16 Mar 2009 23:47:00 +0000 |
User-agent: |
Thunderbird 2.0.0.6 (X11/20071008) |
Jim Meyering wrote:
> Paul Eggert wrote:
>> With random data and a 64-way merge this sped up 'sort' by 5% on our tests.
>
> With my relatively small tests, (total input size is 76MiB,
> very short lines) this patch makes sort about 10% slower:
> (on an Intel(R) Core(TM)2 Quad CPU Q9450 @ 2.66GHz, w/6MB cache per core):
Confirmed, on pentium-m 1.7GHz single core.
With different less random data...
for i in $(seq 100); do seq 100000 >$i; done
time ../src/sort -nm * >/dev/null
real 0m10.288s
user 0m9.444s
sys 0m0.423s
time ../src/sort -nm * >/dev/null
real 0m14.919s
user 0m13.897s
sys 0m0.444s
Pádraig.