Skip to Main content Skip to Navigation
Journal articles

Optimal Computer Crash Performance Precaution

Abstract : For a parallel computer system with m identical 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.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-00990570
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 4:19:45 PM
Last modification on : Thursday, September 7, 2017 - 1:03:39 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:49:33 PM

File

1840-6833-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990570, version 1

Collections

Citation

Efraim Laksman, Hakan Lennerstad, Lars Lundberg. Optimal Computer Crash Performance Precaution. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2012, Vol. 14 no. 1 (1), pp.55-68. ⟨hal-00990570⟩

Share

Metrics

Record views

124

Files downloads

710