0
0

[–] JeffreyARobinson [S] 0 points 0 points (+0|-0) ago 

I think the first part is pretty cool, but the second part gives a nice introduction to the parallel model and then uses it to prove some runtime results.

Also to get a better understanding of the algorithm check out [1] and [2].

For a better understanding of the programming model check out [3] or [4]

  • [1] D. A. Bader and K. Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In ICPP, pp. 523–530, 2006.
  • [2] Y. Zhang and E. A. Hansen. Parallel breadth-first heuristic search on a shared-memory architecture. In AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications, 2006.
  • [3] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, third edition, 2009.
  • [4] R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. JACM, 46(5):720–748, 1999.