Manuel Pöter

According to our database, Manuel Pöter authored at least 8 papers between 2013 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

A more pragmatic implementation of the lock-free, ordered, linked list.

Jesper Larsson Träff, Manuel Pöter

Proceedings of the PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

2018

Stamp-it: A more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model.

Manuel Pöter, Jesper Larsson Träff

CoRR, 2018

Memory Models for C/C++ Programmers.

Manuel Pöter, Jesper Larsson Träff

CoRR, 2018

Brief Announcement: Stamp-it, a more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model.

Manuel Pöter, Jesper Larsson Träff

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

<i>Stamp-it</i>, amortized constant-time memory reclamation in comparison to five other schemes.

Manuel Pöter, Jesper Larsson Träff

Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

2017

A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it).

Manuel Pöter, Jesper Larsson Träff

CoRR, 2017

2014

Pheet meets C++11.

Manuel Pöter

CoRR, 2014

2013

The Pheet Task-Scheduling Framework on the Intel® Xeon Phi Coprocessor and other Multicore Architectures.

Martin Wimmer, Manuel Pöter, Jesper Larsson Träff

Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013