CSC/ECE 506 Spring 2011/ch5 LL
From Expertiza_Wiki
Revision as of 15:56, 27 February 2011 by
Briyenga
(
talk
|
contribs
)
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to navigation
Jump to search
Contents
1
Supplement to Chapter 5: The Data Parallel Programming Model
1.1
Introduction
2
Non blocking algorithms
2.1
Motivation
2.2
categories
2.3
building blocks
3
Lock-free linked list implementation
3.1
Pop-only case
3.2
Push-Pop case aka the ABA problem
3.3
Tag-based solution
3.4
DCAS based solutions
4
Memory model and barrier instructions
4.1
The X86 memory model
4.2
Barrier instructions
4.3
Linked list example of use of barrier instructions
5
Skip lists
6
References
7
Appendix
Supplement to Chapter 5: The Data Parallel Programming Model
Introduction
Non blocking algorithms
Motivation
categories
building blocks
Lock-free linked list implementation
Pop-only case
Push-Pop case aka the ABA problem
Tag-based solution
DCAS based solutions
Memory model and barrier instructions
The X86 memory model
Barrier instructions
Linked list example of use of barrier instructions
Skip lists
References
Appendix
Navigation menu
Personal tools
Log in
Namespaces
Page
Discussion
English
Views
Read
View source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information