liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Automatic Parallelization of Equation-Based Simulation Programs
Linköping University, Department of Computer and Information Science, PELAB. Linköping University, The Institute of Technology.
2006 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

Modern equation-based object-oriented modeling languages which have emerged during the past decades make it easier to build models of large and complex systems. The increasing size and complexity of modeled systems requires high performance execution of the simulation code derived from such models. More efficient compilation and code optimization techniques can help to some extent. However, a number of heavy-duty simulation applications require the use of high performance parallel computers in order to obtain acceptable execution times. Unfortunately, the possible additional performance offered by parallel computer architectures requires the simulation program to be expressed in a way that makes the potential parallelism accessible to the parallel computer. Manual parallelization of computer programs is generally a tedious and error prone process. Therefore, it would be very attractive to achieve automatic parallelization of simulation programs.

This thesis presents solutions to the research problem of finding practically usable methods for automatic parallelization of simulation codes produced from models in typical equationbased object-oriented languages. The methods have been implemented in a tool to automatically translate models in the Modelica modeling language to parallel codes which can be efficiently executed on parallel computers. The tool has been evaluated on several application models. The research problem includes the problem of how to extract a sufficient amount of parallelism from equations represented in the form of a data dependency graph (task graph), requiring analysis of the code at a level as detailed as individual expressions. Moreover, efficient clustering algorithms for building clusters of tasks from the task graph are also required. One of the major contributions of this thesis work is a new approach for merging fine-grained tasks by using a graph rewrite system. Results from using this method show that it is efficient in merging task graphs, thereby decreasing their size, while still retaining a reasonable amount of parallelism. Moreover, the new task-merging approach is generally applicable to programs which can be represented as static (or almost static) task graphs, not only to code from equation-based models.

An early prototype called DSBPart was developed to perform parallelization of codes produced by the Dymola tool. The final research prototype is the ModPar tool which is part of the OpenModelica framework. Results from using the DSBpart and ModPar tools show that the amount of parallelism of complex models varies substantially between different application models, and in some cases can produce reasonable speedups. Also, different optimization techniques used on the system of equations from a model affect the amount of parallelism of the model and thus influence how much is gained by parallelization.

Place, publisher, year, edition, pages
Institutionen för datavetenskap , 2006. , 186 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1022
Keyword [en]
Heavy-duty simulation, Parallel computers, Automatic parallelization, Clustering
National Category
Computer Science
URN: urn:nbn:se:liu:diva-7446ISBN: 91-85523-68-2OAI: diva2:22444
Public defence
2006-06-14, Visionen, Hus B, Campus Valla, Linköpings universitet, Linköping, 13:15 (English)
Available from: 2006-09-27 Created: 2006-09-27 Last updated: 2014-10-08

Open Access in DiVA

cover(3586 kB)70 downloads
File information
File name COVER01.pdfFile size 3586 kBChecksum MD5
Type coverMimetype application/pdf
fulltext(1355 kB)2248 downloads
File information
File name FULLTEXT01.pdfFile size 1355 kBChecksum MD5
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Aronsson, Peter
By organisation
PELABThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2248 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 2464 hits
ReferencesLink to record
Permanent link

Direct link