In a thread-safe concurrent queue, consumers typically wait for producers to make data available. In a synchronous queue, producers similarly wait for consumers to take the data. We present two new nonblocking, contention-free synchronous queues that achieve high performance through a form of dualism: The underlying data structure may hold both data and, symmetrically, requests.
advertisement
Home → Magazine Archive → May 2009 (Vol. 52, No. 5) → Scalable Synchronous Queues → Abstract
Scalable Synchronous Queues
0 Comments
No entries found
Log in to Read the Full Article
Purchase the Article