Lock Bypassing: An Efficient Algorithm for Concurrently Accessing Priority Heaps

@article{Yan1998LockBA,
  title={Lock Bypassing: An Efficient Algorithm for Concurrently Accessing Priority Heaps},
  author={Yong Yan and Xiaodong Zhang},
  journal={ACM Journal of Experimental Algorithmics},
  year={1998},
  volume={3},
  pages={3}
}
The heap representation of priority queues is one of the most widely used data structures in the design of parallel algorithms. Efficiently exploiting the parallelism of a priority heap has significant influence on the efficiency of a wide range of applications and parallel algorithms. In this paper, we propose an aggressive priority heap operating algorithm, called the lock bypassing algorithm (LB) on shared memory systems. This algorithm minimizes interference of concurrent enqueue and… CONTINUE READING