{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:09:40Z","timestamp":1754485780194,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"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_9","type":"book-chapter","created":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T23:12:33Z","timestamp":1597705953000},"page":"134-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Makespan Lower Bound for the Tiled Cholesky Factorization Based on ALAP Schedule"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2741-6228","authenticated-orcid":false,"given":"Olivier","family":"Beaumont","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7803-1822","authenticated-orcid":false,"given":"Julien","family":"Langou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4309-6992","authenticated-orcid":false,"given":"Willy","family":"Quach","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1795-8421","authenticated-orcid":false,"given":"Alena","family":"Shilova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,18]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Agullo, E., Hadri, B., Ltaief, H., Dongarra, J.: Comparative study of one-sided factorizations with multiple software packages on multi-core hardware. In: ACM\/IEEE Conference on Supercomputing, Portland, OR, SC 2009, November 2009. https:\/\/doi.org\/10.1145\/1654059.1654080","DOI":"10.1145\/1654059.1654080"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Agullo, E., et al.: Bridging the gap between performance and bounds of Cholesky factorization on heterogeneous platforms. In: HCW 2015 (2015). https:\/\/doi.org\/10.1109\/IPDPSW.2015.35","DOI":"10.1109\/IPDPSW.2015.35"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Agullo, E., Beaumont, O., Eyraud-Dubois, L., Kumar, S.: Are static schedules so bad? A case study on Cholesky factorization. In: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1021\u20131030. IEEE (2016). https:\/\/doi.org\/10.1109\/IPDPS.2016.90","DOI":"10.1109\/IPDPS.2016.90"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/cpe.1631","volume":"23","author":"C Augonnet","year":"2011","unstructured":"Augonnet, C., Thibault, S., Namyst, R., Wacrenier, P.A.: StarPU: a unified platform for task scheduling on heterogeneous multicore architectures. Concurr. Comput. Pract. Exp. 23, 187\u2013198 (2011). https:\/\/doi.org\/10.1002\/cpe.1631. Special Issue: Euro-Par 2009","journal-title":"Concurr. Comput. Pract. Exp."},{"issue":"18","key":"9_CR5","doi-asserted-by":"publisher","first-page":"2438","DOI":"10.1002\/cpe.1463","volume":"21","author":"RM Badia","year":"2009","unstructured":"Badia, R.M., Herrero, J.R., Labarta, J., P\u00e9rez, J.M., Quintana-Ort\u00ed, E.S., Quintana-Ort\u00ed, G.: Parallelizing dense and banded linear algebra libraries using SMPSs. Concurr. Comput. Pract. Exp. 21(18), 2438\u20132456 (2009). https:\/\/doi.org\/10.1002\/cpe.1463","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"9_CR6","unstructured":"Beaumont, O., et al.: Scheduling on two types of resources: a survey. arXiv preprint arXiv:1909.11365 (2019)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Beaumont, O., Langou, J., Quach, W., Shilova, A.: A Makespan Lower Bound for the Scheduling of the Tiled Cholesky Factorization based on ALAP Schedule, February 2020. https:\/\/hal.inria.fr\/hal-02487920, working paper or preprint","DOI":"10.1007\/978-3-030-57675-2_9"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Bosilca, G., et al.: Flexible development of dense linear algebra algorithms on massively parallel architectures with DPLASMA. In: IEEE International Symposium on Parallel and Distributed Processing Workshops, pp. 1432\u20131441, May 2011. https:\/\/doi.org\/10.1109\/IPDPS.2011.299","DOI":"10.1109\/IPDPS.2011.299"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Bosilca, G., Bouteiller, A., Danalis, A., Herault, T., Lemarinier, P., Dongarra, J.: DAGuE: a generic distributed DAG engine for high performance computing. Parallel Comput. 38(1\u20132), 37\u201351 (2012). https:\/\/doi.org\/10.1016\/j.parco.2011.10.003","DOI":"10.1016\/j.parco.2011.10.003"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Buttari, A., Langou, J., Kurzak, J., Dongarra, J.: A class of parallel tiled linear algebra algorithms for multicore architectures. Parallel Comput. 35(1), 38\u201353 (2009). https:\/\/doi.org\/10.1016\/j.parco.2008.10.002. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167819108001117","DOI":"10.1016\/j.parco.2008.10.002"},{"key":"9_CR11","unstructured":"Chameleon: a dense linear algebra software for heterogeneous architectures (2014). https:\/\/project.inria.fr\/chameleon. Accessed June 2020"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Chan, E., Van Zee, F.G., Bientinesi, P., Quintana-Ort\u00ed, E.S., Quintana-Ort\u00ed, G., van de Geijn, R.: SuperMatrix: a multithreaded runtime scheduling system for algorithms-by-blocks. In: PPoPP 2008, pp. 123\u2013132. ACM (2008). https:\/\/doi.org\/10.1145\/1345206.1345227","DOI":"10.1145\/1345206.1345227"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.parco.2018.10.007","volume":"83","author":"T Cojean","year":"2019","unstructured":"Cojean, T., Guermouche, A., Hugo, A., Namyst, R., Wacrenier, P.A.: Resource aggregation for task-based Cholesky factorization on top of modern architectures. Parallel Comput. 83, 73\u201392 (2019). https:\/\/doi.org\/10.1016\/j.parco.2018.10.007","journal-title":"Parallel Comput."},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0167-8191(88)90070-1","volume":"6","author":"M Cosnard","year":"1988","unstructured":"Cosnard, M., Marrakchi, M., Robert, Y., Trystram, D.: Parallel Gaussian elimination on an MIMD computer. Parallel Comput. 6(3), 275\u2013296 (1988). https:\/\/doi.org\/10.1016\/0167-8191(88)90070-1","journal-title":"Parallel Comput."},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/504210.504213","volume":"27","author":"JA Gunnels","year":"2001","unstructured":"Gunnels, J.A., Gustavson, F.G., Henry, G.M., van de Geijn, R.A.: Flame: formal linear algebra methods environment. ACM Trans. Math. Softw. 27(4), 422\u2013455 (2001). https:\/\/doi.org\/10.1145\/504210.504213","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1499096.1499100","volume":"36","author":"F Gustavson","year":"2009","unstructured":"Gustavson, F., Karlsson, L., K\u00e5gstr\u00f6m, B.: Distributed SBP Cholesky factorization algorithms with near-optimal scheduling. ACM Trans. Math. Softw. 36(2), 1\u201325 (2009). https:\/\/doi.org\/10.1145\/1499096.1499100","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1137\/1.9781611975215.8","volume":"9","author":"M Jacquelin","year":"2016","unstructured":"Jacquelin, M., Zheng, Y., Ng, E., Yelick, K.: An asynchronous task-based fan-both sparse Cholesky solver. SIAM J. Sci. and Stat. Comput. 9(2), 327\u2013340 (2016). https:\/\/doi.org\/10.1137\/1.9781611975215.8","journal-title":"SIAM J. Sci. and Stat. Comput."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Kim, K., Rajamanickam, S., Stelle, G., Edwards, H.C., Olivier, S.L.: Task parallel incomplete Cholesky factorization using 2D partitioned-block layout. arXiv preprint arXiv:1601.05871 (2016)","DOI":"10.2172\/1237520"},{"issue":"9","key":"9_CR19","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1109\/TPDS.2007.70813","volume":"19","author":"J Kurzak","year":"2008","unstructured":"Kurzak, J., Buttari, A., Dongarra, J.: Solving systems of linear equations on the CELL processor using Cholesky factorization. IEEE Trans. Parallel Distrib. Syst. 19(9), 1175\u20131186 (2008). https:\/\/doi.org\/10.1109\/TPDS.2007.70813","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1002\/cpe.1467","volume":"22","author":"J Kurzak","year":"2010","unstructured":"Kurzak, J., Ltaief, H., Dongarra, J., Badia, R.M.: Scheduling dense linear algebra operations on multicore processors. Concurr. Comput. Pract. Exp. 22(1), 15\u201344 (2010). https:\/\/doi.org\/10.1002\/cpe.1467","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"9_CR21","unstructured":"P\u00e9rez, J.M., Badia, R.M., Labarta, J.: A flexible and portable programming model for SMP and multi-cores. Technical report, Barcelona Supercomputing Center - Centro Nacional de Supercomputacio\u0144, June 2007"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Quintana-Ort\u00ed, E.S., Quintana-Ort\u00ed, G., van de Geijn, R.A., Van Zee, F.G., Chan, E.: Programming matrix algorithms-by-blocks for thread-level parallelism. ACM Trans. Math. Softw. 36(3) (2009). https:\/\/doi.org\/10.1145\/1527286.1527288","DOI":"10.1145\/1527286.1527288"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Song, F., YarKhan, A., Dongarra, J.: Dynamic task scheduling for linear algebra algorithms on distributed-memory multicore systems. In: SC 2009 (2009). https:\/\/doi.org\/10.1145\/1654059.1654079","DOI":"10.1145\/1654059.1654079"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,18]],"date-time":"2024-08-18T00:03:04Z","timestamp":1723939384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57675-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030576745","9783030576752"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57675-2_9","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"}]}}