The keys are short numbers. I've not seen a profile of the cost of using router sockets that shows any hotspots. This would be worth doing before any real discussion of performance. Otherwise it's just speculation.
-Pieter On Tue, Sep 3, 2013 at 9:03 AM, Ian Barber <[email protected]> wrote: > It's a std:map with an optimised key type for comparisons. All be equal, > shorter should be slightly better, though I can't imagine there's a great > deal in it. > > > On Tue, Sep 3, 2013 at 2:41 AM, A. Mark <[email protected]> wrote: >> >> >> I hope I'm not asking a redundant question and I haven't the time to look >> at the ZMQ source code at the moment. What is the underlying search method >> for routing messages internally within ZMQ_ROUTER? Assuming it's a perfect >> hash - or at least it's some kind of hashing algo based on identity, I >> assume using smaller length identity somewhat reduces the overhead of >> routing? Aside from that I'm wondering is there any other precaution to take >> if one wants to have a very tightly bound lowest latency router (broker) >> over inproc? >> >> >> Any input is appreciated. >> >> >> Mark >> >> _______________________________________________ >> zeromq-dev mailing list >> [email protected] >> http://lists.zeromq.org/mailman/listinfo/zeromq-dev >> > > > _______________________________________________ > zeromq-dev mailing list > [email protected] > http://lists.zeromq.org/mailman/listinfo/zeromq-dev > _______________________________________________ zeromq-dev mailing list [email protected] http://lists.zeromq.org/mailman/listinfo/zeromq-dev
