{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:09:43Z","timestamp":1743077383077,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030576745"},{"type":"electronic","value":"9783030576752"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57675-2_11","type":"book-chapter","created":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T23:12:33Z","timestamp":1597705953000},"page":"167-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving Mapping for Sparse Direct\u00a0Solvers"],"prefix":"10.1007","author":[{"given":"Changjiang","family":"Gou","sequence":"first","affiliation":[]},{"given":"Ali Al","family":"Zoobi","sequence":"additional","affiliation":[]},{"given":"Anne","family":"Benoit","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Faverge","sequence":"additional","affiliation":[]},{"given":"Loris","family":"Marchal","sequence":"additional","affiliation":[]},{"given":"Gr\u00e9goire","family":"Pichon","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Ramet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,18]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1007\/978-0-387-09766-4_204","volume-title":"Encyclopedia of Parallel Computing","author":"PR Amestoy","year":"2011","unstructured":"Amestoy, P.R., Buttari, A., Duff, I.S., Guermouche, A., L\u2019Excellent, J.Y., U\u00e7ar, B.: MUMPS. In: Padua, D. (ed.) Encyclopedia of Parallel Computing, pp. 1232\u20131238. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-0-387-09766-4_204"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/S0045-7825(99)00242-X","volume":"184","author":"PR Amestoy","year":"2000","unstructured":"Amestoy, P.R., Duff, I.S., L\u2019Excellent, J.Y.: Multifrontal parallel distributed symmetric and unsymmetric solvers. Comput. Methods Appl. Mech. Eng. 184(2), 501\u2013520 (2000)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/978-3-540-74466-5_80","volume-title":"Euro-Par 2007 Parallel Processing","author":"O Beaumont","year":"2007","unstructured":"Beaumont, O., Guermouche, A.: Task scheduling for parallel multifrontal methods. In: Kermarrec, A.-M., Boug\u00e9, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 758\u2013766. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74466-5_80"},{"issue":"5","key":"11_CR4","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"RD Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. J. ACM 46(5), 720\u2013748 (1999)","journal-title":"J. ACM"},{"doi-asserted-by":"publisher","unstructured":"Davis, T.A.: Direct Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics (2006). https:\/\/doi.org\/10.1137\/1.9780898718881","key":"11_CR5","DOI":"10.1137\/1.9780898718881"},{"doi-asserted-by":"publisher","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1) (2011). https:\/\/doi.org\/10.1145\/2049662.2049663","key":"11_CR6","DOI":"10.1145\/2049662.2049663"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"IS Duff","year":"1983","unstructured":"Duff, I.S., Reid, J.K.: The multifrontal solution of indefinite sparse symmetric linear. ACM Trans. Math. Softw. 9(3), 302\u2013325 (1983)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0167-8191(89)90101-4","volume":"10","author":"A George","year":"1989","unstructured":"George, A., Liu, J.W., Ng, E.: Communication results for parallel sparse Cholesky factorization on a hypercube. Parallel Comput. 10(3), 287\u2013298 (1989)","journal-title":"Parallel Comput."},{"doi-asserted-by":"crossref","unstructured":"Gou, C., et al.: Improving mapping for sparse direct solvers: a trade-off between data locality and load balancing. Research report RR-9328, Inria (2020). hal.inria.fr","key":"11_CR9","DOI":"10.1007\/978-3-030-57675-2_11"},{"doi-asserted-by":"publisher","unstructured":"Gou, C., et al.: Artifact for Euro-Par2020 Paper - Improving mapping for sparse direct solvers: a trade-off between data locality and load balancing, July 2020. https:\/\/doi.org\/10.6084\/m9.figshare.12562682. https:\/\/springernature.figshare.com\/articles\/dataset\/Artifact_for_Euro-Par2020_Paper_--_Improving_mapping_for_sparse_direct_solvers_A_trade-off_between_data_locality_and_load_balancing\/12562682\/1","key":"11_CR10","DOI":"10.6084\/m9.figshare.12562682"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1137\/1033099","volume":"33","author":"MT Heath","year":"1991","unstructured":"Heath, M.T., Ng, E., Peyton, B.W.: Parallel algorithms for sparse linear systems. SIAM Rev. 33(3), 420\u2013460 (1991). https:\/\/doi.org\/10.1137\/1033099","journal-title":"SIAM Rev."},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0167-8191(01)00141-7","volume":"28","author":"P H\u00e9non","year":"2002","unstructured":"H\u00e9non, P., Ramet, P., Roman, J.: PaStiX: a high-performance parallel direct solver for sparse symmetric definite systems. Parallel Comput. 28(2), 301\u2013321 (2002)","journal-title":"Parallel Comput."},{"unstructured":"Jacquelin, M., Zheng, Y., Ng, E., Yelick, K.A.: An asynchronous task-based fan-both sparse cholesky solver. CoRR (2016). http:\/\/arxiv.org\/abs\/1608.00044","key":"11_CR13"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1145\/779359.779361","volume":"29","author":"XS Li","year":"2003","unstructured":"Li, X.S., Demmel, J.W.: SuperLU$$\\_$$DIST: a scalable distributed-memory sparse direct solver for unsymmetric linear systems. ACM Trans. Math. Softw. 29(2), 110\u2013140 (2003). https:\/\/doi.org\/10.1145\/779359.779361","journal-title":"ACM Trans. Math. Softw."},{"doi-asserted-by":"crossref","unstructured":"McGill, R., Tukey, J.W., Larsen, W.A.: Variations of box plots. Am. Stat. 32(1), 12\u201316 (1978). http:\/\/www.jstor.org\/stable\/2683468","key":"11_CR15","DOI":"10.1080\/00031305.1978.10479236"},{"issue":"5","key":"11_CR16","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0914074","volume":"14","author":"A Pothen","year":"1993","unstructured":"Pothen, A., Sun, C.: A mapping algorithm for parallel sparse Cholesky factorization. SIAM J. Sci. Comput. 14(5), 1253\u20131257 (1993)","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"11_CR17","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1109\/71.506703","volume":"7","author":"GS Prasanna","year":"1996","unstructured":"Prasanna, G.S., Musicus, B.R.: Generalized multiprocessor scheduling and applications to matrix computations. IEEE Trans. Parallel Distrib. Syst. 7(6), 650\u2013664 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"doi-asserted-by":"publisher","unstructured":"Rothburg, E., Gupta, A.: An efficient block-oriented approach to parallel sparse Cholesky factorization. In: Proceedings of the 1993 ACM\/IEEE Conference on Supercomputing, pp. 503\u2013512 (1993). https:\/\/doi.org\/10.1145\/169627.169791","key":"11_CR18","DOI":"10.1145\/169627.169791"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2020: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57675-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,18]],"date-time":"2024-08-18T00:03:14Z","timestamp":1723939394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57675-2_11"}},"subtitle":["A Trade-Off Between Data Locality and Load Balancing"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030576745","9783030576752"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57675-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2020.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"158","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the coronavirus pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}