Modelica is an object-oriented acausal modeling language that is well positioned to become a de-facto standard for expressing models of complex physical systems. To simulate a model expressed in Modelica, it needs to be translated into executable code. For generating run-time efficient code, such a translation needs to employ algebraic formula manipulations. As the SPARK solver has been shown to be competitive for generating such code but currently cannot be used with the Modelica language, we report in this paper how SPARK's symbolic and numerical algorithms can be implemented in OpenModelica, an open-source implementation of a Modelica modeling and simulation environment. We also report benchmark results that show that for our air flow network simulation benchmark, the SPARK solver is competitive with Dymola, which is believed to provide the best solver for Modelica.

JF - Proc. of the 3rd SimBuild Conference CY - Berkeley, CA, USA UR - http://www.ibpsa.us/simbuild2008/technical_sessions/SB08-DOC-TS03-1-Wetter.pdf U2 - LBNL-634E ER - TY - Generic T1 - Graph-theoretic Methods in Simulation Using SPARK T2 - High Performance Computing Symposium of the Advanced Simulation Technologies Conference Y1 - 2004 A1 - Edward F. Sowell A1 - Michael A. Moshier A1 - Philip Haves AB - This paper deals with simulation modeling of nonlinear, deterministic, continuous systems. It describes how the Simulation Problem Analysis and Research Kernel (SPARK) uses the mathematical graph both to describe models of such systems, and to solve the embodied differential-algebraic equation systems (DAEs). Problems are described declaratively rather than algorithmically, with atomic objects representing individual equations and macro objects representing larger programming entities (submodels) in a smooth hierarchy. Internally, in a preprocessing step, graphs are used to represent the problem at the level of equations and variables rather than procedural, multi-equation blocks. Benefits obtained include models that are without predefined input and output sets, enhancing modeling flexibility and code reusability, and relieving the modeler from manual algorithm development. Moreover, graph algorithms are used for problem decomposition and reduction, greatly reducing solution time for wide classes of problems. After describing the methodology the paper presents results of benchmark tests that quantify performance advantages relative to conventional methods. In a somewhat contrived nonlinear example we show O performance as opposed JF - High Performance Computing Symposium of the Advanced Simulation Technologies Conference T3 - Society for Modeling Simulation International CY - Arlington, VA ER - TY - Generic T1 - Graph-Theoretic Methods in Simulation Using SPARK T2 - High Performance Computing Symposium of the Advanced Simulation Technologies Conference (Society for Modeling Simulation International) Y1 - 2004 A1 - Edward F. Sowell A1 - Michael A. Moshier A1 - Philip Haves A1 - Dimitri Curtil JF - High Performance Computing Symposium of the Advanced Simulation Technologies Conference (Society for Modeling Simulation International) CY - Arlington, Virginia, USA ER - TY - JOUR T1 - Efficient Solution Strategies for Building Energy System Simulation JF - Energy and Buildings Y1 - 2001 A1 - Edward F. Sowell A1 - Philip Haves KW - building energy systems KW - computational efficiency KW - graph theory applications KW - hvac simulation KW - hvacsim+ models KW - spark models AB -The efficiencies of methods employed in solution of building simulation models are considered and compared by means of benchmark testing. Direct comparisons between the Simulation Problem Analysis and Research Kernel (SPARK) and the HVACSIM+ programs are presented, as are results for SPARK versus conventional and sparse matrix methods. An indirect comparison between SPARK and the IDA program is carried out by solving one of the benchmark test suite problems using the sparse methods employed in that program. The test suite consisted of two problems chosen to span the range of expected performance advantage. SPARK execution times versus problem size are compared to those obtained with conventional and sparse matrix implementations of these problems. Then, to see if the results of these limiting cases extend to actual problems in building simulation, a detailed control system for a heating, ventilating and air conditioning (HVAC) system is simulated with and without the use of SPARK cut set reduction. Execution times for the reduced and non-reduced SPARK models are compared with those for an HVACSIM+ model of the same system. Results show that the graph-theoretic techniques employed in SPARK offer significant speed advantages over the other methods for significantly reducible problems and that by using sparse methods in combination with graph-theoretic methods even problem portions with little reduction potential can be solved efficiently.

VL - 33 U2 - LBNL-45936 ER - TY - Generic T1 - Numerical Performance of a Graph-Theoretic HVAC Simulation Program T2 - Building Simulation ’99 Y1 - 1999 A1 - Edward F. Sowell A1 - Philip Haves AB - The Simulation Problem Analysis and Research Kernel (SPARK) uses graph-theoretic techniques to match equations to variables and build computational graphs, yielding solution sequences indicated by needed data flow. Additionally, the problem graph is decomposed into strongly connected components, thus reducing the size of simultaneous equation sets, and small cut sets are determined, thereby reducing the number of iteration variables needed to solve each equation set. The improvement in computational efficiency produced by this graph theoretic preprocessing depends on the nature of the problem. The paper explores the improvement one might expect in practice in three ways. First, two problems chosen to span the range of performance are studied and some of the factors determining the performance are identified and discussed. The problem selected to exhibit a large improvement consists of a set of sparsely coupled non-linear equations. The problem selected to represent the other end of the performance spectrum is a set of equations obtained by discretizing Laplace's equation in two dimensions, e.g. a heat conduction problem. Execution time versus problem size is compared to that obtained with sparse matrix implementations of the same problems. Then, to see if the results of these somewhat contrived limiting cases extend to actual problems in building simulation, a detailed control system model of a six- zone VAV HVAC system is simulated with and without the use of cut set reduction. Execution times are compared between the reduced and non-reduced SPARK models, and with those from an HVACSIM+ model of the same system. JF - Building Simulation ’99 CY - Kyoto, Japan UR - http://www.ibpsa.org/proceedings/BS1999/BS99_A-05.pdf ER - TY - Generic T1 - The application of Problem Reduction Techniques Based on Graph Theory to the Simulation of Non-Linear Continuous Systems T2 - EUROSIM’98 Y1 - 1998 A1 - Philip Haves A1 - Edward F. Sowell JF - EUROSIM’98 CY - Manchester, UK ER - TY - Generic T1 - Component-Based and Equation-Based Solvers for HVAC Simulation: a Comparison of HVACSIM+ and SPARK T2 - System Simulation in Buildings '98 Y1 - 1998 A1 - Philip Haves A1 - Edward F. Sowell JF - System Simulation in Buildings '98 CY - Liège, Belgium ER -