[Haskell-cafe] Bounded STM Queues with load shedding

Alex Hammel ahammel87 at gmail.com
Sat Feb 28 16:31:49 UTC 2015

Forwarding from Haskell-Beginners:

Hi list,

It would be handy for me to have a bounded STM Queue along the lines of
TBQueue with the difference that when the queue is full, a call to
writeTBQueue is a non-blocking no-op.

This is in the context of an asynchronous logging system. If the load
(somehow) gets heavy enough that the log message queue is taking up a lot
of memory, It's better to lose a few log messages than to have processes
block until the logger catches up.

Are there any off-the-shelf solutions?

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20150228/02b7cb02/attachment.html>

More information about the Haskell-Cafe mailing list