A generalized model for distributed comparison-based system-level diagnosis

Detalhes bibliográficos
Autor(a) principal: Albini,Luiz Carlos Pessoa
Data de Publicação: 2005
Outros Autores: Duarte Jr,Elias Procópio, Ziwich,Roverli Pereira
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Journal of the Brazilian Computer Society
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002005000100005
Resumo: This work introduces a new system-level diagnosis model and an algorithm based on this model: Hi-Comp (Hierarchical Comparison-based Adaptive Distributed System-Level Diagnosis algorithm). This algorithm allows the diagnosis of systems that can be represented by a complete graph. Hi-Comp is the first diagnosis algorithm that is, at the same time, hierarchical, distributed and comparison-based. The algorithm is not limited to crash fault diagnosis, because its tests are based on comparisons. To perform a test, a processor sends a task to two processors of the system that, after executing the task, send their outputs back to the tester. The tester compares the two outputs; if the comparison produces a match, the tester considers the tested processors fault-free; on the other hand, if the comparison produces a mismatch, the tester considers that at least one of the two tested processors is faulty, but can not determine which one. Considering a system of N nodes, it is proved that the algorithm's diagnosability is (N-1) and the latency is log2N testing rounds. Furthermore, a formal proof of the maximum number of tests required per testing round is presented, which can be O(N³). Simulation results are also presented.
id UFRGS-28_c2e62cd3fdf4e395cced480a5071d6e8
oai_identifier_str oai:scielo:S0104-65002005000100005
network_acronym_str UFRGS-28
network_name_str Journal of the Brazilian Computer Society
repository_id_str
spelling A generalized model for distributed comparison-based system-level diagnosisDistributed DiagnosisSystem-Level DiagnosisComparison-Based DiagnosisThis work introduces a new system-level diagnosis model and an algorithm based on this model: Hi-Comp (Hierarchical Comparison-based Adaptive Distributed System-Level Diagnosis algorithm). This algorithm allows the diagnosis of systems that can be represented by a complete graph. Hi-Comp is the first diagnosis algorithm that is, at the same time, hierarchical, distributed and comparison-based. The algorithm is not limited to crash fault diagnosis, because its tests are based on comparisons. To perform a test, a processor sends a task to two processors of the system that, after executing the task, send their outputs back to the tester. The tester compares the two outputs; if the comparison produces a match, the tester considers the tested processors fault-free; on the other hand, if the comparison produces a mismatch, the tester considers that at least one of the two tested processors is faulty, but can not determine which one. Considering a system of N nodes, it is proved that the algorithm's diagnosability is (N-1) and the latency is log2N testing rounds. Furthermore, a formal proof of the maximum number of tests required per testing round is presented, which can be O(N³). Simulation results are also presented.Sociedade Brasileira de Computação2005-04-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002005000100005Journal of the Brazilian Computer Society v.10 n.3 2005reponame:Journal of the Brazilian Computer Societyinstname:Sociedade Brasileira de Computação (SBC)instacron:UFRGS10.1590/S0104-65002005000100005info:eu-repo/semantics/openAccessAlbini,Luiz Carlos PessoaDuarte Jr,Elias ProcópioZiwich,Roverli Pereiraeng2010-05-11T00:00:00Zoai:scielo:S0104-65002005000100005Revistahttps://journal-bcs.springeropen.com/PUBhttps://old.scielo.br/oai/scielo-oai.phpjbcs@icmc.sc.usp.br1678-48040104-6500opendoar:2010-05-11T00:00Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)false
dc.title.none.fl_str_mv A generalized model for distributed comparison-based system-level diagnosis
title A generalized model for distributed comparison-based system-level diagnosis
spellingShingle A generalized model for distributed comparison-based system-level diagnosis
Albini,Luiz Carlos Pessoa
Distributed Diagnosis
System-Level Diagnosis
Comparison-Based Diagnosis
title_short A generalized model for distributed comparison-based system-level diagnosis
title_full A generalized model for distributed comparison-based system-level diagnosis
title_fullStr A generalized model for distributed comparison-based system-level diagnosis
title_full_unstemmed A generalized model for distributed comparison-based system-level diagnosis
title_sort A generalized model for distributed comparison-based system-level diagnosis
author Albini,Luiz Carlos Pessoa
author_facet Albini,Luiz Carlos Pessoa
Duarte Jr,Elias Procópio
Ziwich,Roverli Pereira
author_role author
author2 Duarte Jr,Elias Procópio
Ziwich,Roverli Pereira
author2_role author
author
dc.contributor.author.fl_str_mv Albini,Luiz Carlos Pessoa
Duarte Jr,Elias Procópio
Ziwich,Roverli Pereira
dc.subject.por.fl_str_mv Distributed Diagnosis
System-Level Diagnosis
Comparison-Based Diagnosis
topic Distributed Diagnosis
System-Level Diagnosis
Comparison-Based Diagnosis
description This work introduces a new system-level diagnosis model and an algorithm based on this model: Hi-Comp (Hierarchical Comparison-based Adaptive Distributed System-Level Diagnosis algorithm). This algorithm allows the diagnosis of systems that can be represented by a complete graph. Hi-Comp is the first diagnosis algorithm that is, at the same time, hierarchical, distributed and comparison-based. The algorithm is not limited to crash fault diagnosis, because its tests are based on comparisons. To perform a test, a processor sends a task to two processors of the system that, after executing the task, send their outputs back to the tester. The tester compares the two outputs; if the comparison produces a match, the tester considers the tested processors fault-free; on the other hand, if the comparison produces a mismatch, the tester considers that at least one of the two tested processors is faulty, but can not determine which one. Considering a system of N nodes, it is proved that the algorithm's diagnosability is (N-1) and the latency is log2N testing rounds. Furthermore, a formal proof of the maximum number of tests required per testing round is presented, which can be O(N³). Simulation results are also presented.
publishDate 2005
dc.date.none.fl_str_mv 2005-04-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002005000100005
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002005000100005
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0104-65002005000100005
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Computação
publisher.none.fl_str_mv Sociedade Brasileira de Computação
dc.source.none.fl_str_mv Journal of the Brazilian Computer Society v.10 n.3 2005
reponame:Journal of the Brazilian Computer Society
instname:Sociedade Brasileira de Computação (SBC)
instacron:UFRGS
instname_str Sociedade Brasileira de Computação (SBC)
instacron_str UFRGS
institution UFRGS
reponame_str Journal of the Brazilian Computer Society
collection Journal of the Brazilian Computer Society
repository.name.fl_str_mv Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)
repository.mail.fl_str_mv jbcs@icmc.sc.usp.br
_version_ 1754734669887176704