Almost non-blocking linked stack implementation
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Nov 11, 2008
Grant Date -
Jan 5, 2006
app pub date -
Jun 30, 2004
filing date -
Jun 30, 2004
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
A method and computer system for implementing, in a multithreaded environment, an almost non-blocking linked list allow a lock-free access provided that certain conditions are met. The approach involves: associating a pointer and an auxiliary data structure with each linked list, using a compare-and-swap (CAS) operation, and making a slight modification of values associated with nodes under certain conditions. The CAS operation guards against setting the pointers incorrectly during insertion and removal operations. The auxiliary data structure, also referred to as the `black list,` holds a dynamic list of values, typically pointer values, associated with nodes that are in the process of being removed by a thread.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully