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
Predicting and bounding the speedup of multithreaded Solaris programs
Blekinge Institute of Technology, Department of Software Engineering and Computer Science.
Responsible organisation
1999 (English)In: Journal of Parallel and Distributed Computing, ISSN 0743-7315, E-ISSN 1096-0848, 322-333 p.Article in journal (Refereed) Published
Abstract [en]

In Solaris, threads are frequently relocated. The data associated with a relocated thread have to be moved from the cache of the old processor to the new processor. In order to avoid poor memory performance due to thread relocation, threads can be bound to processors-static scheduling. Finding a static schedule which results in maximum speedup is NP-hard. It is even difficult to determine if a static schedule is close to the optimal case or not. Here, a technique for predicting the speedup of multithreaded Solaris programs is presented. Based on an existing theoretical result, a lower bound on the maximal speedup is also obtained. The predicted speedup and the bound are based on recordings from a single-processor execution. When comparing the predictions with the real speedup using a multiprocessor with eight processors, we see that the predictions are very good. By comparing the speedup of a static schedule with the bound, we see that it is worthwhile to look for other schedules. (C) 1999 Academic Press.

Place, publisher, year, edition, pages
SAN DIEGO: ACADEMIC PRESS INC , 1999. 322-333 p.
Keyword [en]
performance bound, multiprocessor scheduling, performance prediction, Solaris, speedup
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-8132ISI: 000080673200003Local ID: oai:bth.se:forskinfoC31DA59718A1776FC12575B000213553OAI: oai:DiVA.org:bth-8132DiVA: diva2:835821
Available from: 2012-09-18 Created: 2009-05-08 Last updated: 2016-09-06Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Lundberg, Lars
By organisation
Department of Software Engineering and Computer Science
In the same journal
Journal of Parallel and Distributed Computing
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 15 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