There and Back Again: A Netlist's Tale with Much Egraphin'
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910393334497280 |
|---|---|
| author | Smith, Gus Henry Sisco, Zachary D. Techaumnuaiwit, Thanawat Xia, Jingtao Canumalla, Vishal Cheung, Andrew Tatlock, Zachary Nandi, Chandrakana Balkind, Jonathan |
| author_facet | Smith, Gus Henry Sisco, Zachary D. Techaumnuaiwit, Thanawat Xia, Jingtao Canumalla, Vishal Cheung, Andrew Tatlock, Zachary Nandi, Chandrakana Balkind, Jonathan |
| contents | EDA toolchains are notoriously unpredictable, incomplete, and error-prone; the generally-accepted remedy has been to re-imagine EDA tasks as compilation problems. However, any compiler framework we apply must be prepared to handle the wide range of EDA tasks, including not only compilation tasks like technology mapping and optimization (the "there"} in our title), but also decompilation tasks like loop rerolling (the "back again"). In this paper, we advocate for equality saturation -- a term rewriting framework -- as the framework of choice when building hardware toolchains. Through a series of case studies, we show how the needs of EDA tasks line up conspicuously well with the features equality saturation provides. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_00786 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | There and Back Again: A Netlist's Tale with Much Egraphin' Smith, Gus Henry Sisco, Zachary D. Techaumnuaiwit, Thanawat Xia, Jingtao Canumalla, Vishal Cheung, Andrew Tatlock, Zachary Nandi, Chandrakana Balkind, Jonathan Hardware Architecture Programming Languages EDA toolchains are notoriously unpredictable, incomplete, and error-prone; the generally-accepted remedy has been to re-imagine EDA tasks as compilation problems. However, any compiler framework we apply must be prepared to handle the wide range of EDA tasks, including not only compilation tasks like technology mapping and optimization (the "there"} in our title), but also decompilation tasks like loop rerolling (the "back again"). In this paper, we advocate for equality saturation -- a term rewriting framework -- as the framework of choice when building hardware toolchains. Through a series of case studies, we show how the needs of EDA tasks line up conspicuously well with the features equality saturation provides. |
| title | There and Back Again: A Netlist's Tale with Much Egraphin' |
| topic | Hardware Architecture Programming Languages |
| url | https://arxiv.org/abs/2404.00786 |