Congratulations to Graduate Student Scott Beamer whose Hybrid Breadth-First Search Algorithm was Placed 18th in the November 2011 Graph500 Rankings!

Scott Beamer's hybrid breadth-first search algorithm placed 18th in the November 2011 Graph500 rankings.

The result used a single-node (Intel donated quad-socket) and was able to beat clusters and even graph-specialized architectures such as the Cray XMT and the Convey HC-1ex Graph Personality. It is 2.9x more efficient than any other single-node result, and 28x more efficient than any cluster result.

Click here to read about Graph 500

Click here to see the Complete List of Graph 500 Results