3 citations · 3 across the 3 of their papers we have counts for
4 papers
A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
Jesper Larsson Träff, Manuel Pöter
The lock-free, ordered, linked list is an important, standard example of a concurrent data structure. An obvious, practical drawback of textbook implementations is that failed comp…
Memory Models for C/C++ Programmers
Manuel Pöter, Jesper Larsson Träff
The memory model is the crux of the concurrency semantics of shared-memory systems. It defines the possible values that a read operation is allowed to return for any given set of w…
A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it)
Manuel Pöter, Jesper Larsson Träff
Memory management is a critical component in almost all shared-memory, concurrent data structures and algorithms, consisting in the efficient allocation and the subsequent reclamat…
Pheet meets C++11
Manuel Pöter
Pheet is a C++ task-scheduling framework that allows for easy customization of internal data-structures. The implementation was started before the C++11 standard was committed and…