CSC/ECE 506 Spring 2011/ch5 LL: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
=Supplement to Chapter 5: The Data Parallel Programming Model= | =Supplement to Chapter 5: The Data Parallel Programming Model= | ||
==Introduction== | ==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= | |||