{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:25Z","timestamp":1740099625104,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030432287"},{"type":"electronic","value":"9783030432294"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43229-4_8","type":"book-chapter","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:03:53Z","timestamp":1584576233000},"page":"82-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust Task-Parallel Solution of the Triangular Sylvester Equation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8444-6303","authenticated-orcid":false,"given":"Angelika","family":"Schwarz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9158-1941","authenticated-orcid":false,"given":"Carl Christian","family":"Kjelgaard Mikkelsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"issue":"9","key":"8_CR1","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1145\/361573.361582","volume":"15","author":"RH Bartels","year":"1972","unstructured":"Bartels, R.H., Stewart, G.W.: Solution of the matrix equation $$AX+XB=C$$. Commun. ACM 15(9), 820\u2013826 (1972)","journal-title":"Commun. ACM"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.parco.2008.10.002","volume":"35","author":"A Buttari","year":"2009","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)","journal-title":"Parallel Comput."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Chan, E., Van Zee, F.G., Bientinesi, P., Quintana-Orti, E.S., Quintana-Orti, G., Van de Geijn, R.: Supermatrix: a multithreaded runtime scheduling system for algorithms-by-blocks. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel programming, pp. 123\u2013132. ACM (2008)","DOI":"10.1145\/1345206.1345227"},{"issue":"8","key":"8_CR4","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/j.jpdc.2004.05.001","volume":"64","author":"M Cosnard","year":"2004","unstructured":"Cosnard, M., Jeannot, E., Yang, T.: Compact DAG representation and its symbolic scheduling. J. Parallel Distrib. Comput. 64(8), 921\u2013935 (2004)","journal-title":"J. Parallel Distrib. Comput."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Drebes, A., Pop, A., Heydemann, K., Cohen, A., Drach, N.: Scalable task parallelism for NUMA: a uniform abstraction for coordinated scheduling and memory management. In: International Conference on Parallel Architecture and Compilation Techniques, pp. 125\u2013137. IEEE (2016)","DOI":"10.1145\/2967938.2967946"},{"key":"8_CR6","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. John Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"8_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia (2002)","edition":"2"},{"issue":"4","key":"8_CR8","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1145\/592843.592845","volume":"28","author":"I Jonsson","year":"2002","unstructured":"Jonsson, I., K\u00e5gstr\u00f6m, B.: Recursive blocked algorithms for solving triangular systems - Part I: one-sided and coupled Sylvester-type matrix equations. ACM TOMS 28(4), 392\u2013415 (2002)","journal-title":"ACM TOMS"},{"key":"8_CR9","unstructured":"Mikkelsen, C.C.K., Karlsson, L.: Robust solution of triangular linear systems. In: NLAFET Working Note 9 (2017)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-78024-5_7","volume-title":"Parallel Processing and Applied Mathematics","author":"CC Kjelgaard Mikkelsen","year":"2018","unstructured":"Kjelgaard Mikkelsen, C.C., Karlsson, L.: Blocked algorithms for robust solution of triangular linear systems. In: Wyrzykowski, R., Dongarra, J., Deelman, E., Karczewski, K. (eds.) PPAM 2017. LNCS, vol. 10777, pp. 68\u201378. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-78024-5_7"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Perez, J.M., Badia, R.M., Labarta, J.: A dependency-aware task-based programming environment for multi-core architectures. In: 2008 IEEE International Conference on Cluster Computing, pp. 142\u2013151. IEEE (2008)","DOI":"10.1109\/CLUSTR.2008.4663765"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/779359.779365","volume":"29","author":"ES Quintana-Ort\u00ed","year":"2003","unstructured":"Quintana-Ort\u00ed, E.S., Van De Geijn, R.A.: Formal derivation of algorithms: the triangular Sylvester equation. ACM TOMS 29(2), 218\u2013243 (2003)","journal-title":"ACM TOMS"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1137\/130912839","volume":"58","author":"V Simoncini","year":"2016","unstructured":"Simoncini, V.: Computational methods for linear matrix equations. SIAM Rev. 58(3), 377\u2013441 (2016)","journal-title":"SIAM Rev."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Van Zee, F.G.: libflame: The Complete Reference (version 5.1.0-56) (2009)","DOI":"10.1109\/MCSE.2009.207"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43229-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:08:10Z","timestamp":1584576490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43229-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030432287","9783030432294"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43229-4_8","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":"19 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ppam.pl\/","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":"161","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":"91","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":"57% - 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":"3","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)"}}]}}