Designing Scalable b-MATCHING Algorithms on Distributed Memory Multiprocessors by Approximation

@article{Khan2016DesigningSB,
  title={Designing Scalable b-MATCHING Algorithms on Distributed Memory Multiprocessors by Approximation},
  author={Arif Ul Maula Khan and Alex Pothen and Md. Mostofa Ali Patwary and Mahantesh Halappanavar and Nadathur Satish and Narayanan Sundaram and Pradeep Dubey},
  journal={SC16: International Conference for High Performance Computing, Networking, Storage and Analysis},
  year={2016},
  pages={773-783}
}
A b-MATCHING is a subset of edges M such that at most b(v) edges in M are incident on each vertex v, where b(v) is specified. We present a distributed-memory parallel algorithm, b-SUITOR, that computes a b-MATCHING with more than half the maximum weight in a graph with weights on the edges. The approximation algorithm is designed to have high concurrency and low time complexity. We organize the implementation of the algorithm in terms of asynchronous supersteps that combine computation and… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-4 of 4 extracted citations

Scalable b-Matching on GPUs

2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) • 2018
View 10 Excerpts
Highly Influenced

Parallel Algorithms Through Approximation: B-Edge Cover

2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) • 2018
View 3 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 39 references

Similar Papers

Loading similar papers…