Author

Anand-Kumar

Date of Award

12-1992

Degree Name

Master of Science

Department

Computer Science

First Advisor

Dr. Ajay Gupta

Second Advisor

Dr. Fred Boals

Third Advisor

Dr. Naveed A. Sherwani

Access Setting

Masters Thesis-Open Access

Abstract

In this thesis, we have considered three graph problems namely, spanning forest problem, connected component problem and minimum cost spanning forest problem. Standard methods to solve these problems using sequential algorithms by various authors are presented for each problem. Efficient parallel algorithms for these problems have also been presented by various authors; however, most of these solutions demands a need for large number of processors, which immediately increases the cost of the hardware and in most of the cases it seems not very practical.

We present efficient solutions for the three problems on a hypercube parallel computer using p processors. We implemented our algorithm on the nCUBE-2 parallel computer and experimentally computed the speedup for each algorithm. Our experimental results are very encouraging in general and we observe superior results when compared to the best known algorithms.

Share

COinS