26 citations · 59 across the 23 of their papers we have counts for
27 papers
Concurrent Balanced Augmented Trees
Evan Wrench, Ajay Singh, Younghun Roh +4
Augmentation makes search trees tremendously more versatile, allowing them to support efficient aggregation queries, order-statistic queries, and range queries in addition to inser…
Sharded Elimination and Combining for Highly-Efficient Concurrent Stacks
Ajay Singh, Nikos Metaxakis, Panagiota Fatourou
We present a new blocking linearizable stack implementation which utilizes sharding and fetch&increment to achieve significantly better performance than all existing concurrent sta…
Recoverable Lock-Free Locks
Hagit Attiya, Panagiota Fatourou, Eleftherios Kosmas +1
This paper presents the first transformation that introduces both lock-freedom and recoverability. Our transformation starts with a lock-based implementation, and provides a recove…
PIPQ: Strict Insert-Optimized Concurrent Priority Queue
Olivia Grimes, Ahmed Hassan, Panagiota Fatourou +1
This paper presents PIPQ, a strict and linearizable concurrent priority queue whose design differs from existing solutions in literature because it focuses on enabling parallelism…
Concurrent Double-Ended Priority Queues
Panagiota Fatourou, Eric Ruppert, Ioannis Xiradakis
This work provides the first concurrent implementation specifically designed for a double-ended priority queue (DEPQ). We do this by describing a general way to add an ExtractMax o…
Aggregating Funnels for Faster Fetch&Add and Queues
Younghun Roh, Yuanhao Wei, Eric Ruppert +3
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 ca…
Lock-Free Augmented Trees
Panagiota Fatourou, Eric Ruppert
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 buil…
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…
Highly-Efficient Persistent FIFO Queues
Panagiota Fatourou, Nikos Giachoudis, George Mallis
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 efficie…
Parallel and Distributed Data Series Processing on Modern and Emerging Hardware
Panagiota Fatourou
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 m…
FreSh: A Lock-Free Data Series Index
Panagiota Fatourou, Eleftherios Kosmas, Themis Palpanas +1
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 su…
Odyssey: A Journey in the Land of Distributed Data Series Similarity Search
Manos Chatzakis, Panagiota Fatourou, Eleftherios Kosmas +2
This paper presents Odyssey, a novel distributed data-series processing framework that efficiently addresses the critical challenges of exhibiting good speedup and ensuring high sc…
Practically and Theoretically Efficient Garbage Collection for Multiversioning
Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou +1
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 presen…
Hercules Against Data Series Similarity Search
Karima Echihabi, Panagiota Fatourou, Kostas Zoumpatianos +2
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 answer…
When Is Recoverable Consensus Harder Than Consensus?
Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier +1
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 com…
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…
Fast Data Series Indexing for In-Memory Data
Botao Peng, Panagiota Fatourou, Themis Palpanas
Data series similarity search is a core operation for several data series analysis applications across many different domains. However, the state-of-the-art techniques fail to deli…
Space and Time Bounded Multiversion Garbage Collection
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou +3
We present a general technique for garbage collecting old versions for multiversion concurrency control that simultaneously achieves good time and space complexity. Our technique t…
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…
MESSI: In-Memory Data Series Indexing
Botao Peng, Panagiota Fatourou, Themis Palpanas
Data series similarity search is a core operation for several data series analysis applications across many different domains. However, the state-of-the-art techniques fail to deli…
ParIS+: Data Series Indexing on Multi-Core Architectures
Botao Peng, Panagiota Fatourou, Themis Palpanas
Data series similarity search is a core operation for several data series analysis applications across many different domains. Nevertheless, even state-of-the-art techniques cannot…
Constant-Time Snapshots with Applications to Concurrent Data Structures
Yuanhao Wei, Naama Ben-David, Guy E. Blelloch +3
We present an approach for efficiently taking snapshots of the state of a collection of CAS objects. Taking a snapshot allows later operations to read the value that each CAS objec…
VAT: Asymptotic Cost Analysis for Multi-Level Key-Value Stores
Nikos Batsaras, Giorgos Saloustros, Anastasios Papagiannis +2
Over the past years, there has been an increasing number of key-value (KV) store designs, each optimizing for a different set of requirements. Furthermore, with the advancements of…
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…