StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
502696
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
2
CommunityOwnedDate
CreationDate
2009-02-02T09:43:43.553
FavoriteCount
0
LastActivityDate
2013-06-05T06:50:09.563
LastEditDate
2013-06-05T06:50:09.563
LastEditorUserId
70386
OwnerUserId
5542
ParentId
475776
PostTypeId
2
Score
5
ViewCount
0
LastEditorDisplayName
text
Body
The problem is your algorithm: Consider this sequence of events: Thread 1 calls <code>list.Add(workItem1)</code>, which completes fully. Status is: <pre><code>first=workItem1, workItem1.next = null </code></pre> Then thread 1 calls <code>list.Add(workItem2)</code> and reaches the spot right before the second <code>Replace</code> (where you have the comment "//lets try"). Status is: <pre><code>first=workItem1, workItem1.next = null, nextItem=workItem1 </code></pre> At this point thread 2 takes over and calls <code>list.Get()</code>. Assume <code>workItem1</code>'s executionTime is now, so the call succeeds and returns <code>workItem1</code>. After this status is: <pre><code>first = null, workItem1.next = null </code></pre> (and in the other thread, <code>nextItem</code> is still <code>workItem1</code>). Now we get back to the first thread, and it completes the <code>Add()</code> by setting <code>workItem1.next:=workItem2</code>. If we call <code>list.Get()</code> now, we will get <code>null</code>, even though the <code>Add()</code> completed successfully. You should probably look up a real peer-reviewed lock-free linked list algorithm. I think the standard one is <a href="ftp://ftp.cs.rpi.edu/pub/valoisj/podc95.ps.gz" rel="nofollow noreferrer">this</a> by John Valois. There is a C++ implementation <a href="http://www.cs.rpi.edu/~bushl2/portfolio/lockfree-grape/code/lockfreelist.h" rel="nofollow noreferrer">here</a>. <a href="http://www.cs.chalmers.se/~dcs/ConcurrentDataStructures/phd_chap5.pdf" rel="nofollow noreferrer">This</a> article on lock-free priority queues might also be of use.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POLockless list help!
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USjgauffin
UserOwnerUserId
1. USRasmus Faber
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POLockless list help!
 singulars
 PostTypePostTypeId
 PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
CommentsPostId
1. COTnx alot for your time and help!! ill look into all the links you posted!
 singulars
 PostPostId
 PO
 UserUserId
 USPeter
2. COValois' list doesn't perform very well - all those intermediate nodes. Harris' "delete bit" works better.
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.