Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • 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
A Method for Bounding the Minimal Completion Time in Multiprocessors
Ansvarlig organisasjon
2002 (engelsk)Rapport (Annet vitenskapelig)
Abstract [en]

The cluster systems used today usually prohibit that a running process on one node is reallocated to another node. A parallel program developer thus has to decide how processes should be allocated to the nodes in the cluster. Finding an allocation that results in minimal completion time is NP-hard and (non-optimal) heuristic algorithms have to be used. One major drawback with heuristics is that we do not know if the result is close to optimal or not. In this paper we present a method for finding a guaranteed minimal completion time for a given program. The method can be used as a bound that helps the user to determine when it is worth-while to continue the heuristic search. Based on some parameters derived from the program, as well as some parameters describing the hardware platform, the method produces the minimal completion time bound. The method includes an aggressive branch-and-bound algorithm that has been shown to reduce the search space to 0.0004%. A practical demonstration of the method is presented using a tool that automatically derives the necessary program parameters and produces the bound without the need for a multiprocessor. This makes the method accessible for practitioners.

sted, utgiver, år, opplag, sider
2002.
Serie
Blekinge Institute of Technology Research report, ISSN 1103-1581 ; 3
HSV kategori
Identifikatorer
URN: urn:nbn:se:bth-00202Lokal ID: oai:bth.se:forskinfoAC131D74EA74944DC1256B6100540F3FOAI: oai:DiVA.org:bth-00202DiVA, id: diva2:837588
Tilgjengelig fra: 2012-09-18 Laget: 2002-02-15 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

fulltekst(256 kB)125 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 256 kBChecksum SHA-512
e4362a8009dc3d0fdf0c159b8c5cbb67e6af4c35816308281795afb47042dc7c463924f8137ee3c3bf7a6c1302617779cda67cedf2da5fab0eb0b209e2a03255
Type fulltextMimetype application/pdf

Personposter BETA

Lundberg, Lars

Søk i DiVA

Av forfatter/redaktør
Lundberg, Lars

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 125 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

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

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • 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