Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

@article{Bader2004FastSA,
  title={Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs},
  author={David A. Bader and Guojing Cong},
  journal={18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.},
  year={2004},
  pages={39-}
}
  • David A. Bader, Guojing Cong
  • Published 1 November 2006
  • Computer Science
  • 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.

Figures and Tables from this paper

Parallel Minimum Spanning Tree Algorithms and Evaluation
TLDR
Two new parallel MST algorithms that are a variant of Parallel Boruvka algorithms are presented and evaluated that uses lock variables without spin-locks and only atomic compare-and-swap (CAS) primitive.
Scalable parallel minimum spanning forest computation
TLDR
This paper proposes a novel, scalable, parallel MSF algorithm for undirected weighted graphs that leverages Prim's algorithm in a parallel fashion, concurrently expanding several subsets of the computed MSF.
Distributed Memory Parallel Algorithms for Minimum Spanning Trees
TLDR
Experimental results show that Prim’s algorithm is a good choice for dense graphs while Kruskal’'s algorithm is better for sparse ones, and poor scalability of Prim's algorithm comes from its high communication cost while Krushal's algorithm showed much better scaling to larger number of processes.
An experimental study of parallel biconnected components algorithms on symmetric multiprocessors (SMPs)
TLDR
This work presents various optimization techniques and a new parallel algorithm that significantly improve the performance of finding biconnected components of a graph on symmetric multiprocessors (SMPs) and achieves speedups up to 4 using 12 processors on a Sun E4500 for large, sparse graphs.
REVIEW : — Parallel Computing Approach of the Reverse-Delete Algorithm for finding Minimum Bottleneck Spanning Tree and Minimum Spanning Trees —
TLDR
One of the classical graph optimization problems is Minimum Spanning Trees (MST) and another related problem this paper will be addressing and considering is the Minimum Bottleneck Spanning Tree Problem (MBST).
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
TLDR
It is shown that theoretically-efficient parallel graph algorithms can scale to the largest publicly-available graphs using a single machine with a terabyte of RAM, processing them in minutes.
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
TLDR
It is shown that theoretically-efficient parallel graph algorithms can scale to the largest publicly-available graphs using a single machine with a terabyte of RAM, processing them in minutes.
VM BASED EVALUATION OF THE SCALABLE PARALLEL MINIMUM SPANNING TREE ALGORITHM FOR PGAS MODEL
  • V. Bejanyan, H. Astsatryan
  • Computer Science
    9th International Conference "Distributed Computing and Grid Technologies in Science and Education"
  • 2021
TLDR
A modification of the Kruskal algorithm for MST problems based on performance and energy-efficiency evaluation relying on emerging technologies is presented.
A New Parallel Algorithm for Minimum Spanning Tree Problem
TLDR
A new parallel Prim algorithm targeting SMP with shared address space is presented, using the cut property of graphs to grow trees simultaneously in multiple threads and a merging mechanism when threads collide.
On the architectural requirements for efficient execution of graph algorithms
TLDR
This paper considers the performance and scalability of two graph algorithms, list ranking and connected components, on two classes of shared-memory computers: symmetric multiprocessors such as the Sun Enterprise servers and multithreaded architectures (MTA)such as the Cray MTA-2.
...
...

References

SHOWING 1-10 OF 49 REFERENCES
Parallel implementation of Bouvka's minimum spanning tree algorithm
  • Sun Chung, A. Condon
  • Computer Science
    Proceedings of International Conference on Parallel Processing
  • 1996
TLDR
Analysis of a parallel algorithm for the minimum spanning tree problem, based on the sequential algorithm of O. Boruvka (1926), shows that in principle a speedup proportional to the number of processors can be achieved, but that communication costs can be significant.
Communication-optimal parallel minimum spanning tree algorithms (extended abstract)
Lower and upper bounds for finding a minimum spanning tree (MST) in a weighted undirected graph on the BSP model are presented. We provide the first non-trivial lower bounds on the communication
Communication-optimal Parallel Minimum Spanning Tree Algorithms
TLDR
Lower and upper bounds for nding a minimum spanning tree (MST) in a weighted undirected graph on the BSP model are presented and two algorithms with communication requirements that match the lower bound in diierent situations are presented.
Practical parallel algorithms for minimum spanning trees
  • F. Dehne, S. Götz
  • Computer Science
    Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)
  • 1998
TLDR
It is shown that simple algorithms with data-independent communication patterns are efficient both in theory and in practice for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges.
A parallel algorithm for computing minimum spanning trees
We present a simple and implementable algorithm that computes a minimum spanning tree of an undirected weighted graph G = (V;E) of n = jV j vertices andm = jEj edges on an EREW PRAM in O(log3=2n)
Designing Practical Efficient Algorithms for Symmetric Multiprocessors
TLDR
A computational model for designing efficient algorithms for symmetric multiprocessors is presented and this model is used to create efficient solutions to two widely different types of problems - linked list prefix computations and generalized sorting.
Parallel implementation of algorithms for finding connected components in graphs
TLDR
The implementation of several parallel graph algorithms for connected components in parallel, on a 16,384-processor MasPar MP-1 using the language MPL, and several ne-tuning techniques are of general interest, and should be applicable to code for other problems.
Optimizing Graph Algorithms for Improved Cache Performance
TLDR
This work develops new implementations by means of these two techniques for the fundamental graph problem of Transitive Closure, namely the Floyd-Warshall Algorithm, and proves their optimality with respect to processor-memory traffic.
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
TLDR
This work presents a randomized algorithm to find a minimum spanning forest (MSF) in an undirected graph that is optimal w.r.t. both work and parallel time, and is the first provably optimal parallel algorithm for this problem under both measures.
Concurrent threads and optimal parallel minimum spanning trees algorithm
This paper resolves a long-standing open problem on whether the concurrent write capability of parallel random access machine (PRAM) is essential for solving fundamental graph problems like connected
...
...