Fast Concurrent Queues for x Processors Adam Morrison Yehuda Afek Blavatnik School of Computer Science Tel Aviv University Abstract Conventional wisdom in designing concurrent data structures is to u

In building concurrent FIFO queues this reasoning has led re searchers to propose combiningbased concurrent queues This paper takes a different approach showing how to rely on fetchandadd FA a less powerful primitive that is available on x86 process

Embed this Presentation

Download Notice

Download Presentation The PPT/PDF document "Fast Concurrent Queues for x Processors ..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.