Breadth-first traversal on Cell.

Oct 18, 2007 18:59

DDJ 's article on subject

Цитата:On a Pentium 4 HT running at 3.4 GHz, this algorithm is able to check 24-million edges per second. On the Cell, at the end of our optimization, we achieved a performance of 538-million edges per second. This is an impressive result, but came at the price of an explosion in code complexity. While the algorithm in Listing One fits in 60 lines of source code, our final algorithm on the Cell measures 1200 lines of code.

Даже и не знаю, читать ли дальше. ;)

cell, графы

Previous post Next post
Up