{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/autophase-compiler-phase-ordering-for-high","title":"AutoPhase: Compiler Phase-Ordering for High Level Synthesis with Deep Reinforcement Learning","arxiv_id":"1901.04615","date":"2019-01-15","proceeding":null,"authors":["Ameer Haj-Ali","Qijing Huang","William Moses","John Xiang","Ion Stoica","Krste Asanovic","John Wawrzynek"],"abstract":"The performance of the code generated by a compiler depends on the order in\nwhich the optimization passes are applied. In high-level synthesis, the quality\nof the generated circuit relates directly to the code generated by the\nfront-end compiler. Choosing a good order--often referred to as the\nphase-ordering problem--is an NP-hard problem. In this paper, we evaluate a new\ntechnique to address the phase-ordering problem: deep reinforcement learning.\nWe implement a framework in the context of the LLVM compiler to optimize the\nordering for HLS programs and compare the performance of deep reinforcement\nlearning to state-of-the-art algorithms that address the phase-ordering\nproblem. Overall, our framework runs one to two orders of magnitude faster than\nthese algorithms, and achieves a 16% improvement in circuit performance over\nthe -O3 compiler flag.","url_abs":"http://arxiv.org/abs/1901.04615v2","url_pdf":"http://arxiv.org/pdf/1901.04615v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"autophase-compiler-phase-ordering-for-high","repo_url":"https://github.com/ucb-bar/autophase","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"BSD-3-Clause"}}],"tasks":[{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"high-level-synthesis","task_name":"High-Level Synthesis"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"ucb-bar/autophase","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2003.00671"],"harvested_for_calls":[{"arxiv_id":"2003.00671","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.00671"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.00671\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ecb92d563777513bca116d9099810878c3a9bc917ef23756b404b2ead694d85e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}