By Topic

A lock-free algorithm for union-find with deletion

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hui Gao ; Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Yan Fu ; Jia-Ping Li

The classical union-find algorithm is the basis for many graph algorithms and for dealing with equality. The easiest way to implement concurrent objects is by means of classical software solutions, but this leads to blocking when the process that holds exclusive access to the object is delayed or stops functioning. Thus we require our solutions to the data structure problem have the lock-free property. In this paper, we present an efficient lock-free algorithm for union-find with deletion, which promises more robust performance and reliability than conventional lock-based implementations.

Published in:

Apperceiving Computing and Intelligence Analysis, 2009. ICACIA 2009. International Conference on

Date of Conference:

23-25 Oct. 2009