Douglas Eadline writes “A hard to swallow conclusion from the table of cluster. In the first two installments of this series I have been pushing a sales pitch of sorts. If you believe some of the things I talked about, large clusters will break, applications will need to tolerate failure and be easy to write, then you may agree that dynamic programming algorithms are one method to solve these problem. The next question is, how do implement these ideas? The answer is the part many may find distasteful. If you are one of the brave few who take pause to think about how we are going achieve pervasive cluster (parallel) computing, then take a bite out of this story. The rest of the crowd should at least nibble at the edges.”
Link: clustermonkey.net
