{"id":"https://openalex.org/W4417403187","doi":"https://doi.org/10.1109/pact65351.2025.00048","title":"Poster: HeteroSched: Co-Optimizing Scheduling and Parallelization for Deep Learning Workloads","display_name":"Poster: HeteroSched: Co-Optimizing Scheduling and Parallelization for Deep Learning Workloads","publication_year":2025,"publication_date":"2025-11-03","ids":{"openalex":"https://openalex.org/W4417403187","doi":"https://doi.org/10.1109/pact65351.2025.00048"},"language":null,"primary_location":{"id":"doi:10.1109/pact65351.2025.00048","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pact65351.2025.00048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 34th International Conference on Parallel Architectures and Compilation Techniques (PACT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120421435","display_name":"Bahram Afsharmanesh","orcid":null},"institutions":[{"id":"https://openalex.org/I165733156","display_name":"University of Georgia","ror":"https://ror.org/00te3t702","country_code":"US","type":"education","lineage":["https://openalex.org/I165733156"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bahram Afsharmanesh","raw_affiliation_strings":["University of Georgia,Athens,USA"],"affiliations":[{"raw_affiliation_string":"University of Georgia,Athens,USA","institution_ids":["https://openalex.org/I165733156"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5095848513","display_name":"Md Musfiqur Rahman Sanim","orcid":null},"institutions":[{"id":"https://openalex.org/I165733156","display_name":"University of Georgia","ror":"https://ror.org/00te3t702","country_code":"US","type":"education","lineage":["https://openalex.org/I165733156"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Md Musfiqur Rahman Sanim","raw_affiliation_strings":["University of Georgia,Athens,USA"],"affiliations":[{"raw_affiliation_string":"University of Georgia,Athens,USA","institution_ids":["https://openalex.org/I165733156"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120513700","display_name":"AmirAli Mirian","orcid":null},"institutions":[{"id":"https://openalex.org/I165733156","display_name":"University of Georgia","ror":"https://ror.org/00te3t702","country_code":"US","type":"education","lineage":["https://openalex.org/I165733156"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"AmirAli Mirian","raw_affiliation_strings":["University of Georgia,Athens,USA"],"affiliations":[{"raw_affiliation_string":"University of Georgia,Athens,USA","institution_ids":["https://openalex.org/I165733156"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014913714","display_name":"Gagan Agrawal","orcid":"https://orcid.org/0000-0002-2609-1428"},"institutions":[{"id":"https://openalex.org/I165733156","display_name":"University of Georgia","ror":"https://ror.org/00te3t702","country_code":"US","type":"education","lineage":["https://openalex.org/I165733156"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gagan Agrawal","raw_affiliation_strings":["University of Georgia,Athens,USA"],"affiliations":[{"raw_affiliation_string":"University of Georgia,Athens,USA","institution_ids":["https://openalex.org/I165733156"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5120421435"],"corresponding_institution_ids":["https://openalex.org/I165733156"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.54347364,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"461","last_page":"463"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.3928000032901764,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.3928000032901764,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.19210000336170197,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.17560000717639923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.697700023651123},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6284999847412109},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.5932999849319458},{"id":"https://openalex.org/keywords/deep-learning","display_name":"Deep learning","score":0.45890000462532043},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4514000117778778},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.43790000677108765},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.43470001220703125},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4172999858856201},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.3968000113964081}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8443999886512756},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.697700023651123},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6284999847412109},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.5932999849319458},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4668000042438507},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.45890000462532043},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4514000117778778},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44909998774528503},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.43790000677108765},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.43470001220703125},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.42980000376701355},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4172999858856201},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.3968000113964081},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3813999891281128},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.3472000062465668},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.33550000190734863},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.32019999623298645},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.30090001225471497},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.2906000018119812},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C164833996","wikidata":"https://www.wikidata.org/wiki/Q2323839","display_name":"Automatic parallelization","level":3,"score":0.27410000562667847},{"id":"https://openalex.org/C112866106","wikidata":"https://www.wikidata.org/wiki/Q267053","display_name":"Lottery scheduling","level":5,"score":0.2632000148296356},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.2630000114440918},{"id":"https://openalex.org/C201515029","wikidata":"https://www.wikidata.org/wiki/Q5520966","display_name":"Gang scheduling","level":5,"score":0.2590999901294708},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.2513999938964844},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pact65351.2025.00048","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pact65351.2025.00048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 34th International Conference on Parallel Architectures and Compilation Techniques (PACT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2969388332","https://openalex.org/W3204998121","https://openalex.org/W4318541537","https://openalex.org/W4320067933","https://openalex.org/W4387321109","https://openalex.org/W4400410044"],"related_works":[],"abstract_inverted_index":{"As":[0],"Deep":[1],"Learning":[2],"(DL)":[3],"training":[4],"has":[5,17,35],"emerged":[6],"as":[7,103],"a":[8,80,104],"dominant":[9],"workload":[10],"on":[11],"clusters":[12],"in":[13,21,49],"recent":[14],"years,":[15],"there":[16],"been":[18],"significant":[19],"interest":[20],"parallelizing":[22],"individual":[23],"models":[24],"and":[25,63,68,89,118],"scheduling":[26,64,105],"them":[27],"efficiently.":[28],"However,":[29],"to":[30,40,78,90,122],"date,":[31],"no":[32],"prior":[33,113],"work":[34,76],"taken":[36],"an":[37],"integrated":[38,59],"approach":[39],"addressing":[41],"both":[42,66],"problems":[43],"while":[44],"simultaneously":[45],"accounting":[46],"for":[47,86,95],"heterogeneity":[48],"the":[50,58],"execution":[51],"environment.":[52],"This":[53],"paper":[54],"introduces,":[55],"demonstrating":[56],"that":[57],"optimization":[60],"of":[61,74,82],"parallelization":[62,93],"is":[65,77,100],"feasible":[67],"highly":[69],"effective.":[70],"The":[71],"main":[72],"insight":[73],"our":[75],"generate":[79],"set":[81],"possible":[83],"target":[84],"resources":[85],"each":[87],"job":[88],"develop":[91],"corresponding":[92],"strategies":[94],"each.":[96],"Each":[97],"jobstrategy":[98],"pair":[99],"then":[101],"treated":[102],"candidate.":[106],"Scheduling":[107],"decisions":[108],"are":[109],"made":[110],"by":[111],"extending":[112],"Linear":[114],"Programming":[115],"(LP)based":[116],"formulations":[117],"incorporating":[119],"new":[120],"heuristics":[121],"reduce":[123],"decision":[124],"overhead.":[125]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-12-16T00:00:00"}
