{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:23:36Z","timestamp":1725701016124},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642328190"},{"type":"electronic","value":"9783642328206"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32820-6_87","type":"book-chapter","created":{"date-parts":[[2012,8,23]],"date-time":"2012-08-23T12:26:25Z","timestamp":1345724785000},"page":"883-894","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Understanding the Performance of Concurrent Data Structures on Graphics Processors"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Cederman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bapi","family":"Chatterjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippas","family":"Tsigas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"87_CR1","unstructured":"NVIDIA: NVIDIA CUDA C Programming Guide. 4.0 edn. (2011)"},{"key":"87_CR2","unstructured":"The Khronos Group Inc.: OpenCl Reference Pages. 1.2 edn. (2011)"},{"key":"87_CR3","unstructured":"Treiber, R.: System programming: Coping with parallelism. Technical Report RJ5118, IBM Almaden Research Center (1986)"},{"key":"87_CR4","doi-asserted-by":"crossref","unstructured":"Giacomoni, J., Moseley, T., Vachharajani, M.: FastForward for efficient pipeline parallelism: a cache-optimized concurrent lock-free queue. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 43\u201352. ACM (2008)","DOI":"10.1145\/1345206.1345215"},{"key":"87_CR5","doi-asserted-by":"crossref","unstructured":"Preud\u2019homme, T., Sopena, J., Thomas, G., Folliot, B.: BatchQueue: Fast and Memory-Thrifty Core to Core Communication. In: 22nd International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), pp. 215\u2013222 (2010)","DOI":"10.1109\/SBAC-PAD.2010.34"},{"key":"87_CR6","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1882486.1882508","volume-title":"Proceedings of the 5th ACM\/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2009","author":"P.P.C. Lee","year":"2009","unstructured":"Lee, P.P.C., Bu, T., Chandranmenon, G.: A lock-free, cache-efficient shared ring buffer for multi-core architectures. In: Proceedings of the 5th ACM\/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2009, pp. 78\u201379. ACM, New York (2009)"},{"key":"87_CR7","doi-asserted-by":"crossref","unstructured":"Michael, M., Scott, M.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pp. 267\u2013275. ACM (1996)","DOI":"10.1145\/248052.248106"},{"key":"87_CR8","doi-asserted-by":"crossref","unstructured":"Tsigas, P., Zhang, Y.: A simple, fast and scalable non-blocking concurrent fifo queue for shared memory multiprocessor systems. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 134\u2013143. ACM (2001)","DOI":"10.1145\/378580.378611"},{"key":"87_CR9","doi-asserted-by":"crossref","unstructured":"Gidenstam, A., Sundell, H., Tsigas, P.: Cache-Aware Lock-Free Queues for Multiple Producers\/Consumers and Weak Memory Consistency. In: Proceedings of the 14th International Conference on Principles of Distributed Systems, pp. 302\u2013317 (2010)","DOI":"10.1007\/978-3-642-17653-1_23"},{"key":"87_CR10","unstructured":"Sundell, H., Tsigas, P.: Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems. In: Proceedings of the 17th IEEE\/ACM International Parallel and Distributed Processing Symposium (IPDPS), pp. 84\u201394. IEEE Press (2003)"},{"key":"87_CR11","unstructured":"Cederman, D., Gidenstam, A., Ha, P., Sundell, H., Papatriantafilou, M., Tsigas, P.: Lock-free Concurrent Data Structures. In: Pllana, S., et al. (eds.) Programming Multi-core and Many-core Computing Systems. John Wiley & Sons (2012)"},{"issue":"5","key":"87_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1409060.1409079","volume":"27","author":"K. Zhou","year":"2008","unstructured":"Zhou, K., Hou, Q., Wang, R., Guo, B.: Real-time kd-tree construction on graphics hardware. ACM Transactions on Graphics\u00a027(5), 1\u201311 (2008)","journal-title":"ACM Transactions on Graphics"},{"issue":"5","key":"87_CR13","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1109\/TVCG.2010.75","volume":"17","author":"K. Zhou","year":"2011","unstructured":"Zhou, K., Gong, M., Huang, X., Guo, B.: Data-Parallel Octrees for Surface Reconstruction. IEEE Transactions on Visualization and Computer Graphics\u00a017(5), 669\u2013681 (2011)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"1","key":"87_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/1122501.1122505","volume":"25","author":"A.E. Lefohn","year":"2006","unstructured":"Lefohn, A.E., Sengupta, S., Kniss, J., Strzodka, R., Owens, J.D.: Glift: Generic, efficient, random-access GPU data structures. ACM Transactions on Graphics\u00a025(1), 60\u201399 (2006)","journal-title":"ACM Transactions on Graphics"},{"key":"87_CR15","unstructured":"Cederman, D., Tsigas, P.: On dynamic load balancing on graphics processors. In: Proceedings of the 23rd Symposium on Graphics Hardware, GH 2008, pp. 57\u201364. Eurographics Association (2008)"},{"key":"87_CR16","first-page":"1110","volume":"arXiv","author":"J. Stuart","year":"2011","unstructured":"Stuart, J., Owens, J.: Efficient synchronization primitives for gpus. Arxiv preprint arXiv:1110.4623 (2011)","journal-title":"Arxiv preprint"},{"key":"87_CR17","unstructured":"NVIDIA: Whitepaper NVIDIA Next Generation CUDATM Compute Architecture:\u00a0FermiTM. 1.1 edn. (2009)"},{"key":"87_CR18","unstructured":"NVIDIA: Whitepaper NVIDIA GeForce GTX 680. 1.0 edn. (2012)"},{"key":"87_CR19","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/69624.357207","volume":"5","author":"L. Lamport","year":"1983","unstructured":"Lamport, L.: Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems\u00a05, 190\u2013222 (1983)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"87_CR20","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport, L.: A new solution of Dijkstra\u2019s concurrent programming problem. Communications of the ACM\u00a017, 453\u2013455 (1974)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2012 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32820-6_87","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:57:22Z","timestamp":1587344242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32820-6_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642328190","9783642328206"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32820-6_87","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}