Efraim Laksman ; Hakan Lennerstad ; Lars Lundberg - Optimal Computer Crash Performance Precaution

dmtcs:573 - Discrete Mathematics & Theoretical Computer Science, March 23, 2012, Vol. 14 no. 1 - https://doi.org/10.46298/dmtcs.573
Optimal Computer Crash Performance PrecautionArticle

Authors: Efraim Laksman 1; Hakan Lennerstad 1; Lars Lundberg 1

  • 1 Blekinge Institute of Technology

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.

Volume: Vol. 14 no. 1
Section: Distributed Computing and Networking
Published on: March 23, 2012
Accepted on: June 9, 2015
Submitted on: April 18, 2011
Keywords: parallel computer,scheduling,computer crash,load balancing,process allocation,optimization,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 375 times.
This article's PDF has been downloaded 301 times.