Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Koranne, S. (2009). Graph Theory on the CBEA. In: Practical Computing on the Cell Broadband Engine. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-0308-2_11
Download citation
DOI: https://doi.org/10.1007/978-1-4419-0308-2_11
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-0307-5
Online ISBN: 978-1-4419-0308-2
eBook Packages: Computer ScienceComputer Science (R0)