You are viewing a plain text version of this content. The canonical link for it is here.
Posted to users@qpid.apache.org by "Suman.Patro-TRN" <Su...@lntebg.com> on 2015/11/17 15:02:55 UTC
regarding qpid 0.34 C++ broker
Thanks Chuck and Gordon for availing the perftest of qpid. But I have certain other queries too.
1. Memory footprint
I have found the statistics while running the exe in task manager. But how do I calculate the space complexity of qpid in terms of BigOh , Theta or Omega?
2 .Scalability
How many pub sub pairs be active at a time in qpid 0.34 without affecting the throughput of the messages. Is this configurable or fixed? where is it initialized?
3. Routing algorithm
How do I calculate time complexity of routing algorithm in terms of bigoh , theta or omega? Is it a linear matching of subscriptions?
4. Do I need a database for demonstrating persistence or only the qpid build is enough? How to go about?
5. What is the use of server side selectors ?
Kindly reply
Best,
Suman
Larsen & Toubro Limited
www.larsentoubro.com
This Email may contain confidential or privileged information for the intended recipient (s). If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system.