[1993] Proceedings of the Twenty-Sixth Hawaii International Conference on System Sciences
DOI: 10.1109/hicss.1993.284082
|View full text |Cite
|
Sign up to set email alerts
|

Partitioning for efficient consensus

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…• Graph Partition: divides the system into diagnosis groups where inter-component tests are performed following a given test assignment. The partitioning approaches perform better than non-partitioning ones that cover the whole system by reducing unnecessary extra message traffic and processing time [7]. • Logger: takes the responsibility of error logging, for statistic analysis, system report, etc.…”
Section: A Global Diagnosis Service Architecturementioning
confidence: 99%
“…• Graph Partition: divides the system into diagnosis groups where inter-component tests are performed following a given test assignment. The partitioning approaches perform better than non-partitioning ones that cover the whole system by reducing unnecessary extra message traffic and processing time [7]. • Logger: takes the responsibility of error logging, for statistic analysis, system report, etc.…”
Section: A Global Diagnosis Service Architecturementioning
confidence: 99%
“…4. As a result, distributed failure diagnosis theoretically improves the throughput of a system by the number of fault-free units over the same system employing NMR [25]. A penalty is incurred, when a fault occurs and the system must switch the tasks from faulty units to active standby to recover the system for its continued operation.…”
Section: The Proposed Diagnosis Algorithmmentioning
confidence: 99%