16 citations · 57 across the 26 of their papers we have counts for
Showing 2020 · cs.DSShow all
2 papers · 2 filters
cs.DS2020
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…
cs.DS2020
High-Quality Hierarchical Process Mapping
Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke +2
Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation when processing graphs on a parallel computer. When a…