资 源 简 介
Asymmetric flat-combining(AFC), is an extension of flat combining (FC) in which the behavior of producers and consumers differs. we use it to implement a linearizable FIFO queue.
Unlike an FC queue where all queue operations are blocking, in our AFC queue algorithm enqueue operations are wait-free; dequeue operations, on the other hand, are still blocking, as in the FC queue.
We conducted our performance evaluation on two platforms. Sun SPARC T5240 machine, comprising two UltraSPARC T2 plus (Niagara II) chips, running the Solaris operating system (cc compiler), and Intel i7-2760QM machine running Windows 7 (VC++ compiler).
Our experimental evaluation shows that the new queue algorithm outperforms the flat
combining queue and other state of the art queue implementations for most producer-consumer workloads while allowing producer threads to operate in a wait-free manner.
