On 23/09/2013 06:34, Adrian Chadd wrote:
On 22 September 2013 21:52, Luigi Rizzo <ri...@iet.unipi.it> wrote:
locking affects scalability; but dxr and similar algorithms have much fewer
memory lookups, not to mention the huge memory footprint of
the freebsd radix tree code.
Anyways i'd really encourage you to read the dxr paper, it is short
and hopefully can give you a better idea of the details (and with data
supporting them) than these short notes.
I read the paper. :-)
I believe it! It's not the first paper that I've read that packed a FIB
into a sensibly cacheable structure. I'm just as interested however in
making sure that we actually give people the tools to inspect this stuff
for themselves, rather than all of us hacking up something from scratch
every time we want to profile this kind of thing.
The other side of this coin is locking, and the paper didn't go into that.
Eliminating the radix tree overhead is great; now we just have to avoid
grabbing all those locks all the damned time for each frame..
-adrian
The paper is insane, awesome work - actually faster and more efficient
than many popular ASICs.... is there any chance of a patch for HEAD/9
being made? I had a go at forward porting it but there are too many
changes that I don't understand :(
Cheers,
Joe
_______________________________________________
freebsd-net@freebsd.org mailing list
http://lists.freebsd.org/mailman/listinfo/freebsd-net
To unsubscribe, send any mail to "freebsd-net-unsubscr...@freebsd.org"
