[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <4AF0A956.5020600@gmail.com>
Date: Tue, 03 Nov 2009 23:06:14 +0100
From: Eric Dumazet <eric.dumazet@...il.com>
To: Benjamin LaHaise <bcrl@...et.ca>
CC: "Eric W. Biederman" <ebiederm@...ssion.com>,
Greg KH <greg@...ah.com>,
Octavian Purdila <opurdila@...acom.com>,
netdev@...r.kernel.org, Cosmin Ratiu <cratiu@...acom.com>
Subject: Re: [PATCH 1/3] sysfs directory scaling: rbtree for dirent name lookups
Benjamin LaHaise a écrit :
> On Tue, Nov 03, 2009 at 01:43:43PM -0800, Eric W. Biederman wrote:
>> I guess in particular what I would expect is that if we can do 35000
>> interfaces in 63s with an O(N^2) algorithm. Then we should be able to
>> do 35000 interfaces with an O(NlogN) algorithm in under a second.
>> Which for your application should make the time essentially flat in
>> the number of interfaces.
>
> That's the wrong way to interprete the numbers. The 35000 number of 63s is
> the time that it takes 63s to add 5000 more interfaces in the 30,000 to
> 35,000 range. This includes the time required to add a point to point ip
> route on the interface and bring the interface up.
Speaking of pppol2tp, it seems /proc/net/pppol2tp is not safe,
with a strange two phases locking...
(We keep in struct pppol2tp_seq_data pointers to structures
that might have been freed between to read() syscalls)
--
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Powered by blists - more mailing lists