In Search of the Fastest Concurrent Union-Find Algorithm

@inproceedings{Alistarh2019InSO,
  title={In Search of the Fastest Concurrent Union-Find Algorithm},
  author={Dan Alistarh and Alexander A. Fedorov and Nikita Koval},
  booktitle={OPODIS},
  year={2019}
}
  • Dan Alistarh, Alexander A. Fedorov, Nikita Koval
  • Published in OPODIS 2019
  • Computer Science, Mathematics
  • Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has been well-studied from both theoretical and practical perspectives in the sequential case. Recently, there has been mounting interest in analyzing this problem in the concurrent scenario, and several asymptotically-efficient algorithms have been proposed. Yet, to date, there is very little known about the practical performance of concurrent Union-Find. This work addresses this gap. We evaluate and… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 16 REFERENCES

    A Randomized Concurrent Algorithm for Disjoint Set Union

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Practical parallel Union-Find algorithms for transitive closure and clustering

    VIEW 1 EXCERPT

    Speculative lock elision: enabling highly concurrent multithreaded execution

    VIEW 1 EXCERPT

    Anderson and Heather Woll . Wait - free parallel algorithms for the union - find problem

    • J Richard
    • International Journal of Parallel Programming
    • 1988