Zobrazeno 1 - 10
of 124
pro vyhledávání: '"FATOUROU, PANAGIOTA"'
Autor:
Roh, Younghun, Wei, Yuanhao, Ruppert, Eric, Fatourou, Panagiota, Jayanti, Siddhartha, Shun, Julian
Many concurrent algorithms require processes to perform fetch-and-add operations on a single memory location, which can be a hot spot of contention. We present a novel algorithm called Aggregating Funnels that reduces this contention by spreading the
Externí odkaz:
http://arxiv.org/abs/2411.14420
Autor:
Fatourou, Panagiota, Ruppert, Eric
Augmenting an existing sequential data structure with extra information to support greater functionality is a widely used technique. For example, search trees are augmented to build sequential data structures like order-statistic trees, interval tree
Externí odkaz:
http://arxiv.org/abs/2405.10506
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
In this paper, we study the question whether techniques employed, in a conventional system, by state-of-the-art concurrent algorithms to avoid contended hot spots are still efficient for recoverable computing in settings with Non-Volatile Memory (NVM
Externí odkaz:
http://arxiv.org/abs/2402.17674
Autor:
Fatourou, Panagiota
This paper summarizes state-of-the-art results on data series processing with the emphasis on parallel and distributed data series indexes that exploit the computational power of modern computing platforms. The paper comprises a summary of the tutori
Externí odkaz:
http://arxiv.org/abs/2310.14101
We present FreSh, a lock-free data series index that exhibits good performance (while being robust). FreSh is based on Refresh, which is a generic approach we have developed for supporting lock-freedom in an efficient way on top of any localityaware
Externí odkaz:
http://arxiv.org/abs/2310.11602
This paper presents Odyssey, a novel distributed data-series processing framework that efficiently addresses the critical challenges of exhibiting good speedup and ensuring high scalability in data series processing by taking advantage of the full co
Externí odkaz:
http://arxiv.org/abs/2301.11049
Multiversioning is widely used in databases, transactional memory, and concurrent data structures. It can be used to support read-only transactions that appear atomic in the presence of concurrent update operations. Any system that maintains multiple
Externí odkaz:
http://arxiv.org/abs/2212.13557
Autor:
Echihabi, Karima, Fatourou, Panagiota, Zoumpatianos, Kostas, Palpanas, Themis, Benbrahim, Houda
Publikováno v:
Proc. VLDB Endow. 15(10): 2005-2018 (2022)
We propose Hercules, a parallel tree-based technique for exact similarity search on massive disk-based data series collections. We present novel index construction and query answering algorithms that leverage different summarization techniques, caref
Externí odkaz:
http://arxiv.org/abs/2212.13297
We study the ability of different shared object types to solve recoverable consensus using non-volatile shared memory in a system with crashes and recoveries. In particular, we compare the difficulty of solving recoverable consensus to the difficulty
Externí odkaz:
http://arxiv.org/abs/2205.14213