On Mon, Jul 17, 2017 at 10:14 PM Zohaib Sibte Hassan <
zohaib.has...@gmail.com> wrote:
> So the scenario I am trying to implement is basically a chat scenario.
>
My first approach would be to measure.
* The full system will have a bottleneck as per Amdahl's law. You need to
take a holistic view
I get about 3 million channel send/receive pairs per second. If you
actually do work inbeteeen (database access, computation, etc.) the limit
is difficult to reach.
On Mon, Jul 17, 2017 at 10:22 AM Jesper Louis Andersen <
jesper.louis.ander...@gmail.com> wrote:
> Your benchmarks are not really *d
Hey Jesper,
Thanks for such an insightful reply. So the scenario I am trying to
implement is basically a chat scenario. With huge chat rooms (thousands of
people) situation, all the listener threads are going to run into this
situation (which is exactly what I am doing here). To elaborate a li
Your benchmarks are not really *doing* something once they get data. This
means that eventual conflicts on (internal or external) locks are going to
be hit all the time. In turn, you are likely to measure the performance of
your hardware in the event of excessive lock contention (this hypothesis
ca
