{"id":"https://openalex.org/W4417403291","doi":"https://doi.org/10.1109/pact65351.2025.00027","title":"Agentic Auto-Scheduling: An Experimental Study of LLM-Guided Loop Optimization","display_name":"Agentic Auto-Scheduling: An Experimental Study of LLM-Guided Loop Optimization","publication_year":2025,"publication_date":"2025-11-03","ids":{"openalex":"https://openalex.org/W4417403291","doi":"https://doi.org/10.1109/pact65351.2025.00027"},"language":null,"primary_location":{"id":"doi:10.1109/pact65351.2025.00027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pact65351.2025.00027","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/A5022564453","display_name":"Massinissa Merouani","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Massinissa Merouani","raw_affiliation_strings":["New York University Abu Dhabi,Abu Dhabi,UAE"],"affiliations":[{"raw_affiliation_string":"New York University Abu Dhabi,Abu Dhabi,UAE","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120271478","display_name":"Islem Kara Bernou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Islem Kara Bernou","raw_affiliation_strings":["New York University Abu Dhabi,Abu Dhabi,UAE"],"affiliations":[{"raw_affiliation_string":"New York University Abu Dhabi,Abu Dhabi,UAE","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044704994","display_name":"Riyadh Baghdadi","orcid":"https://orcid.org/0000-0002-9350-3998"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Riyadh Baghdadi","raw_affiliation_strings":["New York University Abu Dhabi,Abu Dhabi,UAE"],"affiliations":[{"raw_affiliation_string":"New York University Abu Dhabi,Abu Dhabi,UAE","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022564453"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43418062,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"186","last_page":"200"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.6328999996185303,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.6328999996185303,"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"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.0738999992609024,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.040300000458955765,"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/compiler","display_name":"Compiler","score":0.6449999809265137},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6190999746322632},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5921000242233276},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.5565999746322632},{"id":"https://openalex.org/keywords/loop-optimization","display_name":"Loop optimization","score":0.5554999709129333},{"id":"https://openalex.org/keywords/feedback-loop","display_name":"Feedback loop","score":0.5199000239372253},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5098000168800354},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5094000101089478},{"id":"https://openalex.org/keywords/loop-unrolling","display_name":"Loop unrolling","score":0.4772999882698059}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7462000250816345},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6449999809265137},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6190999746322632},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5921000242233276},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.5565999746322632},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.5554999709129333},{"id":"https://openalex.org/C186886427","wikidata":"https://www.wikidata.org/wiki/Q5441213","display_name":"Feedback loop","level":2,"score":0.5199000239372253},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5098000168800354},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5094000101089478},{"id":"https://openalex.org/C76970557","wikidata":"https://www.wikidata.org/wiki/Q1869750","display_name":"Loop unrolling","level":3,"score":0.4772999882698059},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.47369998693466187},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.4652999937534332},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.40310001373291016},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.36160001158714294},{"id":"https://openalex.org/C82653869","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fusion","level":3,"score":0.36070001125335693},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3452000021934509},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.3382999897003174},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.31209999322891235},{"id":"https://openalex.org/C149672232","wikidata":"https://www.wikidata.org/wiki/Q337048","display_name":"Adaptive optimization","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2985000014305115},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.27810001373291016},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.25209999084472656},{"id":"https://openalex.org/C2781215313","wikidata":"https://www.wikidata.org/wiki/Q3493345","display_name":"SPARK (programming language)","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pact65351.2025.00027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pact65351.2025.00027","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":[{"id":"https://openalex.org/F4320313203","display_name":"New York University Abu Dhabi","ror":"https://ror.org/00e5k0821"},{"id":"https://openalex.org/F4320330069","display_name":"Tamkeen","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1988876604","https://openalex.org/W2007962166","https://openalex.org/W2010196134","https://openalex.org/W2077805988","https://openalex.org/W2100218206","https://openalex.org/W2102976251","https://openalex.org/W2146405378","https://openalex.org/W2152506070","https://openalex.org/W2898099374","https://openalex.org/W2949967139","https://openalex.org/W2961619211","https://openalex.org/W3151489216","https://openalex.org/W3164004581","https://openalex.org/W3198685994","https://openalex.org/W3207198460","https://openalex.org/W4231316372","https://openalex.org/W4235662649","https://openalex.org/W4246166885","https://openalex.org/W4407848466","https://openalex.org/W4417403182"],"related_works":[],"abstract_inverted_index":{"Automatic":[0],"code":[1,22,163,179],"optimization":[2,23,55,99,164],"remains":[3],"a":[4,18,33,37,59,68,73],"difficult":[5],"challenge,":[6],"particularly":[7],"for":[8,67,175],"complex":[9],"loop":[10,61,70],"nests":[11],"on":[12],"modern":[13],"hardware.":[14],"This":[15,152],"paper":[16],"investigates":[17],"novel":[19],"approach":[20],"to":[21,72,95],"where":[24,62],"Large":[25],"Language":[26],"Models":[27],"(LLMs)":[28],"guide":[29,161],"the":[30,78,105,110,133,142,162],"process":[31,165],"through":[32],"closed-loop":[34],"interaction":[35],"with":[36],"compiler.":[38,74],"We":[39],"present":[40],"Compilot,":[41],"an":[42,63],"experimental":[43,153],"framework":[44],"that":[45,156],"leverages":[46],"off-theshelf":[47],"LLMs,":[48],"without":[49],"any":[50],"task-specific":[51],"fine-tuning,":[52],"as":[53],"interactive":[54],"agents.":[56],"ComPilot":[57,116,137],"establishes":[58],"feedback":[60,94],"LLM":[64,90],"proposes":[65],"transformations":[66],"given":[69],"nest":[71],"The":[75,89],"compiler":[76,169],"attempts":[77],"transformations,":[79],"reporting":[80],"back":[81],"legality":[82],"status":[83],"and":[84,126],"measured":[85],"speedup":[86],"or":[87],"slowdown.":[88],"utilizes":[91],"this":[92,113],"concrete":[93],"iteratively":[96],"refine":[97],"its":[98],"strategy.":[100],"Our":[101],"extensive":[102],"evaluation":[103],"across":[104],"PolyBench":[106],"benchmark":[107],"suite":[108],"demonstrates":[109,138,155],"effectiveness":[111],"of":[112,121],"zero-shot":[114],"approach.":[115],"achieves":[117],"geometric":[118],"mean":[119],"speedups":[120],"$2.66":[122],"x$":[123,128],"(single":[124],"run)":[125],"$3.54":[127],"(best-of-":[129],"5":[130],"runs)":[131],"over":[132],"original":[134],"code.":[135],"Furthermore,":[136],"competitive":[139],"performance":[140],"against":[141],"state-of-the-art":[143],"Pluto":[144],"polyhedral":[145],"optimizer,":[146],"outperforming":[147],"it":[148],"in":[149,178],"many":[150],"cases.":[151],"study":[154],"general-purpose":[157],"LLMs":[158],"can":[159],"effectively":[160],"when":[166],"grounded":[167],"by":[168],"feedback,":[170],"opening":[171],"promising":[172],"research":[173],"directions":[174],"agentic":[176],"AI":[177],"optimization.":[180]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-12-16T00:00:00"}