Concurrent disjoint set union
Abstract We develop and analyze concurrent algorithms for the disjoint set union (“union-find” ) problem in the shared memory, asynchronous multiprocessor model of computation, with CAS (compare and swap) or DCAS (double compare and swap) as the synchronization primitive. We give a dete...
| Main Authors: | , |
|---|---|
| Drugi avtorji: | |
| Format: | Article |
| Jezik: | English |
| Izdano: |
Springer Berlin Heidelberg
2021
|
| Online dostop: | https://hdl.handle.net/1721.1/136786 |