main
|
Last change
on this file was ea777aa, checked in by Alex Wilton <awilton@…>, 3 years ago |
|
Moved examples, include, build_default.properties, common.xml, and README out from dev.civl.com into the root of the repo.
git-svn-id: svn://vsl.cis.udel.edu/civl/trunk@5704 fb995dde-84ed-4084-dfe6-e5aef3e2452c
|
-
Property mode
set to
100644
|
|
File size:
901 bytes
|
| Line | |
|---|
| 1 | Two classic queue algorithm:
|
|---|
| 2 |
|
|---|
| 3 | Two_lock Concurrent Queue: a "Two-Lock Concurrent Queue Algorithm", from Michael and Scott,
|
|---|
| 4 | https://www.cs.rochester.edu/research/synchronization/pseudocode/queues.html.
|
|---|
| 5 | Originally from "Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms", PODC96.
|
|---|
| 6 |
|
|---|
| 7 | Non-Blocking Concurrent Queue Algorithm from Michael and Scott
|
|---|
| 8 | https://www.cs.rochester.edu/research/synchronization/pseudocode/queues.html.
|
|---|
| 9 | Originally from "Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms", PODC96.
|
|---|
| 10 | The free in the algorithm (setFree method in Dequeue in this code) is meant to represent a function putting the node back on to a locally-maintained special-use free list and not the partner to malloc.
|
|---|
| 11 | http://blog.shealevy.com/2015/04/23/use-after-free-bug-in-maged-m-michael-and-michael-l-scotts-non-blocking-concurrent-queue-algorithm/#up1 |
|---|
Note:
See
TracBrowser
for help on using the repository browser.
