Jiffy: A Lock-free Skip List with Batch Updates and Snapshots (Abstract)
[ 1 ] Instytut Informatyki, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ P ] pracownik
2024
abstrakt
angielski
EN Concurrent programming is notoriously difficult. Hence, to develop complex systems aimed for modern multicore hardware, such as database engines, programmers often rely on concurrent data structures. They can be safely accessed by many concurrent threads without additional synchronization. Under the hood, they feature sophisticated, often non-blocking, synchronization algorithms. With the proliferation of multicore hardware, many new concurrent data structures have been proposed, e.g., concurrent lists, sets, and (ordered) key-value indices (or maps, dictionaries). Each subsequent structure improves performance or introduces new features, e.g., consistent range scans (consecutive, ascending or descending, entries within a defined range) or snapshots (a read-only, static and consistent view of the entire dataset).
26.07.2024
5 - 7