{"publisher":"ACM Press","conference":{"start_date":"2013-05-14","name":"CF: Conference on Computing Frontiers","location":"Ischia, Italy","end_date":"2013-05-16"},"article_number":"17","date_created":"2022-03-21T07:33:22Z","date_updated":"2022-06-21T08:01:19Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publication":"Proceedings of the ACM International Conference on Computing Frontiers - CF '13","month":"05","publication_identifier":{"isbn":["978-145032053-5"]},"language":[{"iso":"eng"}],"year":"2013","department":[{"_id":"ToHe"}],"title":"Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation","author":[{"full_name":"Haas, Andreas","last_name":"Haas","first_name":"Andreas"},{"full_name":"Lippautz, Michael","first_name":"Michael","last_name":"Lippautz"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Hannes","last_name":"Payer","full_name":"Payer, Hannes"},{"full_name":"Sokolova, Ana","first_name":"Ana","last_name":"Sokolova"},{"first_name":"Christoph M.","last_name":"Kirsch","full_name":"Kirsch, Christoph M."},{"full_name":"Sezgin, Ali","last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali"}],"quality_controlled":"1","oa_version":"None","date_published":"2013-05-01T00:00:00Z","citation":{"chicago":"Haas, Andreas, Michael Lippautz, Thomas A Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, and Ali Sezgin. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” In <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. ACM Press, 2013. <a href=\"https://doi.org/10.1145/2482767.2482789\">https://doi.org/10.1145/2482767.2482789</a>.","ama":"Haas A, Lippautz M, Henzinger TA, et al. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In: <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. ACM Press; 2013. doi:<a href=\"https://doi.org/10.1145/2482767.2482789\">10.1145/2482767.2482789</a>","ista":"Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin A. 2013. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. CF: Conference on Computing Frontiers, 17.","mla":"Haas, Andreas, et al. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>, no. 5, 17, ACM Press, 2013, doi:<a href=\"https://doi.org/10.1145/2482767.2482789\">10.1145/2482767.2482789</a>.","ieee":"A. Haas <i>et al.</i>, “Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation,” in <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>, Ischia, Italy, 2013, no. 5.","short":"A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch, A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, ACM Press, 2013.","apa":"Haas, A., Lippautz, M., Henzinger, T. A., Payer, H., Sokolova, A., Kirsch, C. M., &#38; Sezgin, A. (2013). Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. Ischia, Italy: ACM Press. <a href=\"https://doi.org/10.1145/2482767.2482789\">https://doi.org/10.1145/2482767.2482789</a>"},"abstract":[{"text":"A prominent remedy to multicore scalability issues in concurrent data structure implementations is to relax the sequential specification of the data structure. We present distributed queues (DQ), a new family of relaxed concurrent queue implementations. DQs implement relaxed queues with linearizable emptiness check and either configurable or bounded out-of-order behavior or pool behavior. Our experiments show that DQs outperform and outscale in micro- and macrobenchmarks all strict and relaxed queue as well as pool implementations that we considered.","lang":"eng"}],"day":"01","scopus_import":"1","article_processing_charge":"No","type":"conference","_id":"10898","doi":"10.1145/2482767.2482789","issue":"5"}