{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:08:08Z","timestamp":1755907688931,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3659972","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"463-474","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Multi-Processor Scheduling in Increasingly Realistic Models"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6667-802X","authenticated-orcid":false,"given":"P\u00e1l Andr\u00e1s","family":"Papp","sequence":"first","affiliation":[{"name":"Computing Systems Lab, Huawei Zurich Research Center, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5730-5812","authenticated-orcid":false,"given":"Georg","family":"Anegg","sequence":"additional","affiliation":[{"name":"Computing Systems Lab, Huawei Zurich Research Center, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6152-863X","authenticated-orcid":false,"given":"Aikaterini","family":"Karanasiou","sequence":"additional","affiliation":[{"name":"Computing Systems Lab, Huawei Zurich Research Center, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8842-3689","authenticated-orcid":false,"given":"Albert-Jan N.","family":"Yzelman","sequence":"additional","affiliation":[{"name":"Computing Systems Lab, Huawei Zurich Research Center, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2024. Supplementary material. The scheduling algorithm implementations used in our experiments our computational DAG database and the data from our experiments are available at: https:\/\/github.com\/Algebraic-Programming\/ Artifacts\/tree\/master\/SPAA_2024_Efficient_Multi-Processor_Scheduling."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/361604.361619"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.722221"},{"volume-title":"Parallel Scientific Computation: A Structured Approach Using BSP","author":"Bisseling Rob H","key":"e_1_3_2_1_4_1","unstructured":"Rob H Bisseling. 2020. Parallel Scientific Computation: A Structured Approach Using BSP. Oxford University Press, USA."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/155332.155333"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"John Forrest and Robin Lougee-Heimer. 2005. CBC user guide. In Emerging theory methods and applications. INFORMS 257--277.","DOI":"10.1287\/educ.1053.0020"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.1998.738003"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612699"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(98)00093-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90024-8"},{"key":"e_1_3_2_1_12_1","volume-title":"Scheduling precedence graphs in systems with interprocessor communication times. siam journal on computing 18, 2","author":"Hwang Jing-Jang","year":"1989","unstructured":"Jing-Jang Hwang, Yuan-Chieh Chow, Frank D Anger, and Chung-Yee Lee. 1989. Scheduling precedence graphs in systems with interprocessor communication times. siam journal on computing 18, 2 (1989), 244--257."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2526682"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1997.597203"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 2770--2789","author":"Kulkarni Janardhan","year":"2020","unstructured":"Janardhan Kulkarni, Shi Li, Jakub Tarnawski, and Minwei Ye. 2020. Hierarchybased algorithms for minimizing makespan under precedence and communication constraints. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 2770--2789."},{"key":"e_1_3_2_1_16_1","volume-title":"Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors","author":"Kwok Yu-Kwong","year":"1996","unstructured":"Yu-Kwong Kwok and Ishfaq Ahmad. 1996. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE transactions on parallel and distributed systems 7, 5 (1996), 506--521."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.22"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2.4.346"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897532"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.178"},{"key":"e_1_3_2_1_21_1","volume-title":"Scheduling with Communication Delay in Near-Linear Time. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS).","author":"Liu Quanquan C","year":"2022","unstructured":"Quanquan C Liu, Manish Purohit, Zoya Svitkina, Erik Vee, and Joshua R Wang. 2022. Scheduling with Communication Delay in Near-Linear Time. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS)."},{"key":"e_1_3_2_1_22_1","volume-title":"Mathematics, Models and Architectures. Mathematics for Future Computing and Communications","author":"McColl Bill","year":"2021","unstructured":"Bill McColl. 2021. Mathematics, Models and Architectures. Mathematics for Future Computing and Communications (2021), 6."},{"key":"e_1_3_2_1_23_1","volume-title":"Scalable computing. Computer Science Today","author":"McColl William F","year":"1995","unstructured":"William F McColl. 1995. Scalable computing. Computer Science Today (1995), 46--61."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008264"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDCAT.2003.1236372"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00026"},{"key":"e_1_3_2_1_27_1","unstructured":"P\u00e1l Andr\u00e1s Papp Georg Anegg Aikaterini Karanasiou and A. N. Yzelman. 2024. Efficient Multi-Processor Scheduling in Increasingly Realistic Models. arXiv preprint arXiv:2404.15246."},{"key":"e_1_3_2_1_28_1","volume-title":"DAG Scheduling in the BSP Model. arXiv preprint arXiv:2303.05989","author":"Papp P\u00e1l Andr\u00e1s","year":"2023","unstructured":"P\u00e1l Andr\u00e1s Papp, Georg Anegg, and AN Yzelman. 2023. DAG Scheduling in the BSP Model. arXiv preprint arXiv:2303.05989 (2023)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591087"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00063-J"},{"key":"e_1_3_2_1_31_1","volume-title":"Multilevel Acyclic Hypergraph Partitioning. In 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, 1--15","author":"Popp Merten","year":"2021","unstructured":"Merten Popp, Sebastian Schlag, Christian Schulz, and Daniel Seemaier. 2021. Multilevel Acyclic Hypergraph Partitioning. In 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, 1--15."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2002.1011417"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974317.5"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1155\/1997\/532130"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806791"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.993206"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.11.002"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80008-0"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.06.012"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2808959"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.308533"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1843"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/2630180.2630185"},{"key":"e_1_3_2_1_45_1","volume-title":"A C GraphBLAS: specification, implementation, parallelisation, and evaluation. arXiv preprint arXiv:1906.03196","author":"Yzelman AN","year":"2020","unstructured":"AN Yzelman, D Di Nardo, JM Nash, and WJ Suijlen. 2020. A C GraphBLAS: specification, implementation, parallelisation, and evaluation. arXiv preprint arXiv:1906.03196 (2020)."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00121"}],"event":{"name":"SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Nantes France","acronym":"SPAA '24"},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659972","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3659972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:24:10Z","timestamp":1755879850000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":46,"alternative-id":["10.1145\/3626183.3659972","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3659972","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}