Browse Prior Art Database

Fast Algorithm for Queue, Circular Buffer and Stack Operations that minimises Lock Contention in Multi-threaded Applications. Disclosure Number: IPCOM000019620D
Original Publication Date: 2003-Sep-23
Included in the Prior Art Database: 2003-Sep-23

Publishing Venue



This article describes an existing algorithm (fast Queue) and extends it to apply to Circular Buffers and Stacks. It has benefits to multithreaded applications by reducing lock-contention compared to the obvious "get-Mutex; add/remove from Queue/Buffer/Stack; release-Mutex" approach.