Comparative study on Boruvka's implementation on hetrogenous platform with cache analysis

To address the performance analysis of Boruvka's algorithms by analyzing different cache performance parameters in VTUNE Amplifier. In general, Minimum Spanning Tree [MST] is computed with various algorithms, Boruvka's being the oldest and efficient. MST is widely used in applications like search engines, pattern recognition, routing algorithms, network design etc. The paper presents the time comparative study of two different methods of Boruvka's algorithm on different architectures of multi core CPU-chips. It highlights the importance of GPU computing in the modern era and shows that the Compressed Sparse Row[CSR] format of implementation for Boruvka's algorithm outperforms in all the platforms for different readily available benchmarks.