Hi Matthias,<br><br>To answer your questions:<br><br>Is the number of consumers constant?<br><div style="margin-left: 40px;">No, I am trying to adjust the number of consumers to accommodate increases in the rate of publishing.<br>
</div>
<br>
Can you arrange for all consumers to subscribe before messages are being published?<br><div style="margin-left: 40px;">Before I publish any messages, I make sure the consumers are subscribed. However, I cannot do this for new consumers I want to add when I am trying to match the publishing rate.<br>
</div>
<br>
Are all your consumers operating at approximately the same rate?<br><div style="margin-left: 40px;">Each consumer is identical, so they should all be operating at approximately the same rate<br></div>
<br>
Is the total rate of consumption greater than the rate of publication? (It better be, or you will run out of memory eventually)<br><div style="margin-left: 40px;">My goal is to increase the consumers to match the queue length (and therefore the rate of publication).<br>
</div><br>What are your suggestions?<br><br>Thanks,<br>--Brian<br><br><div class="gmail_quote">On Sun, Nov 30, 2008 at 2:48 PM, Matthias Radestock <span dir="ltr"><<a href="mailto:matthias@lshift.net">matthias@lshift.net</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">Brian,<div class="Ih2E3d"><br>
<br>
Brian Noguchi wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
If I don't use the branch, what strategy would you suggest in order to make sure that several consumers of a queue are consuming an equal number of messages without all the messages piling up into the local buffer of a consumer? Any other alternatives than just doing a Basic.get periodically?<br>
</blockquote>
<br></div>
That depends on the use case.<br>
<br>
Is the number of consumers constant?<br>
<br>
Can you arrange for all consumers to subscribe before messages are being published?<br>
<br>
Are all your consumers operating at approximately the same rate?<br>
<br>
Is the total rate of consumption greater than the rate of publication? (It better be, or you will run out of memory eventually)<br>
<br>
<br>
Depending on the answers to the above, the normal round-robin distribution mechanisms employed by queues may suffice.<br><font color="#888888">
<br>
<br>
Matthias<br></font>
PS: please keep the list cc'ed.<br>
</blockquote></div><br>