It seems like this is the summer of multicore panic. I can’t open a technical magazine without some pundit declaring that our current programming paradigms are useless when running on new multicore CPU architectures. Venerable analyst John Dvorak, who generally actually understands what he is writing about, coughed up this mess (with minor excisions for […]

continue reading.....

My email address shows up in a lot of public places, including domain registration records, hundreds of USENET posts, magazine articles, and various web sites. As a result, it has been harvested by every spammer known to mankind, and I get a lot of bad email.
This includes more than just spam. I show up as […]

continue reading.....

This article presents the algorithm that solves the Byzantine General’s Problem, as first described by Lamport, Pease, and Shostak in 1982 [1]. While Lamport’s algorithm is not particularly complex, programmers who aren’t used to working on distributed computation might find it difficult to implement. To accompany the explanation of the algorithm, I have included a C++ program designed for experimentation with the solution.

continue reading.....

The IEEE has announced its list of medal winners for 2007, and this year’s Richard Hamming medal was awarded to Dr. Abraham Lempel:
For pioneering work in data compression especially the Lempel-Ziv algorithm.

This is a timely award, because it comes on the 30th anniversary of the publication of the first of two seminal papers by […]

continue reading.....