"DBus Embedded" - a clean break
sandmann at cs.au.dk
Fri Jan 21 09:47:55 PST 2011
"Rémi Denis-Courmont" <remi at remlab.net> writes:
> > In a desktop context, peer to peer also has the major downside that
> > now you need (in theory) N-factorial or so sockets instead of N
> > sockets where N = number of apps. So while it might be faster, you
> > might also run out of file descriptors. Which actually used to happen
> > with ORBit, btw.
> In real life, you will never get even close to the complete N!
I need to pedantically note that the number of edges in a complete
graph is n(n - 1)/2 (= O(n^2)) and not n!.
More information about the dbus