PDF-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
Download Presentation
"Fast Concurrent Queues for x Processors Adam Morrison Yehuda " is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.