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...
| Үндсэн зохиолчид: | , |
|---|---|
| Бусад зохиолчид: | |
| Формат: | Өгүүллэг |
| Хэл сонгох: | English |
| Хэвлэсэн: |
Springer Berlin Heidelberg
2021
|
| Онлайн хандалт: | https://hdl.handle.net/1721.1/136786 |