tag:blogger.com,1999:blog-8231772264325864647.post1215747268100568979..comments2024-03-22T19:05:00.088+01:00Comments on Concurrency Freaks: Harris's Linked ListPedro Ramalhetehttp://www.blogger.com/profile/01340437958052998917noreply@blogger.comBlogger7125tag:blogger.com,1999:blog-8231772264325864647.post-35729884850582071562019-02-11T01:29:49.242+01:002019-02-11T01:29:49.242+01:00what about ConcurrentSkipListMap in java.util.conc...what about ConcurrentSkipListMap in java.util.concurrent?Anonymoushttps://www.blogger.com/profile/01588544237824676663noreply@blogger.comtag:blogger.com,1999:blog-8231772264325864647.post-35538527676873009342018-05-22T08:07:17.868+02:002018-05-22T08:07:17.868+02:00Thanks a lot!Thanks a lot!Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8231772264325864647.post-55832654893854280982018-05-22T08:06:18.011+02:002018-05-22T08:06:18.011+02:00This comment has been removed by the author.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8231772264325864647.post-2919720544993473752018-05-17T11:11:30.353+02:002018-05-17T11:11:30.353+02:00No, it's not possible. Notice that the marking...No, it's not possible. Notice that the marking of the center_node is on left_node.nextPedro Ramalhetehttps://www.blogger.com/profile/01340437958052998917noreply@blogger.comtag:blogger.com,1999:blog-8231772264325864647.post-46087557136561430862018-05-17T10:58:17.698+02:002018-05-17T10:58:17.698+02:00Thanks, I hv understood that. But my doubt is some...Thanks, I hv understood that. But my doubt is some where else. Here is my doubt: <br />/* 2: Check nodes are adjacent */<br />if (left_node_next == right_node)<br />If this is false, the execution will go to the line<br />/* 3: Remove one or more marked nodes */ <br />if (CAS (&(left_node.next), left_node_next, right_node)) /*C1*/<br /><br />Is it possible this CAS will be true for non-marked nodes?<br />Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8231772264325864647.post-87718184065646489332018-05-16T14:59:29.629+02:002018-05-16T14:59:29.629+02:00Hi Sri,
The find() method is lock-free but not wai...Hi Sri,<br />The find() method is lock-free but not wait-free. If half-way through the traversal it finds a marked node, it needs to help its unlinking and possibly restart from the beginning.<br />All methods in the Harris lock-free linked list are (at best) lock-free.Pedro Ramalhetehttps://www.blogger.com/profile/01340437958052998917noreply@blogger.comtag:blogger.com,1999:blog-8231772264325864647.post-81977937290703918472018-05-16T14:14:54.339+02:002018-05-16T14:14:54.339+02:00In the Tim Harris paper,the find() method is lock-...In the Tim Harris paper,the find() method is lock-free or wait-free? Anonymousnoreply@blogger.com