Algorithms
for concurrent data structure have gained attention in recent years as
multi-core processors have become ubiquitous. Several features of shared-memory
multiprocessors make concurrent data structures significantly more difficult to
design and to verify as correct than their sequential counterparts. The primary
source of this additional difficulty is concurrency. This paper provides an
overview of the some concurrent access algorithms for different data
structures.
Copyright © 2025 IJRTS Publications. All Rights Reserved | Developed By iNet Business Hub
