Towards Performance Prediction of Compositional Models in Industrial GALS Designs

Systems and Networks on Chips (NoCs) are a prime design focus of many hardware manufacturers. In addition to functional verification, which is a difficult necessity, the chip designers are facing extremely demanding performance prediction challenges, such as the need to estimate the latency of memory accesses over the NoC. This paper attacks this problem in the setting of designing globally asynchronous, locally synchronous systems (GALS). We describe foundations and applications of a combination of compositional modeling, model checking, and Markov process theory, to arrive at a viable approach to compute performance quantities directly on industrial, functionally verified GALS models.

[1]  Wang Yi,et al.  Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.

[2]  Holger Hermanns,et al.  Quantitative Evaluation in Embedded System Design: Validation of Multiprocessor Multithreaded Architectures , 2008, 2008 Design, Automation and Test in Europe.

[3]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[4]  Radu Mateescu,et al.  CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes , 2007, CAV.

[5]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, CAV.

[6]  Hans A. Hansson Time and probability in formal design of distributed systems , 1991, DoCS.

[7]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[8]  Kim G. Larsen,et al.  Compositional Verification of Probabilistic Processes , 1992, CONCUR.

[9]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

[10]  Rob J. van Glabbeek,et al.  Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract) , 1989, IFIP Congress.

[11]  Holger Hermanns,et al.  Interactive Markov Chains , 2002, Lecture Notes in Computer Science.

[12]  Sonja Georgievska,et al.  Branching Bisimulation Congruence for Probabilistic Systems , 2008, QAPL.

[13]  Holger Hermanns,et al.  Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract) , 1998, CONCUR.

[14]  Roger Les Cottrell,et al.  Adventures in the Evolution of a High-Bandwidth Network for Central Servers , 1994, LISA.

[15]  Joseph Sifakis,et al.  The Algebra of Timed Processes, ATP: Theory and Application , 1994, Inf. Comput..