Timothy L. Harris. A pragmatic implementation of non-blocking linked-lists. In Proceedings of the 15th International Conference on Distributed Computing, number 2180 in Lecture Notes in Computer Science, pages 300--314, Lisbon, Portugal, October 3--5, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Fast and Lock-Free Concurrent Priority Queues for.. - Sundell, Tsigas (2003) (2 citations) (Correct)
....this problem. One solution is to use the CAS2 operation as it can change two pointers atomically, but this operation is not available in any existing multiprocessor system. A second solution is to insert auxiliary nodes [19] between each two normal nodes, and the latest method introduced by Harris [4] is to use one bit of the pointer values as a deletion mark. On most modem 32 bit systems, 32 bit values can only be located at addresses that are evenly dividable by 4, therefore bits 0 and 1 of the address are always set to zero. The method is then to use the previously unused bit 0 of the next ....
T. L. HARRIS. A Pragmatic Implementation of NonBlocking Linked Lists. Proceedings' of the 15th International Symposium of Distributed Computing, Oct. 2001.
FutureGRID: A Program for long-term research into.. - Crowcroft, Hand.. (2003) Self-citation (Harris) (Correct)
No context found.
Timothy L. Harris. A pragmatic implementation of non-blocking linked lists. In Distributed Computing, 15th International Conference, volume 2180 of Lecture Notes in Computer Science, pages 300--314. SpringerVerlag, October 2001.
A Practical Multi-Word Compare-and-Swap Operation - Harris, Fraser, Pratt (2002) (6 citations) Self-citation (Harris) (Correct)
....identify pointers to the descriptors used by RDCSS and CASN. If run time type information is available then this could be exploited without further storage cost. Otherwise, the pointers themselves can be made distinct by non zero low order bits (as we did in previous work to indicate deleted items [6]) We need two bits to distinguish ordinary pointers, references to RDCSS descriptors and references to CASN descriptors. We favour this second scheme because it is widely applicable and it avoids an additional memory access to obtain type information. An attractive hybrid scheme, which we have ....
T. L. Harris. A pragmatic implementation of non-blocking linked lists. In Proc. 15th DISC, LNCS 2180, pp 300-314, Oct. 2001.
A Practical Multi-Word Compare-and-Swap Operation - Harris, Fraser, Pratt (2002) (6 citations) Self-citation (Harris) (Correct)
....the descriptors used by RDCSS and CASN. If run time type information is available then this could be exploited without any further storage cost. If this is not possible then the pointers themselves can be made distinct by nonzero low order bits (as we did in previous work to indicate deleted items [7]) We reserve two bits to distinguish ordinary pointers, references to embedded RDCSS descriptors and references to CASN descriptors. We favour this second scheme because (i) it is applicable where type information is not available, such as within a VM implementation or with a C or C program; ....
Timothy L. Harris. A pragmatic implementation of non-blocking linked lists. In Distributed Computing, 15th International Conference, volume 2180 of Lecture Notes in Computer Science, pages 300--314. Springer-Verlag, October 2001.
Landing OpenMP on Cyclops-64: An Efficient Mapping of OpenMP .. - Cuvillo, Zhu, Gao (2006) (Correct)
No context found.
Timothy L. Harris. A pragmatic implementation of non-blocking linked-lists. In Proceedings of the 15th International Conference on Distributed Computing, number 2180 in Lecture Notes in Computer Science, pages 300--314, Lisbon, Portugal, October 3--5, 2001.
A Lazy Concurrent List-Based Set Algorithm - Heller, Herlihy, Luchangco.. (2005) (Correct)
No context found.
T. Harris. A pragmatic implementation of non-blocking linked-lists. Lecture Notes in Computer Science, 2180:300--314, 2001.
Allocating Memory in a Lock-Free Manner - Gidenstam, Papatriantafilou.. (2004) (Correct)
No context found.
Timothy L Harris. A pragmatic implementation of non-blocking linked lists. In Distributed Computing, 15th International Conference, volume 2180 of Lecture Notes in Computer Science, pages 300-314. SpringerVerlag, October 2001.
Allocating Memory in a Lock-Free Manner - Gidenstam, Papatriantafilou.. (2004) (Correct)
No context found.
Timothy L Harris. A pragmatic implementation of non-blocking linked lists. In Distributed Computing, 15th International Conference, volume 2180 of Lecture Notes in Computer Science, pages 300-314. SpringerVerlag, October 2001.
An Almost Non-Blocking Stack - Boehm (2004) (Correct)
No context found.
T. L. Harris. A pragmatic implementation of non-blocking linked-lists. Lecture Notes in Computer Science, 2180:300--314, 2001.
Scalable and Lock-Free Concurrent Dictionaries - Sundell, Tsigas (2004) (Correct)
No context found.
T. L. Harris, A pragmatic implementation of nonblocking linked lists, in Proceedings of the 15th International Symposium of Distributed Computing, Oct. 2001.
Lock-Free and Practical Deques using Single-Word.. - Sundell, Tsigas (2004) (Correct)
No context found.
T. L. Harris, A pragmatic implementation of nonblocking linked lists, in Proceedings of the 15th International Symposium of Distributed Computing, Oct. 2001.
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