{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:58:25Z","timestamp":1743029905198,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031312083"},{"type":"electronic","value":"9783031312090"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-31209-0_12","type":"book-chapter","created":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T15:11:26Z","timestamp":1682953886000},"page":"158-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mapping Tree-Shaped Workflows on\u00a0Memory-Heterogeneous Architectures"],"prefix":"10.1007","author":[{"given":"Svetlana","family":"Kulagina","sequence":"first","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]},{"given":"Anne","family":"Benoit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,2]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3325097","volume":"52","author":"M Adhikari","year":"2019","unstructured":"Adhikari, M., Amgoth, T., Srirama, S.N.: A survey on scheduling strategies for workflows in cloud environment and emerging trends. ACM Comput. Surv. 52(4), 1\u201336 (2019)","journal-title":"ACM Comput. Surv."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-1-4939-2092-1_2","volume-title":"Handbook on Data Centers","author":"G Aupy","year":"2015","unstructured":"Aupy, G., Benoit, A., Renaud-Goud, P., Robert, Y.: Energy-aware algorithms for task graph scheduling, replica placement and checkpoint strategies. In: Khan, S.U., Zomaya, A.Y. (eds.) Handbook on Data Centers, pp. 37\u201380. Springer, New York (2015). https:\/\/doi.org\/10.1007\/978-1-4939-2092-1_2"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Benoit, A., Le Fevre, V., Perotin, L., Raghavan, P., Robert, Y., Sun, H.: Resilient scheduling of moldable parallel jobs to cope with silent errors. IEEE Trans. Comput. 71, 1696\u20131710 (2021)","DOI":"10.1109\/TC.2021.3104747"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TC.2009.117","volume":"59","author":"A Benoit","year":"2009","unstructured":"Benoit, A., Marchal, L., Pineau, J.F., Robert, Y., Vivien, F.: Scheduling concurrent bag-of-tasks applications on heterogeneous platforms. IEEE Trans. Comput. 59(2), 202\u2013217 (2009)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Benoit, A., Rehn-Sonigo, V., Robert, Y.: Multi-criteria scheduling of pipeline workflows. In: 2007 IEEE International Conference on Cluster Computing, pp. 515\u2013524. IEEE (2007)","DOI":"10.1109\/CLUSTR.2007.4629278"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-49487-6_4","volume-title":"Algorithm Engineering","author":"A Bulu\u00e7","year":"2016","unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 117\u2013158. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49487-6_4"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Davis, T.A.: Direct methods for sparse linear systems. In: Fundamentals of Algorithms. Society for Industrial and Applied Mathematics, Philadelphia (2006)","DOI":"10.1137\/1.9780898718881"},{"issue":"2","key":"12_CR8","first-page":"13","volume":"2","author":"L Eyraud-Dubois","year":"2015","unstructured":"Eyraud-Dubois, L., Marchal, L., Sinnen, O., Vivien, F.: Parallel scheduling of task trees with limited memory. ACM Trans. on Par. Comput. 2(2), 13 (2015)","journal-title":"ACM Trans. on Par. Comput."},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/s00453-013-9802-3","volume":"71","author":"AE Feldmann","year":"2015","unstructured":"Feldmann, A.E., Foschini, L.: Balanced partitions of trees and applications. Algorithmica 71(2), 354\u2013376 (2015)","journal-title":"Algorithmica"},{"issue":"7","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1109\/TPDS.2020.2971200","volume":"31","author":"C Gou","year":"2020","unstructured":"Gou, C., Benoit, A., Marchal, L.: Partitioning tree-shaped task graphs for distributed platforms with limited memory. IEEE Trans. Par Distrib. Syst. 31(7), 1533\u20131544 (2020)","journal-title":"IEEE Trans. Par Distrib. Syst."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"He, S., Wu, J., Wei, B., Wu, J.: Task tree partition and subtree allocation for heterogeneous multiprocessors. In: 2021 IEEE International Conference on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking(ISPA\/BDCloud\/SocialCom\/SustainCom), pp. 571\u2013577 (2021)","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00084"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Herrmann, J., Kho, J., U\u00e7ar, B., Kaya, K., \u00c7ataly\u00fcrek, \u00dc.V.: Acyclic partitioning of large directed acyclic graphs. In: 2017 17th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), pp. 371\u2013380. IEEE (2017)","DOI":"10.1109\/CCGRID.2017.101"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Jacquelin, M., Marchal, L., Robert, Y., U\u00e7ar, B.: On optimal tree traversals for sparse matrix factorization. In: 2011 IEEE International Parallel & Distributed Processing Symposium, pp. 556\u2013567. IEEE (2011)","DOI":"10.1109\/IPDPS.2011.60"},{"key":"12_CR14","unstructured":"Kulagina, S., Meyerhenke, H., Benoit, A.: Mapping tree-shaped workflows on memory-heterogeneous architectures. Research report 9458, Inria (2022). https:\/\/hal.inria.fr\/hal-03581418"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cl.2010.09.003","volume":"37","author":"C Lam","year":"2011","unstructured":"Lam, C., Rauber, T., Baumgartner, G., Cociorva, D., Sadayappan, P.: Memory-optimal evaluation of expression trees involving large objects. Comput. Lang. Syst. Struct. 37(2), 63\u201375 (2011). https:\/\/doi.org\/10.1016\/j.cl.2010.09.003","journal-title":"Comput. Lang. Syst. Struct."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Liu, J., Pacitti, E., Valduriez, P.: A survey of scheduling frameworks in big data systems. Int. J. Cloud Comput. 7 (2018)","DOI":"10.1504\/IJCC.2018.10014859"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"JWH Liu","year":"1990","unstructured":"Liu, J.W.H.: The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 11(1), 134\u2013172 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2022: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-31209-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T14:51:52Z","timestamp":1729349512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-31209-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031312083","9783031312090"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-31209-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"2 May 2023","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":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.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":"102","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":"25","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":"3-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":"4","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":"For the workshops, 24 papers have been accepted from a total of 35 submissions.","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)"}}]}}