{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:46:50Z","timestamp":1750308410643,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-AC05-00OR22725"],"award-info":[{"award-number":["DE-AC05-00OR22725"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3458744.3474041","type":"proceedings-article","created":{"date-parts":[[2021,9,23]],"date-time":"2021-09-23T16:38:30Z","timestamp":1632415110000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Implementing Arbitrary\/Common Concurrent Writes of CRCW PRAM"],"prefix":"10.1145","author":[{"given":"Fady","family":"Ghanim","sequence":"first","affiliation":[{"name":"Oak Ridge National Labs, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wael R","family":"Elwasif","sequence":"additional","affiliation":[{"name":"Oak ridge National Labs, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David E","family":"Bernholdt","sequence":"additional","affiliation":[{"name":"Oak Ridge National Labs, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,9,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676869"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73037"},{"key":"e_1_3_2_1_3_1","article-title":"Collapsing the Hierarchy of Parallel Computational","volume":"21","author":"Bruda D.","year":"2010","unstructured":"Stefan\u00a0 D. Bruda and Yuanqiao Zhang . 2010 . Collapsing the Hierarchy of Parallel Computational Models. Int. J. Found. Comput. Sci. 21 , 3 (2010). Stefan\u00a0D. Bruda and Yuanqiao Zhang. 2010. Collapsing the Hierarchy of Parallel Computational Models. Int. J. Found. Comput. Sci. 21, 3 (2010).","journal-title":"Models. Int. J. Found. Comput. Sci."},{"key":"e_1_3_2_1_4_1","unstructured":"B.\u00a0S. Chlebus K. Diks T. Hagerup and T. Radzik. 1988. Efficient simulations between concurrent-read concurrent-write pram models. In Mathematical Foundations of Computer Science 1988 Michal\u00a0P. Chytil V\u00e1clav Koubek and Ladislav Janiga(Eds.). Springer Berlin Heidelberg Berlin Heidelberg.  B.\u00a0S. Chlebus K. Diks T. Hagerup and T. Radzik. 1988. Efficient simulations between concurrent-read concurrent-write pram models. In Mathematical Foundations of Computer Science 1988 Michal\u00a0P. Chytil V\u00e1clav Koubek and Ladislav Janiga(Eds.). Springer Berlin Heidelberg Berlin Heidelberg."},{"key":"e_1_3_2_1_5_1","volume-title":"LogP: towards a realistic model of parallel computation. SIGPLAN Not. 28, 7","author":"Culler David","year":"1993","unstructured":"David Culler , Richard Karp , David Patterson , Abhijit Sahay , Klaus\u00a0Erik Schauser , Eunice Santos , Eunice Santos , Eunice Santos , Eunice Santos , Ramesh Subramonian , and Thorsten von Eicken . 1993. LogP: towards a realistic model of parallel computation. SIGPLAN Not. 28, 7 ( 1993 ). David Culler, Richard Karp, David Patterson, Abhijit Sahay, Klaus\u00a0Erik Schauser, Eunice Santos, Eunice Santos, Eunice Santos, Eunice Santos, Ramesh Subramonian, and Thorsten von Eicken. 1993. LogP: towards a realistic model of parallel computation. SIGPLAN Not. 28, 7 (1993)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2141702.2141714"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of the 25th Annu. ACM Symp. on Parallelism in Algorithms and Architectures.","author":"Edwards James","year":"2013","unstructured":"James Edwards and Uzi Vishkin . 2013 . Brief Announcement: Truly Parallel Burrows-wheeler Compression and Decompression . In Proc. of the 25th Annu. ACM Symp. on Parallelism in Algorithms and Architectures. James Edwards and Uzi Vishkin. 2013. Brief Announcement: Truly Parallel Burrows-wheeler Compression and Decompression. In Proc. of the 25th Annu. ACM Symp. on Parallelism in Algorithms and Architectures."},{"key":"e_1_3_2_1_8_1","unstructured":"Oak Ridge Computing\u00a0Leadership Facility. 2021. Andes cluster. https:\/\/www.olcf.ornl.gov\/olcf-resources\/compute-systems\/andes\/  Oak Ridge Computing\u00a0Leadership Facility. 2021. Andes cluster. https:\/\/www.olcf.ornl.gov\/olcf-resources\/compute-systems\/andes\/"},{"volume-title":"STACS 93, P.\u00a0Enjalbert, A.\u00a0Finkel, and K.\u00a0W","author":"Fich E.","key":"e_1_3_2_1_9_1","unstructured":"Faith\u00a0 E. Fich , Russell Impagliazzo , Bruce Kapron , Valerie King , and Miroslaw Kutylowski . 1993. Limits on the power of parallel random access machines with weak forms of write conflict resolution . In STACS 93, P.\u00a0Enjalbert, A.\u00a0Finkel, and K.\u00a0W . Wagner (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . Faith\u00a0E. Fich, Russell Impagliazzo, Bruce Kapron, Valerie King, and Miroslaw Kutylowski. 1993. Limits on the power of parallel random access machines with weak forms of write conflict resolution. In STACS 93, P.\u00a0Enjalbert, A.\u00a0Finkel, and K.\u00a0W. Wagner (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762109"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2003.12.001"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2754376"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1127"},{"volume-title":"STACS 92","author":"Hagerup Torben","key":"e_1_3_2_1_14_1","unstructured":"Torben Hagerup . 1992. Fast and optimal simulations between CRCW PRAMs . In STACS 92 , Alain Finkel and Matthias Jantzen (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . Torben Hagerup. 1992. Fast and optimal simulations between CRCW PRAMs. In STACS 92, Alain Finkel and Matthias Jantzen (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg."},{"volume-title":"Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures(SPAA \u201990)","author":"Hagerup Torben","key":"e_1_3_2_1_15_1","unstructured":"Torben Hagerup and T. Radzik . 1990. Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM . In Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures(SPAA \u201990) . Association for Computing Machinery, New York, NY, USA. Torben Hagerup and T. Radzik. 1990. Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. In Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures(SPAA \u201990). Association for Computing Machinery, New York, NY, USA."},{"volume-title":"An Introduction to Parallel Algorithms","author":"JaJa J.","key":"e_1_3_2_1_16_1","unstructured":"J. JaJa . 1992. An Introduction to Parallel Algorithms . Addison-Wesley Publishing Company . J. JaJa. 1992. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company."},{"key":"e_1_3_2_1_17_1","unstructured":"Rodinia Project. 2021. Rodinia Benchmark Suite. http:\/\/www.cs.virginia.edu\/rodinia\/doku.php?id=start  Rodinia Project. 2021. Rodinia Benchmark Suite. http:\/\/www.cs.virginia.edu\/rodinia\/doku.php?id=start"},{"key":"e_1_3_2_1_18_1","first-page":"1","article-title":"Processor-Time Tradeoffs in PRAM Simulations","volume":"44","author":"Radge Prabhakar","year":"1992","unstructured":"Prabhakar Radge . 1992 . Processor-Time Tradeoffs in PRAM Simulations . J. Comput. Syst. Sci. 44 , 1 (Feb. 1992). Prabhakar Radge. 1992. Processor-Time Tradeoffs in PRAM Simulations. J. Comput. Syst. Sci. 44, 1 (Feb. 1992).","journal-title":"J. Comput. Syst. Sci."},{"key":"e_1_3_2_1_19_1","article-title":"An O(logn) parallel connectivity algorithm","volume":"3","author":"Shiloach Yossi","year":"1982","unstructured":"Yossi Shiloach and Uzi Vishkin . 1982 . An O(logn) parallel connectivity algorithm . Journal of Algorithms 3 , 1 (1982). https:\/\/www.sciencedirect.com\/science\/article\/pii\/0196677482900086 Yossi Shiloach and Uzi Vishkin. 1982. An O(logn) parallel connectivity algorithm. Journal of Algorithms 3, 1 (1982). https:\/\/www.sciencedirect.com\/science\/article\/pii\/0196677482900086","journal-title":"Journal of Algorithms"},{"key":"e_1_3_2_1_20_1","volume-title":"A Simple Parallel Cartesian Tree Algorithm and Its Application to Parallel Suffix Tree Constr.1, 1 (Oct","author":"Shun Julian","year":"2014","unstructured":"Julian Shun and Guy\u00a0 E. Blelloch . 2014. A Simple Parallel Cartesian Tree Algorithm and Its Application to Parallel Suffix Tree Constr.1, 1 (Oct . 2014 ). Julian Shun and Guy\u00a0E. Blelloch. 2014. A Simple Parallel Cartesian Tree Algorithm and Its Application to Parallel Suffix Tree Constr.1, 1 (Oct. 2014)."},{"key":"e_1_3_2_1_21_1","unstructured":"U. Vishkin G. Caragea and B. Lee. 2008. Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform. In Handbook on Parallel Computing (Editors: S. Rajasekaran J. Reif). Chapman and Hall\/CRC Press.  U. Vishkin G. Caragea and B. Lee. 2008. Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform. In Handbook on Parallel Computing (Editors: S. Rajasekaran J. Reif). Chapman and Hall\/CRC Press."},{"volume-title":"Proc. ACM Computing Frontiers.","author":"Wen X.","key":"e_1_3_2_1_22_1","unstructured":"X. Wen and U. Vishkin . 2008. FPGA-based prototype of a PRAM-on-chip processor . In Proc. ACM Computing Frontiers. X. Wen and U. Vishkin. 2008. FPGA-based prototype of a PRAM-on-chip processor. In Proc. ACM Computing Frontiers."},{"key":"e_1_3_2_1_23_1","volume-title":"IEEE Proceedings of the SOUTHEASTCON \u201991","volume":"1","author":"Yang B.","unstructured":"S.\u00a0 B. Yang , S.\u00a0 K. Dhall , and S. Lakshmivarahan . 1991. Simple randomized parallel algorithms for finding a maximal matching in an undirected graph . In IEEE Proceedings of the SOUTHEASTCON \u201991 . 579\u2013581 vol. 1 . S.\u00a0B. Yang, S.\u00a0K. Dhall, and S. Lakshmivarahan. 1991. Simple randomized parallel algorithms for finding a maximal matching in an undirected graph. In IEEE Proceedings of the SOUTHEASTCON \u201991. 579\u2013581 vol.1."}],"event":{"name":"ICPP 2021: 50th International Conference on Parallel Processing","acronym":"ICPP 2021","location":"Lemont IL USA"},"container-title":["50th International Conference on Parallel Processing Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3458744.3474041","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3458744.3474041","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3458744.3474041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:06Z","timestamp":1750268946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3458744.3474041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":23,"alternative-id":["10.1145\/3458744.3474041","10.1145\/3458744"],"URL":"https:\/\/doi.org\/10.1145\/3458744.3474041","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-09-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}