{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:14:35Z","timestamp":1776122075924,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,24]],"date-time":"2015-01-24T00:00:00Z","timestamp":1422057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["610741"],"award-info":[{"award-number":["610741"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,1,24]]},"DOI":"10.1145\/2688500.2688517","type":"proceedings-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T09:12:26Z","timestamp":1422436346000},"page":"120-129","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Scalable and efficient implementation of 3d unstructured meshes computation: a case study on matrix assembly"],"prefix":"10.1145","author":[{"given":"Lo\u00efc","family":"Th\u00e9bault","sequence":"first","affiliation":[{"name":"University of Versailles, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Petit","sequence":"additional","affiliation":[{"name":"University of Versailles, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quang","family":"Dinh","sequence":"additional","affiliation":[{"name":"Dassault Aviation, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,1,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882364"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2008.10.002"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.2989"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/800195.805928"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1155\/2001\/569670"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7825(89)90157-6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277725"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2513109.2513110"},{"key":"e_1_3_2_1_10_1","first-page":"1522","volume-title":"Procedia CS","author":"Gorman G. J.","year":"2012","unstructured":"G. J. Gorman , J. Southern , P. E. Farrell , M. D. Piggott , G. Rokos , and P. H. J. Kelly . Hybrid openmp\/mpi anisotropic mesh smoothing . Procedia CS , pages 1513\u2013 1522 , 2012 . G. J. Gorman, J. Southern, P. E. Farrell, M. D. Piggott, G. Rokos, and P. H. J. Kelly. Hybrid openmp\/mpi anisotropic mesh smoothing. Procedia CS, pages 1513\u20131522, 2012."},{"key":"e_1_3_2_1_11_1","volume-title":"Using MPI: portable parallel programming with the message-passing interface","author":"Gropp W.","year":"1999","unstructured":"W. Gropp , E. Lusk , and A. Skjellum . Using MPI: portable parallel programming with the message-passing interface , volume 1 . MIT press , 1999 . W. Gropp, E. Lusk, and A. Skjellum. Using MPI: portable parallel programming with the message-passing interface, volume 1. MIT press, 1999."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676280"},{"key":"e_1_3_2_1_13_1","volume-title":"Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0","author":"Karypis G.","year":"1995","unstructured":"G. Karypis and V. Kumar . Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0 . 1995 . G. Karypis and V. Kumar. Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0. 1995."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1854273.1854291"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/325164.325132"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2011.2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/fld.3648"},{"key":"e_1_3_2_1_18_1","first-page":"335","volume-title":"International Multiconference on Computer Science and Information Technology - IMCSIT","author":"Martone M.","year":"2010","unstructured":"M. Martone , S. Filippone , P. Gepner , M. Paprzycki , and S. Tucci . Use of hybrid recursive CSR\/COO data structures in sparse matrices-vector multiplication . In International Multiconference on Computer Science and Information Technology - IMCSIT , pages 327\u2013 335 , 2010 . M. Martone, S. Filippone, P. Gepner, M. Paprzycki, and S. Tucci. Use of hybrid recursive CSR\/COO data structures in sparse matrices-vector multiplication. In International Multiconference on Computer Science and Information Technology - IMCSIT, pages 327\u2013335, 2010."},{"key":"e_1_3_2_1_19_1","first-page":"325","volume-title":"Proceedings of the 2010 International Multiconference on","author":"Martone M.","unstructured":"M. Martone , S. Filippone , S. Tucci , and M. Paprzycki . Assembling recursively stored sparse matrices. In Computer Science and Information Technology (IMCSIT) , Proceedings of the 2010 International Multiconference on , pages 317\u2013 325 . IEEE, 2010. M. Martone, S. Filippone, S. Tucci, and M. Paprzycki. Assembling recursively stored sparse matrices. In Computer Science and Information Technology (IMCSIT), Proceedings of the 2010 International Multiconference on, pages 317\u2013325. IEEE, 2010."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S00361445003820"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.82"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503287"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40047-6_56"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2386208.2386222"},{"key":"e_1_3_2_1_25_1","first-page":"25","article-title":"Divide and conquer parallelization of finite element method assembly. Parallel Computing: Accelerating Computational Science and Engineering (CSE)","author":"Thebault L.","year":"2014","unstructured":"L. Thebault , E. Petit , M. Tchiboukdjian , Q. Dinh , and W. Jalby . Divide and conquer parallelization of finite element method assembly. Parallel Computing: Accelerating Computational Science and Engineering (CSE) , Advances in Parallel Computing 25 , 2014 . L. Thebault, E. Petit, M. Tchiboukdjian, Q. Dinh, and W. Jalby. Divide and conquer parallelization of finite element method assembly. Parallel Computing: Accelerating Computational Science and Engineering (CSE), Advances in Parallel Computing 25, 2014.","journal-title":"Advances in Parallel Computing"}],"event":{"name":"PPoPP '15: 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"San Francisco CA USA","acronym":"PPoPP '15","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688500.2688517","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2688500.2688517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:55:45Z","timestamp":1750258545000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688500.2688517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,24]]},"references-count":25,"alternative-id":["10.1145\/2688500.2688517","10.1145\/2688500"],"URL":"https:\/\/doi.org\/10.1145\/2688500.2688517","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2858788.2688517","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,1,24]]},"assertion":[{"value":"2015-01-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}