{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T04:51:20Z","timestamp":1685681480094},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["17256631919223,2028949"]},{"DOI":"10.13039\/100016682","name":"VMware","doi-asserted-by":"publisher","award":["University Research Fund Award"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461816","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["The Processing-in-Memory Model"],"prefix":"10.1145","author":[{"given":"Hongbo","family":"Kang","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Phillip B.","family":"Gibbons","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Laxman","family":"Dhulipala","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}]},{"given":"Yan","family":"Gu","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}]},{"given":"Charles","family":"McGuffey","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Parallel Batch-Dynamic Graph Connectivity. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 381--392","author":"Acar Umut A.","year":"2019","unstructured":"Umut A. Acar , Daniel Anderson , Guy E. Blelloch , and Laxman Dhulipala . 2019 . Parallel Batch-Dynamic Graph Connectivity. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 381--392 . Umut A. Acar, Daniel Anderson, Guy E. Blelloch, and Laxman Dhulipala. 2019. Parallel Batch-Dynamic Graph Connectivity. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 381--392."},{"key":"e_1_3_2_1_2_1","first-page":"321","article-title":"The Data Locality of Work Stealing","volume":"35","author":"Acar Umut A.","year":"2002","unstructured":"Umut A. Acar , Guy E. Blelloch , and Robert D. Blumofe . 2002 . The Data Locality of Work Stealing . Theoretical Computer Science , Vol. 35 , 3 (2002), 321 -- 347 . Umut A. Acar, Guy E. Blelloch, and Robert D. Blumofe. 2002. The Data Locality of Work Stealing. Theoretical Computer Science , Vol. 35, 3 (2002), 321--347.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-001-0004-z"},{"key":"e_1_3_2_1_4_1","volume-title":"ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 59--68","author":"Behnezhad Soheil","unstructured":"Soheil Behnezhad , Laxman Dhulipala , Hossein Esfandiari , Jakub \u0141ka cki, Vahab Mirrokni, and Warren Schudy. 2019. Massively Parallel Computation via Remote Memory Access . In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 59--68 . Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub \u0141ka cki, Vahab Mirrokni, and Warren Schudy. 2019. Massively Parallel Computation via Remote Memory Access. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 59--68."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2016.12.009"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.023"},{"key":"e_1_3_2_1_7_1","first-page":"38","article-title":"On a modification of Chebyshev's inequality and of the error formula of","volume":"1","author":"Bernstein Sergei","year":"1924","unstructured":"Sergei Bernstein . 1924 . On a modification of Chebyshev's inequality and of the error formula of Laplace. Ann. Sci. Inst. Sav. Ukraine, Sect. Math , Vol. 1 , 4 (1924), 38 -- 49 . Sergei Bernstein. 1924. On a modification of Chebyshev's inequality and of the error formula of Laplace. Ann. Sci. Inst. Sav. Ukraine, Sect. Math , Vol. 1, 4 (1924), 38--49.","journal-title":"Laplace. Ann. Sci. Inst. Sav. Ukraine, Sect. Math"},{"key":"e_1_3_2_1_8_1","volume-title":"Just Join for Parallel Ordered Sets. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 253--264","author":"Blelloch Guy E.","year":"2016","unstructured":"Guy E. Blelloch , Daniel Ferizovic , and Yihan Sun . 2016 . Just Join for Parallel Ordered Sets. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 253--264 . Guy E. Blelloch, Daniel Ferizovic, and Yihan Sun. 2016. Just Join for Parallel Ordered Sets. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 253--264."},{"key":"e_1_3_2_1_9_1","volume-title":"Optimal Parallel Algorithms in the Binary-Forking Model. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":"Blelloch Guy E.","year":"2020","unstructured":"Guy E. Blelloch , Jeremy T. Fineman , Yan Gu , and Yihan Sun . 2020 . Optimal Parallel Algorithms in the Binary-Forking Model. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2020), 89--102. Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, and Yihan Sun. 2020. Optimal Parallel Algorithms in the Binary-Forking Model. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2020), 89--102."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_11_1","volume-title":"ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 297--308","author":"Choe Jiwon","unstructured":"Jiwon Choe , Amy Huang , Tali Moreshet , Maurice Herlihy , and R. Iris Bahar . 2019. Concurrent Data Structures with Near-Data-Processing: an Architecture-Aware Implementation . In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 297--308 . Jiwon Choe, Amy Huang, Tali Moreshet, Maurice Herlihy, and R. Iris Bahar. 2019. Concurrent Data Structures with Near-Data-Processing: an Architecture-Aware Implementation. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 297--308."},{"key":"e_1_3_2_1_12_1","volume-title":"ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 187--199","author":"Das Rathish","unstructured":"Rathish Das , Kunal Agrawal , Michael A. Bender , Jonathan W. Berry , Benjamin Moseley , and Cynthia A. Phillips . 2020. How to Manage High-Bandwidth Memory Automatically . In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 187--199 . Rathish Das, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Benjamin Moseley, and Cynthia A. Phillips. 2020. How to Manage High-Bandwidth Memory Automatically. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 187--199."},{"key":"e_1_3_2_1_13_1","volume-title":"Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) .","author":"Dong Xiaojun","year":"2021","unstructured":"Xiaojun Dong , Yan Gu , Yihan Sun , and Yunming Zhang . 2021 . Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) . Xiaojun Dong, Yan Gu, Yihan Sun, and Yunming Zhang. 2021. Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) ."},{"key":"e_1_3_2_1_14_1","volume-title":"Parallel Priority Queue and List Contraction: The BSP Approach. In European Conference on Parallel Processing (Euro-Par). Springer, 409--416","author":"Gerbessiotis Alexandros V.","year":"1997","unstructured":"Alexandros V. Gerbessiotis , Constantinos J. Siniolakis , and Alexandre Tiskin . 1997 . Parallel Priority Queue and List Contraction: The BSP Approach. In European Conference on Parallel Processing (Euro-Par). Springer, 409--416 . Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, and Alexandre Tiskin. 1997. Parallel Priority Queue and List Contraction: The BSP Approach. In European Conference on Parallel Processing (Euro-Par). Springer, 409--416."},{"key":"e_1_3_2_1_15_1","first-page":"3","article-title":"The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms","volume":"28","author":"Gibbons Phillip B.","year":"1999","unstructured":"Phillip B. Gibbons , Yossi Matias , and Vijaya Ramachandran . 1999 . The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms . SIAM J. on Computing , Vol. 28 , 2 (1999), 3 -- 29 . Phillip B. Gibbons, Yossi Matias, and Vijaya Ramachandran. 1999. The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms. SIAM J. on Computing , Vol. 28, 2 (1999), 3--29.","journal-title":"SIAM J. on Computing"},{"key":"e_1_3_2_1_16_1","volume-title":"Fully De-amortized Cuckoo Hashing for Cache-oblivious Dictionaries and Multimaps. arXiv preprint arXiv:1107.4378","author":"Goodrich Michael T.","year":"2011","unstructured":"Michael T. Goodrich , Daniel S. Hirschberg , Michael Mitzenmacher , and Justin Thaler . 2011. Fully De-amortized Cuckoo Hashing for Cache-oblivious Dictionaries and Multimaps. arXiv preprint arXiv:1107.4378 ( 2011 ). Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, and Justin Thaler. 2011. Fully De-amortized Cuckoo Hashing for Cache-oblivious Dictionaries and Multimaps. arXiv preprint arXiv:1107.4378 (2011)."},{"key":"e_1_3_2_1_17_1","volume-title":"Goodrich and Roberto Tamassia","author":"Michael","year":"2015","unstructured":"Michael T. Goodrich and Roberto Tamassia . 2015 . Algorithm Design and Applications .Wiley Hoboken . Michael T. Goodrich and Roberto Tamassia. 2015. Algorithm Design and Applications .Wiley Hoboken."},{"key":"e_1_3_2_1_18_1","volume-title":"ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 24--34","author":"Gu Yan","unstructured":"Yan Gu , Julian Shun , Yihan Sun , and Guy E. Blelloch . 2015. A Top-Down Parallel Semisort . In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 24--34 . Yan Gu, Julian Shun, Yihan Sun, and Guy E. Blelloch. 2015. A Top-Down Parallel Semisort. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 24--34."},{"key":"e_1_3_2_1_19_1","volume-title":"Concurrent Data Structures for Near-memory Computing. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 235--245","author":"Liu Zhiyu","year":"2017","unstructured":"Zhiyu Liu , Irina Calciu , Maurice Herlihy , and Onur Mutlu . 2017 . Concurrent Data Structures for Near-memory Computing. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 235--245 . Zhiyu Liu, Irina Calciu, Maurice Herlihy, and Onur Mutlu. 2017. Concurrent Data Structures for Near-memory Computing. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 235--245."},{"key":"e_1_3_2_1_20_1","volume-title":"Parallel Tree Contraction and Its Application. In IEEE Symposium on Foundations of Computer Science (FOCS). 478--489","author":"Gary","unstructured":"Gary L. Miller and John H. Reif. 1985 . Parallel Tree Contraction and Its Application. In IEEE Symposium on Foundations of Computer Science (FOCS). 478--489 . Gary L. Miller and John H. Reif. 1985. Parallel Tree Contraction and Its Application. In IEEE Symposium on Foundations of Computer Science (FOCS). 478--489."},{"key":"e_1_3_2_1_21_1","volume-title":"Juan G\u00f3 mez-Luna, and Rachata Ausavarungnirun","author":"Mutlu Onur","year":"2020","unstructured":"Onur Mutlu , Saugata Ghose , Juan G\u00f3 mez-Luna, and Rachata Ausavarungnirun . 2020 . A Modern Primer on Processing in Memory. CoRR , Vol. abs\/ 2012 .03112 (2020). Onur Mutlu, Saugata Ghose, Juan G\u00f3 mez-Luna, and Rachata Ausavarungnirun. 2020. A Modern Primer on Processing in Memory. CoRR , Vol. abs\/2012.03112 (2020)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202005"},{"key":"e_1_3_2_1_23_1","volume-title":"Skip Lists and Probabilistic Analysis of Algorithms","author":"Papadakis Thomas","unstructured":"Thomas Papadakis . 1993. Skip Lists and Probabilistic Analysis of Algorithms . University of Waterloo Ph . D. Dissertation. Thomas Papadakis. 1993. Skip Lists and Probabilistic Analysis of Algorithms .University of Waterloo Ph. D. Dissertation."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0036940"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49543-6_13"},{"key":"e_1_3_2_1_27_1","volume-title":"On the Competitive Analysis of Randomized Static Load Balancing. In Workshop on Randomized Parallel Algorithms (RANDOM) .","author":"Sanders Peter","year":"1996","unstructured":"Peter Sanders . 1996 . On the Competitive Analysis of Randomized Static Load Balancing. In Workshop on Randomized Parallel Algorithms (RANDOM) . Peter Sanders. 1996. On the Competitive Analysis of Randomized Static Load Balancing. In Workshop on Randomized Parallel Algorithms (RANDOM) ."},{"key":"e_1_3_2_1_28_1","volume-title":"Gibbons","author":"Shun Julian","year":"2015","unstructured":"Julian Shun , Yan Gu , Guy E. Blelloch , Jeremy T. Fineman , and Phillip B . Gibbons . 2015 . Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel. In ACM-SIAM Symposium on Discrete Algorithms (SODA). 431--448. Julian Shun, Yan Gu, Guy E. Blelloch, Jeremy T. Fineman, and Phillip B. Gibbons. 2015. Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel. In ACM-SIAM Symposium on Discrete Algorithms (SODA). 431--448."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1970.5008902"},{"key":"e_1_3_2_1_30_1","volume-title":"PAM: Parallel Augmented Maps. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP). 290--304","author":"Sun Yihan","unstructured":"Yihan Sun , Daniel Ferizovic , and Guy E. Blelloch . 2018 . PAM: Parallel Augmented Maps. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP). 290--304 . Yihan Sun, Daniel Ferizovic, and Guy E. Blelloch. 2018. PAM: Parallel Augmented Maps. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP). 290--304."},{"key":"e_1_3_2_1_31_1","volume-title":"Blelloch","author":"Tseng Thomas","year":"2019","unstructured":"Thomas Tseng , Laxman Dhulipala , and Guy E . Blelloch . 2019 . Batch-parallel Euler Tour trees. In SIAM Meeting on Algorithm Engineering and Experiments (ALENEX). 92--106. Thomas Tseng, Laxman Dhulipala, and Guy E. Blelloch. 2019. Batch-parallel Euler Tour trees. In SIAM Meeting on Algorithm Engineering and Experiments (ALENEX). 92--106."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_33_1","volume-title":"ACM Symposium on Computational Geometry (SoCG) .","author":"Wang Yiqiu","year":"2021","unstructured":"Yiqiu Wang , Shangdi Yu , Yan Gu , and Julian Shun . 2021 . A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem . In ACM Symposium on Computational Geometry (SoCG) . Yiqiu Wang, Shangdi Yu, Yan Gu, and Julian Shun. 2021. A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem. In ACM Symposium on Computational Geometry (SoCG) ."},{"key":"e_1_3_2_1_34_1","volume-title":"Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks. In ACM SIGMOD International Conference on Management of Data. 741--758","author":"Ziegler Tobias","year":"2019","unstructured":"Tobias Ziegler , Sumukha Tumkur Vani , Carsten Binnig , Rodrigo Fonseca , and Tim Kraska . 2019 . Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks. In ACM SIGMOD International Conference on Management of Data. 741--758 . Tobias Ziegler, Sumukha Tumkur Vani, Carsten Binnig, Rodrigo Fonseca, and Tim Kraska. 2019. Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks. In ACM SIGMOD International Conference on Management of Data. 741--758."}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","location":"Virtual Event USA","acronym":"SPAA '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3409964.3461816","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461816","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T13:13:07Z","timestamp":1673097187000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461816"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":34,"alternative-id":["10.1145\/3409964.3461816","10.1145\/3409964"],"URL":"http:\/\/dx.doi.org\/10.1145\/3409964.3461816","relation":{},"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}