Graph Theory on the CBEA
Graph theory is a cornerstone of computer science and recently has also become very useful in high-performance computing. In this chapter we present several graph theory data-structures and algorithms to solve basic graph problems. These algorithms are implemented on the SPU using 4-way SIMD in the general case. The problems considered include (a) min-cut,(b) minimum spanning tree,(c) comb-sort algorithm,(d) shortest-path algorithm,(e) Floyd-Warshall all-pairs shortest-path algorithm,(f) maximal independent set,(g) graph partitioning,(h) spectral methods for partitioning,and (i) on-line algorithms for streaming properties.
KeywordsSimulated Annealing Hash Function Minimum Span Tree Online Algorithm Local Store
Unable to display preview. Download preview PDF.