Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Predicting and bounding the speedup of multithreaded Solaris programs
Blekinge Tekniska Högskola, Institutionen för programvaruteknik och datavetenskap.
Ansvarlig organisasjon
1999 (engelsk)Inngår i: Journal of Parallel and Distributed Computing, ISSN 0743-7315, E-ISSN 1096-0848, s. 322-333Artikkel i tidsskrift (Fagfellevurdert) 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.

sted, utgiver, år, opplag, sider
SAN DIEGO: ACADEMIC PRESS INC , 1999. s. 322-333
Emneord [en]
performance bound, multiprocessor scheduling, performance prediction, Solaris, speedup
HSV kategori
Identifikatorer
URN: urn:nbn:se:bth-8132ISI: 000080673200003Lokal ID: oai:bth.se:forskinfoC31DA59718A1776FC12575B000213553OAI: oai:DiVA.org:bth-8132DiVA, id: diva2:835821
Tilgjengelig fra: 2012-09-18 Laget: 2009-05-08 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Personposter BETA

Lundberg, Lars

Søk i DiVA

Av forfatter/redaktør
Lundberg, Lars
Av organisasjonen
I samme tidsskrift
Journal of Parallel and Distributed Computing

Søk utenfor DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric

urn-nbn
Totalt: 48 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf