Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
An Allocation Strategy Using Shadow-processors and Simulation Technique
Responsible organisation
2001 (English)Conference paper, (Refereed) Published
Abstract [en]

Efficient performance tuning of parallel programs for multiprocessors is often hard. When it comes to assigning threads to processors there is not much support from commercial operating systems, like the Solaris operating system. The only known value is, in best case, the total execution time of each thread. The developer is left to the bin packing algorithm with no knowledge about the interactions and dependencies between the threads. The bin packing algorithm assigns, in the worst case, the threads to the processors such that the program will have the longest possible execution time. A simple example of such a program is shown. We present here a way of retrieving more information and a test mechanism that makes it possible to compare two different assignments of threads on processors also with regard to the interactions and dependencies between the threads. Also an algorithm is proposed that gives the best assignment of threads to processors in the case above where the bin packing algorithm gave the worst possible assignment. The algorithm uses shadow-processors and requires more processors than on the target machine during some allocation steps. Thus, a simulation tool like the one presented here must be used.

Place, publisher, year, edition, pages
Richardson, TX, USA: Int. Soc. Comput. & their Applications - ISCA , 2001.
Keyword [en]
bin packing, multi-threading, multiprocessing systems, parallel programming, resource allocation, software performance evaluation, virtual machines
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-10314ISI: 000179289500062Local ID: oai:bth.se:forskinfo0BA1715F9A4F340DC1256B5200357F39ISBN: 1-880843-39-0 (print)OAI: oai:DiVA.org:bth-10314DiVA: diva2:838409
Conference
ISCA 14th International Conference on Parallel and Distributed Computing Systems
Available from: 2012-09-18 Created: 2002-01-31 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar

Total: 54 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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