2 ms·
Key == mailbox/slot, and value == message. All you need are concurrency primitives, and broadcasting (in the case of a distributed queue) People have modeled m
by mahmud 17y ago
Key == mailbox/slot, and value == message. All you need are concurrency primitives, and broadcasting (in the case of a distributed queue)
People have modeled message queues with far more primitive solutions:
http://www.freeopenbook.com/php-hacks/phphks-CHP-5-SECT-18.html http://www.freeopenbook.com/php-hacks/phphks-CHP-5-SECT-18.h...
A Redis based solution might not be as elaborate as RabbitMQ, but it will be very clean and straightforward, not to mention blindingly fast, and will get the job done.
- moe 17y agoWell, I'm quite skeptical about the "blindingly fast" part (network overhead?) but agree that in the light of the current mq-options that's indeed one of the more appealing ideas. That said, I'm not really in the mood to reinvent that particular wheel myself here, but would probably give someone else's shot a try.