Abstraction-Based Performance Analysis of NoCs

Wepresentanapproachtoformallyanalyzequality-of-service(QoS) properties of network-on-chip (NoC) designs. To tackle industrialscale designs, we adopt an abstraction-based approach, where only the nodes of interest in the network are precisely modeled and the rest of the network is abstracted away as sources and sinks of traffic. We give an automatic technique to infer a traffic model, comprising formal models of sources and sinks, from simulation traces derived from software benchmarks. Experimental results demonstrate that the inferred models generalize well and that our abstraction-based approach can accurately verify industrial-scale NoC designs.

[1]  Radu Marculescu,et al.  Traffic analysis for on-chip networks design of multimedia applications , 2002, DAC '02.

[2]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[3]  Brigitte Plateau,et al.  Stochastic Automata Network For Modeling Parallel Systems , 1991, IEEE Trans. Software Eng..

[4]  Ümit Y. Ogras,et al.  Quick formal modeling of communication fabrics to enable verification , 2010, 2010 IEEE International High Level Design Validation and Test Workshop (HLDVT).

[5]  Mary K. Vernon,et al.  Performance Analysis of Mesh Interconnection Networks with Deterministic Routing , 1994, IEEE Trans. Parallel Distributed Syst..

[6]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[7]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[8]  Michael Kishinevsky,et al.  Automatic generation of inductive invariants from high-level microarchitectural models of communication fabrics , 2012, Formal Methods Syst. Des..

[9]  Andrew B. Kahng,et al.  Trace-driven optimization of networks-on-chip configurations , 2010, Design Automation Conference.

[10]  Alberto L. Sangiovanni-Vincentelli,et al.  Theory of latency-insensitive design , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  E.A. Lee,et al.  Synchronous data flow , 1987, Proceedings of the IEEE.

[12]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[13]  Cesare Tinelli,et al.  Satisfiability Modulo Theories , 2021, Handbook of Satisfiability.

[14]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[15]  Twan Basten,et al.  Task-level timing models for guaranteed performance in multiprocessor networks-on-chip , 2003, CASES '03.

[16]  Jean-Yves Le Boudec,et al.  "Pay bursts only once" does not hold for non-FIFO guaranteed rate nodes , 2005, Perform. Evaluation.

[17]  Sanjit A. Seshia,et al.  Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions , 2002, CAV.

[18]  Radu Marculescu,et al.  Computation and communication refinement for multiprocessor SoC design: A system-level perspective , 2006, ACM Trans. Design Autom. Electr. Syst..

[19]  Allan Borodin,et al.  Adversarial queuing theory , 2001, JACM.

[20]  Li-Shiuan Peh,et al.  Flow control and micro-architectural mechanisms for extending the performance of interconnection networks , 2001 .

[21]  Li-Shiuan Peh,et al.  A Statistical Traffic Model for On-Chip Interconnection Networks , 2006, 14th IEEE International Symposium on Modeling, Analysis, and Simulation.

[22]  Stephan Merz,et al.  Model Checking , 2000 .