Abstract: Prim's algorithm and Kruskal's algorithm are two common ones for minimum spanning tree which has a wild application in computer networks, information security, and so on. However, due to the data structures and the interactive processes of these two algorithms, it is difficult to make them parallelized with the help of general parallel algorithm on GPU. Sollin’s algorithm, old though it is, on the other hand, can expand several spanning trees independently at the same time during iteration, which finally turns the forest into a MST after times of iteration. It is much easy for acceleration using the general parallel algorithm on GPU for it has such characteristics. It is for this reason that we present a novel parallel Sollin’s algorithm on the GPU. We design the data structure for Sollin’s algorithm in consideration of parallelism of GPU and then do some parallelization which is based on a fast algorithm for tree mergence. We adopt several groups of data of different scales to test our algorithms. The experimental results show that this method achieves an acceleration of 10 to 18 compared with the traditional CPU-based one when the data are of a large scale.