{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:40Z","timestamp":1763468080420,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,9,19]],"date-time":"2012-09-19T00:00:00Z","timestamp":1348012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,9,19]]},"DOI":"10.1145\/2370816.2370858","type":"proceedings-article","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T23:48:43Z","timestamp":1348616923000},"page":"283-292","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["Shared memory multiplexing"],"prefix":"10.1145","author":[{"given":"Yi","family":"Yang","sequence":"first","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Xiang","sequence":"additional","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Mantor","sequence":"additional","affiliation":[{"name":"AMD Inc., Orlando, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norm","family":"Rubin","sequence":"additional","affiliation":[{"name":"AMD Inc., Orlando, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiyang","family":"Zhou","sequence":"additional","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,9,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2005.1430546"},{"key":"e_1_3_2_1_2_1","unstructured":"AMD Accelerated Parallel Processing SDK V2.3 2011  AMD Accelerated Parallel Processing SDK V2.3 2011"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2010.107"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950408"},{"key":"e_1_3_2_1_5_1","volume-title":"NVIDIA","author":"Ruetsch G.","year":"2009","unstructured":"G. Ruetsch and P. Micikevicius , Optimize matrix transpose in CUDA . NVIDIA , 2009 . G. Ruetsch and P. Micikevicius, Optimize matrix transpose in CUDA. NVIDIA, 2009."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145819"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1413370.1413373"},{"key":"e_1_3_2_1_8_1","unstructured":"NVIDIA CUDA Toolkit 4.0 CUBLAS Library 2011  NVIDIA CUDA Toolkit 4.0 CUBLAS Library 2011"},{"key":"e_1_3_2_1_9_1","unstructured":"NVIDIA CUDA Toolkit 4.0 CUFFT Library 2011  NVIDIA CUDA Toolkit 4.0 CUFFT Library 2011"},{"key":"e_1_3_2_1_10_1","unstructured":"NVIDIA CUDA C Programming Guide 4.0 2011.  NVIDIA CUDA C Programming Guide 4.0 2011."},{"key":"e_1_3_2_1_11_1","unstructured":"NVIDIA GPU Computing SDK 4.0 2011.  NVIDIA GPU Computing SDK 4.0 2011."},{"key":"e_1_3_2_1_12_1","unstructured":"OpenCL http:\/\/www.khronos.org\/opencl\/  OpenCL http:\/\/www.khronos.org\/opencl\/"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1383422.1383443"},{"key":"e_1_3_2_1_14_1","volume-title":"Workshops on Languages and Compilers for Parallel Computing","author":"Lee S. I.","year":"2003","unstructured":"S. I. Lee , T. Johnson , and R. Eigenmann . Cetus -- an extensible compiler infrastructure for source-to-source transformation . In Workshops on Languages and Compilers for Parallel Computing , 2003 S. I. Lee, T. Johnson, and R. Eigenmann. Cetus -- an extensible compiler infrastructure for source-to-source transformation. In Workshops on Languages and Compilers for Parallel Computing, 2003"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1356058.1356084"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345220"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1413370.1413402"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806606"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2012.30"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693472"}],"event":{"name":"PACT '12: International Conference on Parallel Architectures and Compilation Techniques","sponsor":["IFIP WG 10.3 IFIP WG 10.3","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS TCPP IEEE Computer Society Technical Committee on Parallel Processing","IEEE CS TCAA IEEE CS technical committee on architectural acoustics"],"location":"Minneapolis Minnesota USA","acronym":"PACT '12"},"container-title":["Proceedings of the 21st international conference on Parallel architectures and compilation techniques"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2370816.2370858","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2370816.2370858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:17Z","timestamp":1750239257000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2370816.2370858"}},"subtitle":["a novel way to improve GPGPU throughput"],"short-title":[],"issued":{"date-parts":[[2012,9,19]]},"references-count":20,"alternative-id":["10.1145\/2370816.2370858","10.1145\/2370816"],"URL":"https:\/\/doi.org\/10.1145\/2370816.2370858","relation":{},"subject":[],"published":{"date-parts":[[2012,9,19]]},"assertion":[{"value":"2012-09-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}