(please don't top post)
On Sun, Jun 11 2006, Vishal Patil wrote:
> Jan
>
> I ran the performance benchmark on an IBM machine with the following
> harddrive attached to it.
>
> cat /proc/ide/hda/model
> ST340014A
Ok, so plain IDE.
> Also note the CSCAN implementation is using rbtrees due which the time
> complexity of the different operations is O(log(n)) and not O(n) and
> that might be the reason that we are getting good values for specially
> in case of sequential writes and the random workloads.
Extremely unlikely. The sort overhead is completely noise in a test such
as yours, an O(n^2) would likely run just as fast.
--
Jens Axboe
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
[Index of Archives]
[Kernel Newbies]
[Netfilter]
[Bugtraq]
[Photo]
[Stuff]
[Gimp]
[Yosemite News]
[MIPS Linux]
[ARM Linux]
[Linux Security]
[Linux RAID]
[Video 4 Linux]
[Linux for the blind]
[Linux Resources]
