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 determi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer Berlin Heidelberg,
2021-11-01T14:33:22Z.
|
| Subjects: | |
| Online Access: | Get fulltext |