FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3159302701> ?p ?o ?g. }

• W3159302701 endingPage "436" @default.
• W3159302701 startingPage "413" @default.
• W3159302701 abstract "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 deterministic bounded wait-free algorithm that uses DCAS and has a total work bound of $$Obiggl ( m cdot left( log {left( frac{np}{m} + 1 right) } + alpha {left( n, frac{m}{np} right) } right) biggr )$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mrow> <mml:mi>O</mml:mi> <mml:mrow> <mml:mo>(</mml:mo> </mml:mrow> <mml:mi>m</mml:mi> <mml:mo>·</mml:mo> <mml:mfenced> <mml:mo>log</mml:mo> <mml:mfenced> <mml:mfrac> <mml:mrow> <mml:mi>np</mml:mi> </mml:mrow> <mml:mi>m</mml:mi> </mml:mfrac> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mfenced> <mml:mo>+</mml:mo> <mml:mi>α</mml:mi> <mml:mfenced> <mml:mi>n</mml:mi> <mml:mo>,</mml:mo> <mml:mfrac> <mml:mi>m</mml:mi> <mml:mrow> <mml:mi>np</mml:mi> </mml:mrow> </mml:mfrac> </mml:mfenced> </mml:mfenced> <mml:mrow> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> for a problem with n elements and m operations solved by p processes, where $$alpha $$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mi>α</mml:mi> </mml:math> is a functional inverse of Ackermann’s function. We give two randomized algorithms that use only CAS and have the same work bound in expectation. The analysis of the second randomized algorithm is valid even if the scheduler is adversarial. Our DCAS and randomized algorithms take $$O(log n)$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mo>log</mml:mo> <mml:mi>n</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> steps per operation, worst-case for the DCAS algorithm, high-probability for the randomized algorithms. Our work and step bounds grow only logarithmically with p , making our algorithms truly scalable. We prove that for a class of symmetric algorithms that includes ours, no better step or work bound is possible. Our work is theoretical, but Alistarh et al (In search of the fastest concurrent union-find algorithm, 2019), Dhulipala et al (A framework for static and incremental parallel graph connectivity algorithms, 2020) and Hong et al (Exploring the design space of static and incremental graph connectivity algorithms on gpus, 2020) have implemented some of our algorithms on CPUs and GPUs and experimented with them. On many realistic data sets, our algorithms run as fast or faster than all others." @default.
• W3159302701 created "2021-05-10" @default.
• W3159302701 creator A5008303793 @default.
• W3159302701 creator A5051027549 @default.
• W3159302701 date "2021-04-23" @default.
• W3159302701 modified "2023-10-14" @default.
• W3159302701 title "Concurrent disjoint set union" @default.
• W3159302701 cites W138919290 @default.
• W3159302701 cites W1489273657 @default.
• W3159302701 cites W1540179969 @default.
• W3159302701 cites W1583357444 @default.
• W3159302701 cites W1598318328 @default.
• W3159302701 cites W1965680834 @default.
• W3159302701 cites W1969148345 @default.
• W3159302701 cites W1986022261 @default.
• W3159302701 cites W1998458999 @default.
• W3159302701 cites W1999812064 @default.
• W3159302701 cites W2001331197 @default.
• W3159302701 cites W2002240881 @default.
• W3159302701 cites W2004350101 @default.
• W3159302701 cites W2022132320 @default.
• W3159302701 cites W2044146725 @default.
• W3159302701 cites W2049105156 @default.
• W3159302701 cites W2053061798 @default.
• W3159302701 cites W2062297396 @default.
• W3159302701 cites W2067661972 @default.
• W3159302701 cites W2075410688 @default.
• W3159302701 cites W2085407655 @default.
• W3159302701 cites W2085467310 @default.
• W3159302701 cites W2091642429 @default.
• W3159302701 cites W2098873146 @default.
• W3159302701 cites W2100357382 @default.
• W3159302701 cites W2101939036 @default.
• W3159302701 cites W2114496697 @default.
• W3159302701 cites W2118382442 @default.
• W3159302701 cites W2151440203 @default.
• W3159302701 cites W2155803955 @default.
• W3159302701 cites W2280483494 @default.
• W3159302701 cites W2501233964 @default.
• W3159302701 cites W2962741105 @default.
• W3159302701 cites W3104493467 @default.
• W3159302701 cites W3132364392 @default.
• W3159302701 cites W4244083566 @default.
• W3159302701 doi "https://doi.org/10.1007/s00446-020-00388-x" @default.
• W3159302701 hasPublicationYear "2021" @default.
• W3159302701 type Work @default.
• W3159302701 sameAs 3159302701 @default.
• W3159302701 citedByCount "2" @default.
• W3159302701 countsByYear W31593027012022 @default.
• W3159302701 countsByYear W31593027012023 @default.
• W3159302701 crossrefType "journal-article" @default.
• W3159302701 hasAuthorship W3159302701A5008303793 @default.
• W3159302701 hasAuthorship W3159302701A5051027549 @default.
• W3159302701 hasBestOaLocation W31593027011 @default.
• W3159302701 hasConcept C11413529 @default.
• W3159302701 hasConcept C41008148 @default.
• W3159302701 hasConceptScore W3159302701C11413529 @default.
• W3159302701 hasConceptScore W3159302701C41008148 @default.
• W3159302701 hasFunder F4320308943 @default.
• W3159302701 hasFunder F4320309292 @default.
• W3159302701 hasIssue "6" @default.
• W3159302701 hasLocation W31593027011 @default.
• W3159302701 hasLocation W31593027012 @default.
• W3159302701 hasLocation W31593027013 @default.
• W3159302701 hasOpenAccess W3159302701 @default.
• W3159302701 hasPrimaryLocation W31593027011 @default.
• W3159302701 hasRelatedWork W2051487156 @default.
• W3159302701 hasRelatedWork W2073681303 @default.
• W3159302701 hasRelatedWork W2351491280 @default.
• W3159302701 hasRelatedWork W2371447506 @default.
• W3159302701 hasRelatedWork W2386767533 @default.
• W3159302701 hasRelatedWork W2390279801 @default.
• W3159302701 hasRelatedWork W2748952813 @default.
• W3159302701 hasRelatedWork W2899084033 @default.
• W3159302701 hasRelatedWork W303980170 @default.
• W3159302701 hasRelatedWork W3141679561 @default.
• W3159302701 hasVolume "34" @default.
• W3159302701 isParatext "false" @default.
• W3159302701 isRetracted "false" @default.
• W3159302701 magId "3159302701" @default.
• W3159302701 workType "article" @default.