DocumentCode
3079401
Title
Counterexample-guided SMT-driven optimal buffer sizing
Author
Brady, Bryan A. ; Holcomb, Daniel ; Seshia, Sanjit A.
Author_Institution
EECS Dept., UC Berkeley, Berkeley, CA, USA
fYear
2011
fDate
14-18 March 2011
Firstpage
1
Lastpage
6
Abstract
The quality of network-on-chip (NoC) designs depends crucially on the size of buffers in NoC components. While buffers impose a significant area and power overhead, they are essential for ensuring high throughput and low latency. In this paper, we present a new approach for minimizing the cumulative buffer size in on-chip networks, so as to meet throughput and latency requirements, given high-level specifications on traffic behavior. Our approach uses model checking based on satisfiability modulo theories (SMT) solvers, within an overall counterexample-guided synthesis loop. We demonstrate the effectiveness of our technique on NoC designs involving arbitration, credit logic, and virtual channels.
Keywords
buffer storage; computability; network-on-chip; NoC components; counterexample-guided SMT-driven optimal buffer sizing; counterexample-guided synthesis loop; cumulative buffer size; network-on-chip designs; on-chip networks; satisfiability modulo theories; Adaptation model; Computational modeling; Minimization; Regulators; Silicon; System-on-a-chip; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Design, Automation & Test in Europe Conference & Exhibition (DATE), 2011
Conference_Location
Grenoble
ISSN
1530-1591
Print_ISBN
978-1-61284-208-0
Type
conf
DOI
10.1109/DATE.2011.5763058
Filename
5763058
Link To Document