{"id":"https://openalex.org/W4414880253","doi":"https://doi.org/10.1145/3754598.3754676","title":"Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions","display_name":"Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions","publication_year":2025,"publication_date":"2025-09-08","ids":{"openalex":"https://openalex.org/W4414880253","doi":"https://doi.org/10.1145/3754598.3754676"},"language":"en","primary_location":{"id":"doi:10.1145/3754598.3754676","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3754598.3754676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th International Conference on Parallel Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2507.17411","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051660284","display_name":"P\u00e1l Andr\u00e1s Papp","orcid":"https://orcid.org/0009-0005-6667-802X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"P\u00e1l Andr\u00e1s Papp","raw_affiliation_strings":["Computing Systems Lab, Huawei Zurich Research Center, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0009-0005-6667-802X","affiliations":[{"raw_affiliation_string":"Computing Systems Lab, Huawei Zurich Research Center, Zurich, Switzerland","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053539768","display_name":"Toni B\u00f6hnlein","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Toni B\u00f6hnlein","raw_affiliation_strings":["Computing Systems Lab, Huawei Zurich Research Center, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0009-0001-2152-022X","affiliations":[{"raw_affiliation_string":"Computing Systems Lab, Huawei Zurich Research Center, Zurich, Switzerland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012014394","display_name":"Albert-Jan N. Yzelman","orcid":"https://orcid.org/0000-0001-8842-3689"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Albert-Jan N. Yzelman","raw_affiliation_strings":["Computing Systems Lab, Huawei Zurich Research Center, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0001-8842-3689","affiliations":[{"raw_affiliation_string":"Computing Systems Lab, Huawei Zurich Research Center, Zurich, Switzerland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051660284"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.37103439,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"238","last_page":"247"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9524000287055969,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9429000020027161,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6079999804496765},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5892000198364258},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5307000279426575},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.435699999332428},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4203999936580658},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4142000079154968},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.3634999990463257},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.362199991941452}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8083000183105469},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6643999814987183},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6079999804496765},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5892000198364258},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5307000279426575},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.435699999332428},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4203999936580658},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4142000079154968},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3634999990463257},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.362199991941452},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.3391000032424927},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33640000224113464},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.322299987077713},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.3059000074863434},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.29660001397132874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2935999929904938},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2912999987602234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.289000004529953},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.28780001401901245},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.26829999685287476},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.2648000121116638},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3754598.3754676","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3754598.3754676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th International Conference on Parallel Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2507.17411","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.17411","pdf_url":"https://arxiv.org/pdf/2507.17411","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2507.17411","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.17411","pdf_url":"https://arxiv.org/pdf/2507.17411","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,46,64],"study":[1],"the":[2,29,49,91],"problem":[3,54],"of":[4,24,52],"scheduling":[5],"a":[6,14,21,56,82,86],"general":[7],"computational":[8,62],"DAG":[9],"on":[10],"multiple":[11],"processors":[12],"in":[13,28,76,81],"2-level":[15],"memory":[16,71],"hierarchy.":[17],"This":[18],"setting":[19],"is":[20,85],"natural":[22],"generalization":[23],"several":[25],"prominent":[26],"models":[27],"literature,":[30],"and":[31,38,70],"it":[32],"simultaneously":[33],"captures":[34],"workload":[35],"balancing,":[36],"communication,":[37],"data":[39],"movement":[40],"due":[41],"to":[42],"cache":[43],"size":[44],"limitations.":[45],"first":[47],"analyze":[48],"fundamental":[50],"properties":[51],"this":[53],"from":[55,90],"theoretical":[57],"perspective,":[58],"such":[59],"as":[60,74],"its":[61],"complexity.":[63],"also":[65],"prove":[66],"that":[67,84],"optimizing":[68],"parallelization":[69],"management":[72],"separately,":[73],"done":[75],"many":[77],"applications,":[78],"can":[79],"result":[80],"solution":[83],"linear":[87],"factor":[88],"away":[89],"optimum.":[92]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}