Implementing Queues for Event-Driven Programs

Re:Implementing Queues for Event-Driven Programs by gpderetta on Monday June 13, 2016 @11:32AM (#11894669)

Regarding "Removing locks completely", the author laments not knowing of any readily available library providing the blocking-on-necessary support.

I suggest looking into Event Counts, which can be used to non-intrusively add blocking behavior to most lock free queues; they are the non-blocking world equivalent of condition variables. Facebook's Folly library provides a readily available open source implementation of Event Counts.

[ Parent | on HN ]

Re:Implementing Queues for Event-Driven Programs by no-bugs on Tuesday June 14, 2016 @12:21AM (#11899762)

THANKS! I've added it (not 100% sure how it would work in practice, but certainly looks interesting).

[ Parent | on HN ]

Re:Implementing Queues for Event-Driven Programs by gpderetta on Tuesday June 14, 2016 @07:25AM (#11901227)

You are welcome. Note that the event count is a general synchronization primitive, the one in folly is just an implementation.

BTW, you can build an efficient event count on top of eventfd, so you can even poll/select it.

[ Parent | on HN ]