Concurrent Minimum Spanning Tree

Last updated on Dec 24, 2022

  • Developed a concurrent minimum spanning tree algorithm inspired by Boruvka’s sequential algorithm.

  • Primary Data Structures: Priority Queue, Atomic variables.

  • The algorithm was 59.7% faster than sequential algorithm on randomly generated sparse graphs of order 105 nodes on a 8 core machine.

Systems Concurrent Programming
Nidhi Dhamnani
Nidhi Dhamnani
Software Engineer

My research interests include Machine Learning, Information Retrieval, Distributed Systems, and Cloud Computing.

Related