16 citations · 24 across the 7 of their papers we have counts for
7 papers · 1 filter
Efficient Distributed Data Structures for Future Many-core Architectures
Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou +2
We study general techniques for implementing distributed data structures on top of future many-core architectures with non cache-coherent or partially cache-coherent memory. With t…
The ExaNeSt Prototype: Evaluation of Efficient HPC Communication Hardware in an ARM-based Multi-FPGA Rack
Manolis Ploumidis, Fabien Chaix, Nikolaos Chrysos +21
We present and evaluate the ExaNeSt Prototype, a liquid-cooled rack prototype consisting of 256 Xilinx ZU9EG MPSoCs, 4 TBytes of DRAM, 16 TBytes of SSD, and configurable interconne…
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…
Persistent Software Combining
Panagiota Fatourou, Nikolaos D. Kallimanis, Eleftherios Kosmas
We study the performance power of software combining in designing persistent algorithms and data structures. We present Bcomb, a new blocking highly-efficient combining protocol, a…
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…