Academic
Publications
Towards Performance Prediction of Compositional Models in Industrial GALS Designs

Towards Performance Prediction of Compositional Models in Industrial GALS Designs,10.1007/978-3-642-02658-4_18,Nicolas Coste,Holger Hermanns,Etienne L

Towards Performance Prediction of Compositional Models in Industrial GALS Designs   (Citations: 5)
BibTex | RIS | RefWorks Download
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.
Conference: Computer Aided Verification - CAV , pp. 204-218, 2009
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Since IMCs smoothly extend classical LTSs, the model has received attention in academic as well as in industrial settings [8,14,15]...
    • ...Then we use interactive probabilistic chains (IPCs) [15] to define a discretization which reduces the time interval bounded reachability problem in IMCs to the problem of computing step-interval bounded reachability probabilities in IPCs...
    • ...Interactive probabilistic chains (IPCs) [15] are the discrete-time analogon of IMCs:...

    Lijun Zhanget al. Model Checking Interactive Markov Chains

    • ...More recently, the Imc theory has been transposed into a discrete-time setting, leading to the Ipc (Interactive Probabilistic Chain) theory [4]...
    • ...An Ipc (Interactive Probabilistic Chain ) [4] can be seen as a transposition of the Imc approach to a discrete time setting...
    • ...The Ipc Distribution tool takes as input a deterministic Ipc and two actions a and b and computes the long-run average probability distribution of the latency between a and b [4]...
    • ...Our performance evaluation study [4] aimed at predicting throughput and latency of communication between xSTream queues...

    Nicolas Costeet al. Ten Years of Performance Evaluation for Concurrent Systems Using CADP

    • ...Interactive probabilistic chains (IPCs) are state-based models that combine discrete-time Markov chains and labelled transition systems [9]...

    Georgel Calinet al. Time-Bounded Reachability in Distributed Input/Output Interactive Prob...

    • ...applications of various domains, ranging from dynamic fault trees [11,10,12], architectural description languages such as AADL (Architectural Analysis and Design Language) [9,15,13,14], generalised stochastic Petri nets [40] and Statemate [8] to GALS (Globally Asynchronous Locally Synchronous) hardware design [22,19,23]...
    • ...Definition 8 (Interactive probabilistic chain [23])...

    Holger Hermannset al. The How and Why of Interactive Markov Chains

Sort by: