If you're curious about how Code Co-op works and how it is being developed, you might be interested in Bartosz's Reliable Software blog.
You may also vote for particular posts on reddit using the gadget below. Also, if you could post a link on reddit, we'd be very grateful. Don't worry about low ratings on reddit--the trolls from git down-vote everything about distributed version control systems other than theirs.
If you're interested in multi-thread programming, both high- and low-level, practical and theoretical, see Bartosz's Programmer's Blog for the latest installment. Here are some excerpts:
...This is a cautionary story for high-level programmers. Do not elide synchronization even in the simplest, seemingly obvious cases! Don’t try to be clever! The processors (and the compilers) are out there to get you. The slightest slip and they will “optimize” your code in a way that is contrary to your intuitions.
...In Java, for instance, you must make sure that access to shared variables (both for reading and writing) is protected by locks (e.g., synchronized sections). If you are adventurous, and want to share variables without locking, you must declare them as volatile. Finally, if you try to share non-volatile variables without locking, you are introducing data races and your program is considered incorrect (it might still work on some processors). This is what the Java memory model is about, in a nutshell.
One of the common concurrency errors is accidental sharing. Some data structures are designed for multi-threaded access, e.g., objects with synchronized methods; and they usually work just fine (except for deadlocks). The problem is when a chunk of data that was not designed for sharing is accessed by multiple threads. There is no easy way to detect this error since, in general, concurrency bugs are hard to reproduce.
You may also vote for particular posts on reddit using the gadget below.