16 citations · 17 across the 3 of their papers we have counts for
4 papers
An Efficient Wait-free Resizable Hash Table
Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars
This paper presents an efficient wait-free resizable hash table. To achieve high throughput at large core counts, our algorithm is specifically designed to retain the natural paral…
Synch: A framework for concurrent data-structures and benchmarks
Nikolaos D. Kallimanis
The recent advancements in multicore machines highlight the need to simplify concurrent programming in order to leverage their computational power. One way to achieve this is by de…
Efficient Partial Snapshot Implementations
Nikolaos D. Kallimanis, Eleni Kanellou, Charidimos Kiosterakis
In this work, we propose the -scanner snapshot, a variation of the snapshot object, which supports any fixed amount of different operations being active at…
An Efficient Universal Construction for Large Objects
Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou
This paper presents L-UC, a universal construction that efficiently implements dynamic objects of large state in a wait-free manner. The step complexity of L-UC is O(n+kw), where n…