Skip to content

Implementation of a bounded wait-free union find concurrent data structure.

Notifications You must be signed in to change notification settings

AntonioL/wait-free-union-find

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

Wait-Free Union Find

This is a my own implementation of a bounded wait-free concurrent union-find data structure.

The implementation follows the paper [1].

It is implemented in Scala to avoid the verbosity of the Java programming language.

References

[1] Anderson, Richard J., and Heather Woll. "Wait-free parallel algorithms for the union-find problem." Proceedings of the twenty-third annual ACM symposium on Theory of computing. ACM, 1991.

About

Implementation of a bounded wait-free union find concurrent data structure.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages