Old but good bit from Brewer demonstrated a good thread implementation is able to handle as much concurrency as a good evented program. Bonus: Russ Cox, now working on Go, is acknowledged for his assistance.

An explanation of a divide-and-conquer algorithm in the context of a very high-performance parallel I/O system. It processes 235 MB/s even as the disk can only deliver 150 MB/s. This validates my experience that global buffers are pretty much guaranteed in high-performance systems.

Bookmarked for concurrent_hash_map

More reading for later about the STL and using it in multi-threaded environments. I use it quite successfully with fine-grained locking using a pile of pthread_mutexes.

The nuances of libevent being multithreaded (it's not) and being used in a multithreaded environment. This very example may have bitten me in the ass before.

Back at it, this time with a beast of a server, a dataset that won't fit in memory (joy of joys!) and (inexplicably) more OCaml.

Decent pthread docs.