Scalable synchronous queues Export

@article{citeulike:5645959, abstract = {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 .}, address = {New York, NY, USA}, author = {Scherer, William N. and Lea, Doug and Scott, Michael L.}, citeulike-article-id = {5645959}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1506409.1506431}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1506409.1506431}, doi = {10.1145/1506409.1506431}, issn = {0001-0782}, journal = {Commun. ACM}, keywords = {concurrency, programming, scalability}, number = {5}, pages = {100--111}, posted-at = {2009-08-25 20:31:06}, priority = {2}, publisher = {ACM}, title = {Scalable synchronous queues}, url = {http://dx.doi.org/10.1145/1506409.1506431}, volume = {52}, year = {2009} }

TY - JOUR ID - citeulike:5645959 L3 - citeulike-article-id:5645959 N2 - 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 . IS - 5 JF - Commun. ACM SN - 0001-0782 AD - New York, NY, USA EP - 111 TI - Scalable synchronous queues PB - ACM VL - 52 SP - 100 KW - concurrency KW - programming KW - scalability AU - Scherer, William AU - Lea, Doug AU - Scott, Michael PY - 2009/// UR - http://dx.doi.org/10.1145/1506409.1506431 ER -