Efficient Compilation of Large Scale Dynamical Systems

Abstract

In this work, we present a novel methodology to efficiently compile large scale dynamical systems described as Modelica models, and its implementation in a prototype Modelica Compiler called ModelicaCC. The methodology allows to perform the different stages of the compilation process without expanding the content of repetitive structures so the resources (CPU time and memory) used by the compiler result independent on the model size. Besides introducing the methodology with their algorithms and the implementation in the ModelicaCC compiler, we analyze their efficiency comparing its performance with that of OpenModelica in different large scale models.

Equation-based languages – A new paradigm for building energy modeling, simulation and optimization

“…Related work [9,38,10,14,21,22,23] shows other aspects of these technologies and identifies research and development needs in order to advance it to a state where it can become an integral part of building energy simulation.…”

“…[36,17,33,37]. To make these technologies accessible to a wide range of users in building simulation, research and development is required and ongoing to advance translators and solvers so they can better handle large models [9,38,10,14,21,22,23].…”

Connected Components in Undirected Set--Based Graphs. Applications in Object--Oriented Model Manipulation

“…Fortunately, large models often contain several repetitive connections that are the result of using for statements and this is a fact that can be exploited to reduce the computational cost of the different compilation stages [4,5,6,7,8,9,10,11,12]. However, the possibility of exploiting the presence of repetitive or regular structures at each stage requires that the previous stages had kept a compact representation.…”

“…However, the possibility of exploiting the presence of repetitive or regular structures at each stage requires that the previous stages had kept a compact representation. While there are some experimental implementations that in some particular cases can keep a compact representation during the whole compilation process [7], there is not yet a general solution.…”

“…The problem of manipulating large graphs grouping vertices and edges into sets to produce compact systems of equations was recently proposed with the introduction of Set-Based Graphs [13]. There, a compact solution for the problems of maximum matching and finding strongly connected components in directed graph for equation sorting was proposed and implemented as part of the prototype ModelicaCC compiler [7].…”