FreSh: A Lock-Free Data Series Index

被引:2
|
作者
Fatourou, Panagiota [1 ,2 ]
Kosmas, Eleftherios [3 ]
Palpanas, Themis [4 ,5 ]
Paterakis, George [1 ,2 ]
机构
[1] ICS FORTH, Iraklion, Greece
[2] Univ Crete, Iraklion, Greece
[3] Hellen Mediterranean Univ, Khania, Greece
[4] Univ Paris Cite, LIPADE, Paris, France
[5] French Univ Inst IUF, Paris, France
关键词
SIMILARITY SEARCH; LERNAEAN HYDRA;
D O I
10.1109/SRDS60354.2023.00029
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 data series index. We believe Refresh is of independent interest and can be used to get well-performed lock-free versions of other locality-aware blocking data structures. For developing FreSh, we first studied in depth the design decisions of current state-of-the-art data series indexes, and the principles governing their performance. This led to a theoretical framework, which enables the development and analysis of data series indexes in a modular way. The framework allowed us to apply Refresh, repeatedly, to get lock-free versions of the different phases of a family of data series indexes. Experiments with several synthetic and real datasets illustrate that FreSh achieves performance that is as good as that of the state-of-the-art blocking in-memory data series index. This shows that the helping mechanisms of FreSh are light-weight, respecting certain principles that are crucial for performance in locality-aware data structures.
引用
收藏
页码:209 / 220
页数:12
相关论文
共 50 条
  • [1] Lock-Free Data-Structure Iterators
    Petrank, Erez
    Timnat, Shahar
    DISTRIBUTED COMPUTING, 2013, 8205 : 224 - 238
  • [2] Detectable Recovery of Lock-Free Data Structures
    Attiya, Hagit
    Ben-Baruch, Ohad
    Fatourou, Panagiota
    Hendler, Danny
    Kosmas, Eleftherios
    PPOPP'22: PROCEEDINGS OF THE 27TH ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING, 2022, : 262 - 277
  • [3] Lock-free queues
    Marginean, Petru
    DR DOBBS JOURNAL, 2008, 33 (07): : 43 - 47
  • [4] POSTER: LOFT: Lock-Free Transactional Data Structures
    Elizarov, Avner
    Golan-Gueta, Guy
    Petrank, Erez
    PROCEEDINGS OF THE 24TH SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING (PPOPP '19), 2019, : 425 - 426
  • [5] Expander: Lock-free Cache for a Concurrent Data Structure
    Aggarwal, Pooja
    Sarangi, Smruti R.
    2017 IEEE 24TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING (HIPC), 2017, : 162 - 171
  • [6] Kanva: A Lock-free Learned Search Data Structure
    Bhardwaj, Gaurav
    Chatterjee, Bapi
    Sharma, Abhinav
    Perit, Sathya
    Nayak, Siddharth
    53RD INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, ICPP 2024, 2024, : 252 - 261
  • [7] Mirror: Making Lock-Free Data Structures Persistent
    Friedman, Michal
    Petrank, Erez
    Ramalhete, Pedro
    PROCEEDINGS OF THE 42ND ACM SIGPLAN INTERNATIONAL CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '21), 2021, : 1218 - 1232
  • [8] Supporting Lock-Free Composition of Concurrent Data Objects
    Cederman, Daniel
    Tsigas, Philippas
    ACM SIGPLAN NOTICES, 2010, 45 (05) : 339 - 340
  • [9] Supporting Lock-Free Composition of Concurrent Data Objects
    Cederman, Daniel
    Tsigas, Philippas
    PROCEEDINGS OF THE 2010 COMPUTING FRONTIERS CONFERENCE (CF 2010), 2010, : 53 - 62
  • [10] Automatic Memory Reclamation for Lock-Free Data Structures
    Cohen, Nachshon
    Petrank, Erez
    ACM SIGPLAN NOTICES, 2015, 50 (10) : 260 - 279