I think the bottleneck is the problem he is trying to solve: forward messages from one producer to one consumer in order. This is an inherently sequential problem, all it requires is a FIFO and a select on two file descriptors. The only thing that changes if you introduce treads is that they must continuously coordinate to find out who should send the next message. "I'm only dangerous with synchronized blocks", indeed.