Efficient Parallel and External Matching
Karlsruhe Institute of Technology, Karlsruhe, Germany
arXiv:1302.4587 [cs.DS], (19 Feb 2013)
@article{2013arXiv1302.4587B,
author={Birn}, M. and {Osipov}, V. and {Sanders}, P. and {Schulz}, C. and {Sitchinava}, N.},
title={"{Efficient Parallel and External Matching}"},
journal={ArXiv e-prints},
archivePrefix={"arXiv"},
eprint={1302.4587},
primaryClass={"cs.DS"},
keywords={Computer Science – Data Structures and Algorithms, Computer Science – Distributed, Parallel, and Cluster Computing},
year={2013},
month={feb},
adsurl={http://adsabs.harvard.edu/abs/2013arXiv1302.4587B},
adsnote={Provided by the SAO/NASA Astrophysics Data System}
}
We show that a simple algorithm for computing a matching on a graph runs in a logarithmic number of phases incurring work linear in the input size. The algorithm can be adapted to provide efficient algorithms in several models of computation, such as PRAM, External Memory, MapReduce and distributed memory models. Our CREW PRAM algorithm is the first O(log^2 n) time, linear work algorithm. Our experimental results indicate the algorithm’s high speed and efficiency combined with good solution quality.
February 23, 2013 by hgpu
