J. D. Valois, Lock-free data structures, Ph.D. dissertation, Rensselaer Polytechnic Institute, Troy, New York, 1995. A The algorithm for dynamic maximum sizes This section shows the the full details of how to extend the algorithm for dynamic maximum sizes, following the guidelines earlier presented in Section 3.4. As the link structure now can contain full pointer values, see  Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Lock-Free and Practical Deques using Single-Word.. - Sundell, Tsigas (2004) (Correct)
No context found.
J. D. Valois, Lock-free data structures, Ph.D. dissertation, Rensselaer Polytechnic Institute, Troy, New York, 1995. A The algorithm for dynamic maximum sizes This section shows the the full details of how to extend the algorithm for dynamic maximum sizes, following the guidelines earlier presented in Section 3.4. As the link structure now can contain full pointer values, see
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC