id:"swepub:oai:DiVA.org:liu-5720"
Sökning: id:"swepub:oai:DiVA.org:liu-5720" > Automatic Paralleli...
- 1 av 1
- Föregående post
- Nästa post
- Till träfflistan
- Aronsson, PeterLinköpings universitet,PELAB - Laboratoriet för programmeringsomgivningar,Tekniska högskolan (författare)
Automatic Parallelization of Simulation Code from Equation Based Simulation Languages
- BokEngelska2002
Förlag, utgivningsår, omfång ...
- Institutionen för datavetenskap,2002
- 107 s.
- electronicrdacarrier
Nummerbeteckningar
- LIBRIS-ID:oai:DiVA.org:liu-5720
- ISBN:917373280X
- https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5720URI
Kompletterande språkuppgifter
- Språk:engelska
- Sammanfattning på:engelska
Ingår i deldatabas
- SwePubSwePub
Klassifikation
Serie
- Linköping Studies in Science and Technology. Thesis,0280-7971 ;933
Anmärkningar
- Report code: LiU-Tek-Lic-2002:06.
- Modern state-of-the-art equation based object oriented modeling languages such as Modelica have enabled easy modeling of large and complex physical systems. When such complex models are to be simulated, simulation tools typically perform a number of optimizations on the underlying set of equations in the modeled system, with the goal of gaining better simulation performance by decreasing the equation system size and complexity. The tools then typically generate efficient code to obtain fast execution of the simulations. However, with increasing complexity of modeled systems the number of equations and variables are increasing. Therefore, to be able to simulate these large complex systems in an efficient way parallel computing can be exploited.This thesis presents the work of building an automatic parallelization tool that produces an efficient parallel version of the simulation code by building a data dependency graph (task graph) from the simulation code and applying efficient scheduling and clustering algorithms on the task graph. Various scheduling and clustering algorithms, adapted for the requirements from this type of simulation code, have been implemented and evaluated. The scheduling and clustering algorithms presented and evaluated can also be used for functional dataflow languages in general, since the algorithms work on a task graph with dataflow edges between nodes.Results are given in form of speedup measurements and task graph statistics produced by the tool. The conclusion drawn is that some of the algorithms investigated and adapted in this work give reasonable measured speedup results for some specific Modelica models, e.g. a model of a thermofluid pipe gave a speedup of about 2.5 on 8 processors in a PC-cluster. However, future work lies in finding a good algorithm that works well in general.
Ämnesord och genrebeteckningar
- NATURVETENSKAP Data- och informationsvetenskap Datavetenskap hsv//swe
- NATURAL SCIENCES Computer and Information Sciences Computer Sciences hsv//eng
- state-of-the-art equation
- object oriented modeling
- automatic parallelization tool
- data dependency graph
- clustering algorithms
- Computer science
- Datavetenskap
Biuppslag (personer, institutioner, konferenser, titlar ...)
- Fritzson, PeterLinköpings universitet,PELAB - Laboratoriet för programmeringsomgivningar,Tekniska högskolan(Swepub:liu)petfr27 (preses)
- Linköpings universitetPELAB - Laboratoriet för programmeringsomgivningar (creator_code:org_t)
Internetlänk
Hitta via bibliotek
- Automatic Parallelization of Simulation Code from Equation Based Simulation Lang... (Sök publikationen i LIBRIS)
Till lärosätets databas
- 1 av 1
- Föregående post
- Nästa post
- Till träfflistan
Hitta mer i SwePub
- Av författaren/redakt...
- Aronsson, Peter
- Fritzson, Peter
- Om ämnet
-
- NATURVETENSKAP
- NATURVETENSKAP
- och Data och informa ...
- och Datavetenskap
- Delar i serien
- Linköping Studie ...
- Av lärosätet
- Linköpings universitet
Sök utanför SwePub
- Sök vidare i:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - Nationella bibliotekssystem
- LIBRIS.kb.se
