Optimizing Concurrent Data Structures in Rust

Lock- Free data structures are a key approach in concurrent programming that allows for thread-safe data manipulation without the need for traditional locking methods. They can diminish the overhead of context switching and lock contention in multi-threaded scenarios, which in turn boosts program pe...

Full description

Saved in:
Bibliographic Details
Published in2025 5th International Conference on Consumer Electronics and Computer Engineering (ICCECE) pp. 854 - 858
Main Author Zhao, Xin
Format Conference Proceeding
LanguageEnglish
Published IEEE 28.02.2025
Subjects
Commutation
Commutativity
Concurrent computing
Concurrent data structure
Costs
Data structures
Instruction sets
Lock-free
Memory management
Parallel processing
Programming
Safety
Switches
Online AccessGet full text
DOI10.1109/ICCECE65250.2025.10984876

Cover

More Information
Summary:Lock- Free data structures are a key approach in concurrent programming that allows for thread-safe data manipulation without the need for traditional locking methods. They can diminish the overhead of context switching and lock contention in multi-threaded scenarios, which in turn boosts program performance. This paper investigates the efficient construction of lock-free concurrent data structures, harnessing Rust's type system and the commutativity of operations to attain a considerable performance enhancement compared to traditional atomic data types.
DOI:10.1109/ICCECE65250.2025.10984876