Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Optimal computer crash performance precaution
Blekinge Institute of Technology, School of Engineering, Department of Mathematics and Natural Sciences.
Blekinge Institute of Technology, School of Engineering, Department of Mathematics and Natural Sciences.
Blekinge Institute of Technology, School of Computing.
2012 (English)In: Discrete Mathematics and Theoretical Computer Science, ISSN 1462-7264, Vol. 14, no 1, 55-68 p.Article in journal (Refereed) Published
Abstract [en]

For a parallel computer system withmidentical computers, we study optimal performance precaution for one possible computer crash. We want to calculate the cost of crash precaution in the case of no crash. We thus define a tolerance level r meaning that we only tolerate that the completion time of a parallel program after a crash is at most a factor r + 1 larger than if we use optimal allocation on m - 1 computers. This is an r-dependent restriction of the set of allocations of a program. Then, what is the worst-case ratio of the optimal r-dependent completion time in the case of no crash and the unrestricted optimal completion time of the same parallel program? We denote the maximal ratio of completion times f(r, m) - i.e., the ratio for worst-case programs. In the paper we establish upper and lower bounds of the worst-case cost function f(r, m) and characterize worst-case programs.

Place, publisher, year, edition, pages
Maison de l'informatique et des mathematiques discretes , 2012. Vol. 14, no 1, 55-68 p.
Keyword [en]
Computer crash, Load balancing, Optimization, Parallel computer, Process allocation, Scheduling
National Category
Mathematics Computer Science
Identifiers
URN: urn:nbn:se:bth-7056Local ID: oai:bth.se:forskinfoB06EE51C5781B5C7C1257AC90038EBEFOAI: oai:DiVA.org:bth-7056DiVA: diva2:834635
Note
Open Access JournalAvailable from: 2012-12-21 Created: 2012-12-03 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(452 kB)127 downloads
File information
File name FULLTEXT01.pdfFile size 452 kBChecksum SHA-512
5c1f6b6a8d7635634d2283de954ed5e5bb28602bda2a1468d21d76a92e7d422916a817b5c5079e5f410f19a13804db8cb5a712566cb460f2fddb423b900b52fe
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Laksman, EfraimLennerstad, HåkanLundberg, Lars
By organisation
Department of Mathematics and Natural SciencesSchool of Computing
MathematicsComputer Science

Search outside of DiVA

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

urn-nbn

Altmetric score

urn-nbn
Total: 131 hits
CiteExportLink to record
Permanent link

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