2011
DOI: 10.3384/ecp11063143
|View full text |Cite
|
Sign up to set email alerts
|

Towards a Benchmark Suite for Modelica Compilers: Large Models

Abstract: The paper presents a contribution to a Modelica benchmark suite. Basic ideas for a tool independent benchmark suite based on Python scripting along with models for testing the performance of Modelica compilers regarding large systems of equation are given. The automation of running the benchmark suite is demonstrated followed by a selection of benchmark results to determine the current limits of Modelica tools and how they scale for an increasing number of equations.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
6
3

Relationship

3
6

Authors

Journals

citations
Cited by 15 publications
(10 citation statements)
references
References 4 publications
0
10
0
Order By: Relevance
“…This enables a number of optimizations most of which cause expression simplification to be run. It is previously known that the time Modelica backends take to translate a model does not scale linearly to the size of the equations [43], so the findings above should not be surprising.…”
Section: Modelmentioning
confidence: 87%
See 1 more Smart Citation
“…This enables a number of optimizations most of which cause expression simplification to be run. It is previously known that the time Modelica backends take to translate a model does not scale linearly to the size of the equations [43], so the findings above should not be surprising.…”
Section: Modelmentioning
confidence: 87%
“…It may then end up with a chain of operations that loops over variable substitutions and expression simplification. The number of operations performed may scale with the total number of variables in the equation system if there is no limitation of the number of iterations that the optimizer may make [43]. This makes some synthetic models hard to debug.…”
Section: Display Of Operationsmentioning
confidence: 99%
“…It may then end up with a chain of operations that loops over variable substitutions and expression simplification. Frenkel et al (2011) prove that the number of operations performed may scale with the total number of variables in the equation system if there is no limitation of the number of iterations that the optimizer may take. This makes some synthetic models very hard to debug.…”
Section: Presentation Of Operationsmentioning
confidence: 99%
“…Studies have been developed testing how compilers work on large scale models recognizing their limitations on that area (Frenkel et al, 2011;Sezginer, 2014Sezginer, -2015Casella, 2015). In (Jens Frenkel, 2012) particularly, the authors study different causalization (matching) algorithms applied to large scale models and conclude that the PF+ algorithm (by Duff) is the best choice as it achieves linear performance on the tested cases.…”
Section: Related Workmentioning
confidence: 99%