Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Kallimanis, Nikolaos"'
In the quest for accurate and interpretable AI models, eXplainable AI (XAI) has become crucial. Fuzzy Cognitive Maps (FCMs) stand out as an advanced XAI method because of their ability to synergistically combine and exploit both expert knowledge and
Externí odkaz:
http://arxiv.org/abs/2405.09190
Autor:
Fatourou, Panagiota, Kallimanis, Nikolaos D., Kanellou, Eleni, Makridakis, Odysseas, Symeonidou, Christi
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 the goal of contributing towards what might become, in the future, the
Externí odkaz:
http://arxiv.org/abs/2404.05515
Autor:
Ploumidis, Manolis, Chaix, Fabien, Chrysos, Nikolaos, Assiminakis, Marios, Flouris, Vassilis, Kallimanis, Nikolaos, Kossifidis, Nikolaos, Nikoloudakis, Michael, Petrakis, Polydoros, Dimou, Nikolaos, Gianioudis, Michael, Ieronymakis, George, Ioannou, Aggelos, Kalokerinos, George, Xirouchakis, Pantelis, Ailamakis, George, Damianakis, Astrinos, Ligerakis, Michael, Makris, Ioannis, Vavouris, Theocharis, Katevenis, Manolis, Papaefstathiou, Vassilis, Marazakis, Manolis, Mavroidis, Iakovos
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 interconnection 10-Gbps hardware. We developed this testbed in 2016-2019 to vali
Externí odkaz:
http://arxiv.org/abs/2307.09371
Publikováno v:
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (2018) 111-120
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 parallelism of concurrent hashing, while providing wait-free resizing. An e
Externí odkaz:
http://arxiv.org/abs/2204.09624
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, and built upon it to get PBcomb, a persistent version of it that perfor
Externí odkaz:
http://arxiv.org/abs/2107.03492
Autor:
Kallimanis, Nikolaos D.
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 designing efficient concurrent data structures (e.g. stacks, queues, has
Externí odkaz:
http://arxiv.org/abs/2103.16182
In this work, we propose the $\lambda$-scanner snapshot, a variation of the snapshot object, which supports any fixed amount of $0 < \lambda \leq n$ different $SCAN$ operations being active at any given time. Whenever $\lambda$ is equal to the number
Externí odkaz:
http://arxiv.org/abs/2006.06048
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 is the number of processes, k is the interval contention (i.e., the m
Externí odkaz:
http://arxiv.org/abs/2001.03457
Autor:
Fatourou, Panagiota1,2 (AUTHOR) faturu@csd.uoc.gr, Kallimanis, Nikolaos D.1 (AUTHOR)
Publikováno v:
Distributed Computing. Dec2020, Vol. 33 Issue 6, p485-513. 29p.
Autor:
Saloustros, Giorgos, Kallimanis, Nikolaos D., Chrysos, Nikolaos, Espié Caullet, Jonathan, Goudeau, Sylvain, Pichon , Grégoire
In the RED-SEA project, we study new interconnect technologies built around BXI. Designing new solutions for RDMA interconnects, it is important to know the performance levels of existing solutions. Beside raw performance numbers, it is important to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d14f8c523eb3d6d423cfb67cd6adb217