Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Kallimanis, Nikolaos D."'
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
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
Publikováno v:
Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming.
The availability of Non-Volatile Main Memory (known as NVMM) enables the design of recoverable concurrent algorithms. We study the power of software combining in achieving recoverable synchronization and designing persistent data structures. Software
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b8d886819ada3b3137a916d452fdf42
https://doi.org/10.1145/3503221.3508426
https://doi.org/10.1145/3503221.3508426