| Publication Type |
technical report |
| School or College |
College of Engineering |
| Department |
Computing, School of |
| Program |
Advanced Research Projects Agency |
| Creator |
Gopalakrishnan, Ganesh |
| Other Author |
Kudva, Prabhakar |
| Title |
Peephole optimization of asynchronous networks through process composition and burst-mode machine generation |
| Date |
1993 |
| Description |
In this paper we discuss the problem of improving the e ciency of macromodule networks generated through asynchronous high level synthesis We compose the behaviors of the modules in the sub network being optimized using Dill s trace theoretic operators to get a single behavioral description for the whole sub network From the composite trace structures so obtained?? we obtain interface state graphs ISG as described by Sutherland?? Sproull?? and Molnar ?? encode the ISGs to obtain encoded ISGs EISGs ?? and then apply a procedure we have developed called Burst mode machine reduction BM reduction to obtain burst mode machines from EISGs We then synthesize burst mode machine circuits currently using the tool of Ken Yun Stanford We can report signi cant area and time improvements on a number of examples?? as a result of our optimization method |
| Type |
Text |
| Publisher |
University of Utah |
| Subject |
Macromodule networks; Peephole; Asynchronous networks |
| Subject LCSH |
Asynchronous circuits |
| Language |
eng |
| Bibliographic Citation |
Gopalakrishnan, G., & Kudva, P. (1993). Peephole optimization of asynchronous networks through process composition and burst-mode machine generation. UUCS-93-20. |
| Series |
University of Utah Computer Science Technical Report |
| Rights Management |
©University of Utah |
| Format Medium |
application/pdf |
| Format Extent |
305,123 bytes |
| Source |
University of Utah School of Computing |
| ARK |
ark:/87278/s6ww82ds |
| Setname |
ir_uspace |
| ID |
707302 |
| Reference URL |
https://collections.lib.utah.edu/ark:/87278/s6ww82ds |
