Slashdot Log In
NetBSD Focuses On Scalability
Posted by
timothy
on Wed Nov 05, 2003 11:13 AM
from the quick-rise dept.
from the quick-rise dept.
An anonymous reader writes "Felix von Leitner recently performed some benchmarks (previous story) for a talk about scalable network programming he held at Linux Kongress 2003. The winners in this scalability lineup were Linux and FreeBSD 5, followed by NetBSD and finally OpenBSD.
What's interesting is that in only two weeks time the NetBSD team made dramatic improvements. Felix performed his benchmarks again and the results are nothing short of astonishing. NetBSD now has better scalability than FreeBSD." Read on for a list of improvements.
the submitter lists these changes:
- socket: previously O(n), now O(1).
- bind: greatly improved, but still O(n). Much less steep, though.
- fork: a modest O(n) for dynamically linked programs, O(1) for statically linked.
- mmap: a bad O(n) before, now O(1) with a small O(n) shadow.
- touch after mmap: a bad strange graph in 1.6.1, a modest O(n) a week ago, now O(1).
- http request latency: previously O(n), now O(1)
This is a very good job from the NetBSD team! I hope to see more benchmarks and more improvement for a great OS like NetBSD."
This discussion has been archived.
No new comments can be posted.
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
Target (Score:2, Interesting)
(http://watkin5.net/)
Colour me cynical, but just maybe the improvements are targeted to produce a better benchmark rather than broader scalability.
Tell me I'm wrong.
Re:Target (Score:5, Insightful)
Benchmarks are great tools to use for improving performance, and as long as you don't have to cheat to do better, (like some major video card companies who shall remain nameless) improving your scores on a good benchmark largely equates to improving performance across a whole host of applications.
If you'll remember, the same thing happened with the Netcraft debacle; performance deficiencies in Linux wrt. NT were highlighted, and fixed, and Linux is the better for it, with even faster webserving, and a better TCP/IP stack. I don't care about the alleged reasons, I care about the positive results.
Re:Target (Score:4, Insightful)
(http://phonedifferent.com/)
NetBSD's team is scary good. There are some advantages to keeping a tight core development team, and if the team is good, one of them is quality.
In my experience with NetBSD, when they do something, they do it right.
Let me put it to you this way.
Say there was this huge alien spaceship coming from outer space to blow up the white house and use us as food. We'd need to send a rag-tag group of crazy operating system geniuses up into space in a rocket to intercept them and upload a virus into their system (this would no doubt piss off the stiff-necks in the military, but the orders would no doubt come from up top). That rag-tag group of crazy OS geniuses would be the NetBSD team.
NetBSD is very cool (Score:5, Interesting)
(http://www.n1ywb.com/ | Last Journal: Wednesday April 28 2004, @03:12PM)
Anyway if you've never tried NetBSD, I think you should. At least get it installed and compile a kernel. It's a good learning experience. Plus it's been ported to every fsking hardware platform ever (just about.)
Not Bad for a Dying OS :-) (Score:4, Insightful)
I run GNU on my machines. I'm not picky about kernels.
What? (Score:4, Interesting)
(http://slashdot.org/~wowbagger/journal/87552 | Last Journal: Monday September 03, @08:07PM)
What the hell is this supposed to mean? Either you are O(1) or you are O(n) - what is "small O(n) shadow" mean?
Re:What? (Score:4, Informative)
(http://craigbuchek.com/)
big doh notation (Score:5, Interesting)
O notation is overrated. Sorting is always described as O(N*log N), but for any practical architecture using a radix sort with L1/L2 cache locality, replace log N with the constant factor of 3 or 4. A million cache local buckets can radix sort 10^30 elements in 3 log N time.
Using all of main memory as your bucket store, I'd guess you could sort every proton in the known universe in 8 passes. So what exactly is that log N term trying to tell us?
Trying this out (Score:1)
Felix von Leitner "papers" ... cum grane salis (Score:4, Interesting)
(http://www.encyclopediadramatica.com/ | Last Journal: Saturday December 02 2006, @04:02AM)
Don't use OpenBSD for network servers.
If you are using OpenBSD, you should move away now.
http://news.netcraft.com/archives/2003/11/02/secu
little question (Score:2)
Since the author actually reads the slashdot comments, I've a little question.
I'm no real kernel hacker, so I could be totally off, but:
Are all OSes located on the same part of the (same) HD? This because linear performance probably scales linear with the cylinder the OS partitions is on.
Great... running it on my VAX (Score:2, Interesting)
NetBSD is starting (not yet, but close) to become dangerously close to the precipice of being Bloatware(*)
First on my list to replace is GCC which has ballooned in size way way too much for the "features" that have been recently included.
TDz.
(*Bloatware is a TM of Microsoft corp)
Open Source, +1 RedHat (Score:1, Troll)
Re:Nice (Score:3, Informative)
Re:Failure (Score:1)
(http://www.beefdart.com/)
Sometimes, its just too easy:
http://news.netcraft.com/archives/2003/11/
Choke on it and die.