On the optimal total processing time using checkpoints

Boyan Dimitrov; Zainaab Khalil; Nikolai Kolev; Peter Petrov

doi:10.1109/32.90446

On the optimal total processing time using checkpoints

Boyan Dimitrov, Zainaab Khalil, Nikolai Kolev, Peter Petrov

Kettering University

Research output: Contribution to journal › Article › peer-review

Abstract

The authors investigate the problem of optimizing the expected blocking time duration by providing a schedule of checkpoints during the required job processing time. They give a general approach for determining the optimal checkpoint schedule and derive some cases when the optimal checkpointing is uniform. The model has applications in unreliable computing systems, multiclient computer service, data transmissions, etc.

Original language	American English
Journal	IEEE Transactions on Software Engineering
Volume	17
DOIs	https://doi.org/10.1109/32.90446
State	Published - May 1 1991

Disciplines

Mathematics

Access to Document

10.1109/32.90446License: Unspecified

Cite this

@article{e38f15ad684c490a8eaba7ad1efc32bb,

title = "On the optimal total processing time using checkpoints",

abstract = " The authors investigate the problem of optimizing the expected blocking time duration by providing a schedule of checkpoints during the required job processing time. They give a general approach for determining the optimal checkpoint schedule and derive some cases when the optimal checkpointing is uniform. The model has applications in unreliable computing systems, multiclient computer service, data transmissions, etc. ",

author = "Boyan Dimitrov and Zainaab Khalil and Nikolai Kolev and Peter Petrov",

note = "IEEE Xplore, delivering full text access to the world's highest quality technical literature in engineering and technology. | IEEE Xplore",

year = "1991",

month = may,

day = "1",

doi = "10.1109/32.90446",

language = "American English",

volume = "17",

journal = "IEEE Transactions on Software Engineering",

}

TY - JOUR

T1 - On the optimal total processing time using checkpoints

AU - Dimitrov, Boyan

AU - Khalil, Zainaab

AU - Kolev, Nikolai

AU - Petrov, Peter

N1 - IEEE Xplore, delivering full text access to the world's highest quality technical literature in engineering and technology. | IEEE Xplore

PY - 1991/5/1

Y1 - 1991/5/1

N2 - The authors investigate the problem of optimizing the expected blocking time duration by providing a schedule of checkpoints during the required job processing time. They give a general approach for determining the optimal checkpoint schedule and derive some cases when the optimal checkpointing is uniform. The model has applications in unreliable computing systems, multiclient computer service, data transmissions, etc.

AB - The authors investigate the problem of optimizing the expected blocking time duration by providing a schedule of checkpoints during the required job processing time. They give a general approach for determining the optimal checkpoint schedule and derive some cases when the optimal checkpointing is uniform. The model has applications in unreliable computing systems, multiclient computer service, data transmissions, etc.

UR - https://doi.org/10.1109/32.90446

U2 - 10.1109/32.90446

DO - 10.1109/32.90446

M3 - Article

VL - 17

JO - IEEE Transactions on Software Engineering

JF - IEEE Transactions on Software Engineering

ER -

On the optimal total processing time using checkpoints

Abstract

Disciplines

Access to Document

Other files and links

Cite this