[HN Gopher] Skip Hash: A fast ordered map via software transacti...
       ___________________________________________________________________
        
       Skip Hash: A fast ordered map via software transactional memory
        
       Author : mfiguiere
       Score  : 50 points
       Date   : 2024-10-11 19:46 UTC (4 days ago)
        
 (HTM) web link (arxiv.org)
 (TXT) w3m dump (arxiv.org)
        
       | dinobones wrote:
       | I love that new, performant data structures are still being found
       | in CS.
       | 
       | It's easy to forget that it's still such a new and early field.
       | The modern version of CS started in what... the 50s, earliest?
       | There are many people alive today who are older than the study of
       | CS itself.
        
       | mncharity wrote:
       | Vitaly Aksenov (an author) gave a Google Tech Talk in July: _Is
       | it possible to make self-adjusting data structures concurrent?_
       | [1].
       | 
       | I didn't find paper-associated code. Fwiw, there's an earlier
       | 2020 Aksenov splay-list paper with a repo.[2]
       | 
       | Authors' 2024 _The Next 700 Benchmarking Frameworks for
       | Concurrent Data Structures_ is inaccessible (ACM paywall), but
       | 2023 _Brief Announcement: BatchBoost: Universal Batching for
       | Concurrent Data Structures_ [3] looks cute. Aksenov has a home
       | page[4] with pre-2024 pdfs. I didn't see homes for the other
       | authors.
       | 
       | [1] https://www.youtube.com/watch?v=A7DaSVMm0To [2] paper:
       | https://arxiv.org/pdf/2008.01009 unexplored archival repo:
       | https://cutt.ly/disc2020353 possibly related:
       | https://github.com/Aksenov239/splaylist/tree/master/structs_...
       | [3]
       | https://openaccess.city.ac.uk/id/eprint/31793/1/LIPIcs.DISC....
       | [4] https://ctlab.itmo.ru/~vaksenov/
        
       ___________________________________________________________________
       (page generated 2024-10-15 23:01 UTC)