Process allocation for load distribution in fault-tolerant multicomputers

Jong Kim, Heejo Lee, Sunggu Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, we consider a load-balancing process allocation method for fault-tolerant multicomputer systems that balances the load before as well as after faults start to degrade the performance of the system. In order to be able to tolerate a single fault, each process (primary process) is duplicated (i.e., has a backup process). The backup process executes on a different processor from the primary, checkpointing the primary process and recovering the process if the primary process fails due to the occurrence of a fault. In this paper, we first formalize the problem of load-balancing process allocation and show that it is an NP-hard problem. Next, we propose a new heuristic process allocation method and analyze the performance of the proposed allocation method. Simulations are used to compare the proposed method with a process allocation method that does not take into account the different load characteristics of the primary and backup processes. While both methods perform well before the occurrence of a fault in a primary process, only the proposed method maintains a balanced load after the occurrence of such a fault.

Original languageEnglish
Title of host publicationProceedings - Annual International Conference on Fault-Tolerant Computing
PublisherIEEE
Pages174-183
Number of pages10
Publication statusPublished - 1995
Externally publishedYes
EventProceedings of the 25th International Symposium on Fault-Tolerant Computing - Pasadena, CA, USA
Duration: 1995 Jun 271995 Jun 30

Other

OtherProceedings of the 25th International Symposium on Fault-Tolerant Computing
CityPasadena, CA, USA
Period95/6/2795/6/30

Fingerprint

Resource allocation
Computational complexity

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Kim, J., Lee, H., & Lee, S. (1995). Process allocation for load distribution in fault-tolerant multicomputers. In Proceedings - Annual International Conference on Fault-Tolerant Computing (pp. 174-183). IEEE.

Process allocation for load distribution in fault-tolerant multicomputers. / Kim, Jong; Lee, Heejo; Lee, Sunggu.

Proceedings - Annual International Conference on Fault-Tolerant Computing. IEEE, 1995. p. 174-183.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, J, Lee, H & Lee, S 1995, Process allocation for load distribution in fault-tolerant multicomputers. in Proceedings - Annual International Conference on Fault-Tolerant Computing. IEEE, pp. 174-183, Proceedings of the 25th International Symposium on Fault-Tolerant Computing, Pasadena, CA, USA, 95/6/27.
Kim J, Lee H, Lee S. Process allocation for load distribution in fault-tolerant multicomputers. In Proceedings - Annual International Conference on Fault-Tolerant Computing. IEEE. 1995. p. 174-183
Kim, Jong ; Lee, Heejo ; Lee, Sunggu. / Process allocation for load distribution in fault-tolerant multicomputers. Proceedings - Annual International Conference on Fault-Tolerant Computing. IEEE, 1995. pp. 174-183
@inproceedings{805727f34dd643f28aa8a7951b451f7a,
title = "Process allocation for load distribution in fault-tolerant multicomputers",
abstract = "In this paper, we consider a load-balancing process allocation method for fault-tolerant multicomputer systems that balances the load before as well as after faults start to degrade the performance of the system. In order to be able to tolerate a single fault, each process (primary process) is duplicated (i.e., has a backup process). The backup process executes on a different processor from the primary, checkpointing the primary process and recovering the process if the primary process fails due to the occurrence of a fault. In this paper, we first formalize the problem of load-balancing process allocation and show that it is an NP-hard problem. Next, we propose a new heuristic process allocation method and analyze the performance of the proposed allocation method. Simulations are used to compare the proposed method with a process allocation method that does not take into account the different load characteristics of the primary and backup processes. While both methods perform well before the occurrence of a fault in a primary process, only the proposed method maintains a balanced load after the occurrence of such a fault.",
author = "Jong Kim and Heejo Lee and Sunggu Lee",
year = "1995",
language = "English",
pages = "174--183",
booktitle = "Proceedings - Annual International Conference on Fault-Tolerant Computing",
publisher = "IEEE",

}

TY - GEN

T1 - Process allocation for load distribution in fault-tolerant multicomputers

AU - Kim, Jong

AU - Lee, Heejo

AU - Lee, Sunggu

PY - 1995

Y1 - 1995

N2 - In this paper, we consider a load-balancing process allocation method for fault-tolerant multicomputer systems that balances the load before as well as after faults start to degrade the performance of the system. In order to be able to tolerate a single fault, each process (primary process) is duplicated (i.e., has a backup process). The backup process executes on a different processor from the primary, checkpointing the primary process and recovering the process if the primary process fails due to the occurrence of a fault. In this paper, we first formalize the problem of load-balancing process allocation and show that it is an NP-hard problem. Next, we propose a new heuristic process allocation method and analyze the performance of the proposed allocation method. Simulations are used to compare the proposed method with a process allocation method that does not take into account the different load characteristics of the primary and backup processes. While both methods perform well before the occurrence of a fault in a primary process, only the proposed method maintains a balanced load after the occurrence of such a fault.

AB - In this paper, we consider a load-balancing process allocation method for fault-tolerant multicomputer systems that balances the load before as well as after faults start to degrade the performance of the system. In order to be able to tolerate a single fault, each process (primary process) is duplicated (i.e., has a backup process). The backup process executes on a different processor from the primary, checkpointing the primary process and recovering the process if the primary process fails due to the occurrence of a fault. In this paper, we first formalize the problem of load-balancing process allocation and show that it is an NP-hard problem. Next, we propose a new heuristic process allocation method and analyze the performance of the proposed allocation method. Simulations are used to compare the proposed method with a process allocation method that does not take into account the different load characteristics of the primary and backup processes. While both methods perform well before the occurrence of a fault in a primary process, only the proposed method maintains a balanced load after the occurrence of such a fault.

UR - http://www.scopus.com/inward/record.url?scp=0028994262&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028994262&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0028994262

SP - 174

EP - 183

BT - Proceedings - Annual International Conference on Fault-Tolerant Computing

PB - IEEE

ER -