11 citations · 37 across the 21 of their papers we have counts for
6 papers · 1 filter
How to Relax Instantly: Elastic Relaxation of Concurrent Data Structures
Kåre von Geijer, Philippas Tsigas
The sequential semantics of many concurrent data structures, such as stacks and queues, inevitably lead to memory contention in parallel environments, thus limiting scalability. Se…
Relaxing Concurrent Data-structure Semantics for Increasing Performance: A Multi-structure 2D Design Framework
Adones Rukundo, Aras Atalar, Philippas Tsigas
There has been a significant amount of work in the literature proposing semantic relaxation of concurrent data structures for improving scalability and performance. By relaxing the…
Lock-Free Search Data Structures: Throughput Modelling with Poisson Processes
Aras Atalar, Paul Renaud-Goud, Philippas Tsigas
This paper considers the modelling and the analysis of the performance of lock-free concurrent search data structures. Our analysis considers such lock-free data structures that ar…
Efficient data streaming multiway aggregation through concurrent algorithmic designs and new abstract data types
Vincenzo Gulisano, Yiannis Nikolakopoulos, Daniel Cederman +2
Data streaming relies on continuous queries to process unbounded streams of data in a real-time fashion. It is commonly demanding in computation capacity, given that the relevant a…
Analyzing the Performance of Lock-Free Data Structures: A Conflict-based Model
Aras Atalar, Paul Renaud-Goud, Philippas Tsigas
This paper considers the modeling and the analysis of the performance of lock-free concurrent data structures. Lock-free designs employ an optimistic conflict control mechanism, al…
The Lock-free -LSM Relaxed Priority Queue
Martin Wimmer, Jakob Gruber, Jesper Larsson Träff +1
Priority queues are data structures which store keys in an ordered fashion to allow efficient access to the minimal (maximal) key. Priority queues are essential for many applicatio…