Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Selecting Simulation Models when Predicting Parallel Program Behaviour
Responsible organisation
2002 (English)Report (Other academic)
Abstract [en]

The use of multiprocessors is an important way to increase the performance of a supercom-puting program. This means that the program has to be parallelized to make use of the multi-ple processors. The parallelization is unfortunately not an easy task. Development tools supporting parallel programs are important. Further, it is the customer that decides the number of processors in the target machine, and as a result the developer has to make sure that the pro-gram runs efficiently on any number of processors. Many simulation tools support the developer by simulating any number of processors and predict the performance based on a uni-processor execution trace. This popular technique gives reliable results in many cases. Based on our experience from developing such a tool, and studying other (commercial) tools, we have identified three basic simulation models. Due to the flexibility of general purpose programming languages and operating systems, like C/C++ and Sun Solaris, two of the models may cause deadlock in a deadlock-free program. Selecting the appropriate model is difficult, since we in this paper also show that the three models have significantly different accuracy when using real world programs. Based on the findings we present a practical scheme when to use the three models.

Place, publisher, year, edition, pages
2002.
Series
Blekinge Tekniska Högskola Forskningsrapport, ISSN 1103-1581 ; 4
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-00189Local ID: oai:bth.se:forskinfo2CA4F771C77169E6C1256B65002BF692OAI: oai:DiVA.org:bth-00189DiVA: diva2:838230
Available from: 2012-09-18 Created: 2002-02-19 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(171 kB)170 downloads
File information
File name FULLTEXT01.pdfFile size 171 kBChecksum SHA-512
73592299711e86f215e8a5a13ff3f26a8a3ca8ff17eb323e34d0bc2636c1671f6a878343ff501268b9680d141d3f674d449b6692c065516fc6b018a921db319b
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Lundberg, LarsGrahn, Håkan
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 170 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

urn-nbn

Altmetric score

urn-nbn
Total: 101 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf