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
Theoretical Aspects on Performance Bounds and Fault Tolerance in Parallel Computing
Responsible organisation
2007 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis consists of two parts: performance bounds for scheduling algorithms for parallel programs in multiprocessor systems, and recovery schemes for fault tolerant distributed systems when one or more computers go down. In the first part we deliver tight bounds on the ratio for the minimal completion time of a parallel program executed in a parallel system in two scenarios. Scenario one, the ratio for minimal completion time when processes can be reallocated compared to when they cannot be reallocated to other processors during their execution time. Scenario two, when a schedule is preemptive, the ratio for the minimal completion time when we use two different numbers of preemptions. The second part discusses the problem of redistribution of the load among running computers in a parallel system. The goal is to find a redistribution scheme that maintains high performance even when one or more computers go down. Here we deliver four different redistribution algorithms. In both parts we use theoretical techniques that lead to explicit worst-case programs and scenarios. The correctness is based on mathematical proofs.

Place, publisher, year, edition, pages
Karlskrona: Blekinge Institute of Technology , 2007. , 169 p.
Series
Blekinge Institute of Technology Doctoral Dissertation Series, ISSN 1653-2090 ; 18
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-00385Local ID: oai:bth.se:forskinfoA46EBB190DFB7CAEC12573A700356D59ISBN: 978-91-7295-126-6 (print)OAI: oai:DiVA.org:bth-00385DiVA: diva2:836625
Available from: 2012-09-18 Created: 2007-12-04 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(1599 kB)58 downloads
File information
File name FULLTEXT01.pdfFile size 1599 kBChecksum SHA-512
2b6c5740b24bfc63ae28ddd26ea9d1160795017e6b6a29d816dd44742f2d6d0a7a3f4f9dc1dca06080077c775c5dc1ff58c168fb972767ae6e4261b08b9a683d
Type fulltextMimetype application/pdf
fulltext(17 kB)9 downloads
File information
File name FULLTEXT02.pdfFile size 17 kBChecksum SHA-512
f77fe91434521e9ea547a0b106de15945f6b595216943de43428b80d79b410a967f3ca579ed629511f059a2be722bdeae252d118428f88fe8ed3d4f85a968dad
Type fulltextMimetype application/pdf

Computer Science

Search outside of DiVA

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

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