Jan
I ran the performance benchmark on an IBM machine with the following
harddrive attached to it.
cat /proc/ide/hda/model
ST340014A
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.
I will try making measurements using 2.6.17-rc6-gitX until next weekend.
Thanks for help and inputs folks.
- Vishal
On 6/11/06, Jens Axboe <[email protected]> wrote:
On Fri, Jun 09 2006, Vishal Patil wrote:
> The machine configuation is as follows
> CPU: Intel(R) Pentium(R) 4 CPU 2.80GHz
> Memory: 1027500 KB (1 GB)
> Filesystem: ext3
> Kernel: 2.6.16.2
You don't mention the storage used, which is quite relevant.
If you have the time, please rerun with 2.6.17-rc6-gitX latest. Although
I'm not sure why you think CSCAN is a good scheduling algorithm, in
general it may be fine but there are trivial non-root 'dos' attacks. Any
of the non-noop Linux io schedulers is a better choice imo.
--
Jens Axboe
--
Success is mainly about failing a lot.
-
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]
