The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kami ada kerja dengan N tugasan bersama yang setiap satunya dilaksanakan secara berturut-turut sehingga ia selesai. Sistem pengesanan ralat modular berganda untuk pemprosesan setiap tugas diguna pakai. Sama ada jenis pusat pemeriksaan seperti pusat pemeriksaan bandingkan atau pusat pemeriksaan bandingkan-dan-simpan boleh diletakkan di penghujung tugas. Tiga skim untuk proses kerja di atas dipertimbangkan dan min masa pelaksanaan setiap skim diperolehi. Tiga skim dibandingkan dan skema terbaik ditentukan secara berangka. Sebagai contoh, pekerjaan dengan 4 tugasan diberikan dan 6 jenis skema dibandingkan secara berangka. Akhir sekali, kami menganggap sistem keputusan majoriti sebagai sistem penutup ralat dan mengira masa pelaksanaan min untuk tiga skim.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Toshio NAKAGAWA, Kenichiro NARUSE, Sayori MAEJI, "Random Checkpoint Models with N Tandem Tasks" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 7, pp. 1572-1577, July 2009, doi: 10.1587/transfun.E92.A.1572.
Abstract: We have a job with N tandem tasks each of which is executed successively until it is completed. A double modular system of error detection for the processing of each task is adopted. Either type of checkpoints such as compare-checkpoint or compare-and-store-checkpoint can be placed at the end of tasks. Three schemes for the above process of a job are considered and the mean execution time of each scheme is obtained. Three schemes are compared and the best scheme is determined numerically. As an example, a job with 4 tasks is given and 6 types of schemes are compared numerically. Finally, we consider a majority decision system as an error masking system and compute the mean execution time for three schemes.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.1572/_p
Salinan
@ARTICLE{e92-a_7_1572,
author={Toshio NAKAGAWA, Kenichiro NARUSE, Sayori MAEJI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Random Checkpoint Models with N Tandem Tasks},
year={2009},
volume={E92-A},
number={7},
pages={1572-1577},
abstract={We have a job with N tandem tasks each of which is executed successively until it is completed. A double modular system of error detection for the processing of each task is adopted. Either type of checkpoints such as compare-checkpoint or compare-and-store-checkpoint can be placed at the end of tasks. Three schemes for the above process of a job are considered and the mean execution time of each scheme is obtained. Three schemes are compared and the best scheme is determined numerically. As an example, a job with 4 tasks is given and 6 types of schemes are compared numerically. Finally, we consider a majority decision system as an error masking system and compute the mean execution time for three schemes.},
keywords={},
doi={10.1587/transfun.E92.A.1572},
ISSN={1745-1337},
month={July},}
Salinan
TY - JOUR
TI - Random Checkpoint Models with N Tandem Tasks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1572
EP - 1577
AU - Toshio NAKAGAWA
AU - Kenichiro NARUSE
AU - Sayori MAEJI
PY - 2009
DO - 10.1587/transfun.E92.A.1572
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2009
AB - We have a job with N tandem tasks each of which is executed successively until it is completed. A double modular system of error detection for the processing of each task is adopted. Either type of checkpoints such as compare-checkpoint or compare-and-store-checkpoint can be placed at the end of tasks. Three schemes for the above process of a job are considered and the mean execution time of each scheme is obtained. Three schemes are compared and the best scheme is determined numerically. As an example, a job with 4 tasks is given and 6 types of schemes are compared numerically. Finally, we consider a majority decision system as an error masking system and compute the mean execution time for three schemes.
ER -